Stéphane Vialette

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013)

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette: Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013)

Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012)

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

Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474

Guillaume Blin, Minghui Jiang, Stéphane Vialette: The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142

Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette: On the combinatorics of suffix arrays. CoRR abs/1206.3877 (2012)

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011)

Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen: Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011)

Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30

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

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding Approximate and Constrained Motifs in Graphs. CPM 2011: 388-401

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

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)

Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette: Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. 411(4-5): 716-729 (2010)

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010)

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

Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77

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

Guillaume Fertin, Stéphane Vialette: On the S-Labeling problem. Electronic Notes in Discrete Mathematics 34: 273-277 (2009)

Craig E. Nelson, Stéphane Vialette: RECOMB-Comparative Genomics Special Issue. Journal of Computational Biology 16(10): 1285-1286 (2009)

Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7(1): 90-101 (2009)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. 13(1): 19-53 (2009)

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009)

Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette: On Finding Small 2-Generating Sets. COCOON 2009: 378-387

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Maximum Motif Problem in Vertex-Colored Graphs. CPM 2009: 221-235

Sylvain Guillemot, Stéphane Vialette: Pattern Matching for 321-Avoiding Permutations. ISAAC 2009: 1064-1073

Guillaume Blin, Florian Sikora, Stéphane Vialette: Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62

Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette: Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137

Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette: The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. Journal of Computational Biology 15(8): 1093-1115 (2008)

Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette: Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. J. Discrete Algorithms 6(2): 178-191 (2008)

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)

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette: Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008)

Stéphane Vialette: Two-Interval Pattern Problems. Encyclopedia of Algorithms 2008

Craig E. Nelson, Stéphane Vialette (Eds.): Comparative Genomics, International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Proceedings. Lecture Notes in Computer Science 5267, Springer 2008, isbn 978-3-540-87988-6

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: On the Approximability of Comparing Genomes with Duplicates. CoRR abs/0806.1103 (2008)

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)

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette: A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology 14(4): 379-393 (2007)

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)

Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette: Exemplar Longest Common Subsequence. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 535-543 (2007)

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)

Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252

Mathilde Bouvel, Dominique Rossin, Stéphane Vialette: Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327

Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette: Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007: 137-148

Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG 2007: 16-29

Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette: The Minimum Substring Cover Problem. WAOA 2007: 170-183

Philippe Gambette, Stéphane Vialette: On Restrictions of Balanced 2-Interval Graphs. WG 2007: 55-65

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

Philippe Gambette, Stéphane Vialette: On restrictions of balanced 2-interval graphs. CoRR abs/0704.1571 (2007)

Mathilde Bouvel, Dominique Rossin, Stéphane Vialette: Longest Common Separable Pattern between Permutations. CoRR abs/math/0702109 (2007)

Gaëlle Lelandais, Pierre Vincens, Anne Badel-Chagnon, Stéphane Vialette, Claude Jacq, Serge A. Hazout: Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms. Bioinformatics 22(11): 1359-1366 (2006)

Stéphane Vialette: Packing of (0, 1)-matrices. ITA 40(4): 519-535 (2006)

Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen: Approximation of RNA Multiple Structural Alignment. CPM 2006: 211-222

Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Exemplar Longest Common Subsequence. International Conference on Computational Science (2) 2006: 622-629

Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) 2006: 783-790

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette: How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics 2006: 75-86

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)

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette: Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437

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

Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339

Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282

Gaëlle Lelandais, Philippe Marc, Pierre Vincens, Claude Jacq, Stéphane Vialette: MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. BMC Bioinformatics 5: 20 (2004)

Gaëlle Lelandais, Stéphane Le Crom, Frédéric Devaux, Stéphane Vialette, George M. Church, Claude Jacq, Philippe Marc: yMGV: a cross-species expression data mining tool. Nucleic Acids Research 32(Database-Issue): 323-325 (2004)

Stéphane Vialette: On the computational complexity of 2-interval pattern matching problems. Theor. Comput. Sci. 312(2-3): 223-249 (2004)

Guillaume Blin, Guillaume Fertin, Stéphane Vialette: New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322

Stéphane Vialette: Pattern Matching Problems over 2-Interval Sets. CPM 2002: 53-63