2009 |
42 | EE | Guillaume Blin,
Florian Sikora,
Stéphane Vialette:
Querying Protein-Protein Interaction Networks.
ISBRA 2009: 52-62 |
41 | EE | Guillaume Blin,
Guillaume Fertin,
Florian Sikora,
Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.
WALCOM 2009: 357-368 |
40 | EE | 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) |
2008 |
39 | | Craig E. Nelson,
Stéphane Vialette:
Comparative Genomics, International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Proceedings
Springer 2008 |
38 | EE | Stéphane Vialette:
Two-Interval Pattern Problems.
Encyclopedia of Algorithms 2008 |
37 | EE | 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) |
36 | EE | 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) |
35 | EE | Danny Hermelin,
Dror Rawitz,
Romeo Rizzi,
Stéphane Vialette:
The Minimum Substring Cover problem.
Inf. Comput. 206(11): 1303-1312 (2008) |
34 | EE | 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) |
33 | EE | 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) |
32 | EE | 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) |
31 | EE | 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) |
2007 |
30 | EE | 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 |
29 | EE | Guillaume Fertin,
Danny Hermelin,
Romeo Rizzi,
Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
CPM 2007: 241-252 |
28 | EE | Mathilde Bouvel,
Dominique Rossin,
Stéphane Vialette:
Longest Common Separable Pattern Among Permutations.
CPM 2007: 316-327 |
27 | EE | Gaëlle Brevier,
Romeo Rizzi,
Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs.
FCT 2007: 137-148 |
26 | EE | 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 |
25 | | Riccardo Dondi,
Guillaume Fertin,
Stéphane Vialette:
Weak pattern matching in colored graphs: Minimizing the number of connected components.
ICTCS 2007: 27-38 |
24 | EE | 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 |
23 | EE | Danny Hermelin,
Dror Rawitz,
Romeo Rizzi,
Stéphane Vialette:
The Minimum Substring Cover Problem.
WAOA 2007: 170-183 |
22 | EE | Philippe Gambette,
Stéphane Vialette:
On Restrictions of Balanced 2-Interval Graphs.
WG 2007: 55-65 |
21 | EE | Philippe Gambette,
Stéphane Vialette:
On restrictions of balanced 2-interval graphs
CoRR abs/0704.1571: (2007) |
20 | EE | Mathilde Bouvel,
Dominique Rossin,
Stéphane Vialette:
Longest Common Separable Pattern between Permutations
CoRR abs/math/0702109: (2007) |
19 | EE | 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) |
18 | EE | 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) |
17 | EE | 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) |
16 | EE | 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) |
2006 |
15 | EE | Marcin Kubica,
Romeo Rizzi,
Stéphane Vialette,
Tomasz Walen:
Approximation of RNA Multiple Structural Alignment.
CPM 2006: 211-222 |
14 | EE | 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 |
13 | EE | 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 |
12 | EE | 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 |
11 | EE | 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) |
2005 |
10 | EE | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Stéphane Vialette:
Approximating the 2-Interval Pattern Problem.
ESA 2005: 426-437 |
9 | EE | 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 |
8 | EE | Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
MFCS 2005: 328-339 |
7 | EE | Guillaume Blin,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.
WG 2005: 271-282 |
6 | EE | 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) |
2004 |
5 | EE | Guillaume Blin,
Guillaume Fertin,
Stéphane Vialette:
New Results for the 2-Interval Pattern Problem.
CPM 2004: 311-322 |
4 | EE | 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) |
3 | | 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) |
2 | EE | Stéphane Vialette:
On the computational complexity of 2-interval pattern matching problems.
Theor. Comput. Sci. 312(2-3): 223-249 (2004) |
2002 |
1 | EE | Stéphane Vialette:
Pattern Matching Problems over 2-Interval Sets.
CPM 2002: 53-63 |