| 2012 | ||
|---|---|---|
| j10 | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora: On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112(7): 272-276 (2012) | |
| j9 | Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012) | |
| c23 | Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette: Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM 2012: 138-148 | |
| c22 | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora: Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 | |
| c21 | Guillaume Blin, Minghui Jiang, Stéphane Vialette: The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142 | |
| c20 | Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru: An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC 2012: 319-329 | |
| 2011 | ||
| c19 | Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 | |
| c18 | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette: Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011: 272-286 | |
| c17 | Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR 2011: 373-384 | |
| 2010 | ||
| j8 | Guillaume Blin, David Faye, Jens Stoye: Finding Nested Common Intervals Efficiently. Journal of Computational Biology 17(9): 1183-1194 (2010) | |
| j7 | Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Hélène Touzet: Alignments of RNA Structures. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2): 309-322 (2010) | |
| j6 | Guillaume Blin, Florian Sikora, Stéphane Vialette: Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 628-635 (2010) | |
| c16 | Guillaume Blin, Florian Sikora, Stéphane Vialette: GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB 2010: 38-43 | |
| c15 | Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77 | |
| c14 | Guillaume Blin, Sylvie Hamel, Stéphane Vialette: Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. WALCOM 2010: 149-160 | |
| 2009 | ||
| c13 | Guillaume Blin, Florian Sikora, Stéphane Vialette: Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62 | |
| c12 | ||
| c11 | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette: The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368 | |
| 2008 | ||
| j5 | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008) | |
| i1 | Guillaume Blin, Sylvie Hamel, Stéphane Vialette: Comparing RNA structures using a full set of biologically relevant edit operations is intractable. CoRR abs/0812.3946 (2008) | |
| 2007 | ||
| j4 | Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Gene Maps Linearization Using Genomic Rearrangement Distances. Journal of Computational Biology 14(4): 394-407 (2007) | |
| j3 | Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 523-534 (2007) | |
| j2 | Guillaume Blin, Guillaume Fertin, Stéphane Vialette: Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. 385(1-3): 241-263 (2007) | |
| c10 | Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151 | |
| c9 | Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette: Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB 2007: 101-112 | |
| 2006 | ||
| c8 | Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras: Inferring Positional Homologs with Common Intervals of Sequences. Comparative Genomics 2006: 24-38 | |
| c7 | Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. Comparative Genomics 2006: 99-112 | |
| c6 | Guillaume Blin, Hélène Touzet: How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. SPIRE 2006: 291-303 | |
| 2005 | ||
| j1 | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? T. Comp. Sys. Biology 2: 1-36 (2005) | |
| c5 | Guillaume Blin, Romeo Rizzi: Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON 2005: 22-31 | |
| c4 | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868 | |
| c3 | Guillaume Blin, Cedric Chauve, Guillaume Fertin: Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20 | |
| c2 | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282 | |
| 2004 | ||
| c1 | Guillaume Blin, Guillaume Fertin, Stéphane Vialette: New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322 | |
Colors in the list of coauthors
Last update Wed May 22 16:17:48 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page