Stéphane Vialette
Stéphane Vialette
LIGM, Univ Gustave Eiffel, CNRS, F-77454 Marne-la-Vallée, France
Verified email at univ-eiffel.fr
Title
Cited by
Cited by
Year
Combinatorics of Genome Rearrangements
G Fertin, A Labarre, I Rusu, E Tannier, S Vialette
MIT Press, August 29, 36-44, 2009
3232009
On the parameterized complexity of multiple-interval graph problems
MR Fellows, D Hermelin, F Rosamond, S Vialette
Theoretical computer science 410 (1), 53-61, 2009
2782009
In Saccharomyces cerevisiae, ATP2 mRNA sorting to the vicinity of mitochondria is essential for respiratory function
A Margeot, C Blugeon, J Sylvestre, S Vialette, C Jacq, M Corral‐Debrinski
The EMBO journal 21 (24), 6893-6904, 2002
1082002
On the computational complexity of 2-interval pattern matching problems
S Vialette
Theoretical Computer Science 312 (2-3), 223-249, 2004
1042004
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
International Colloquium on Automata, Languages, and Programming, 340-351, 2007
792007
Upper and lower bounds for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
Journal of Computer and System Sciences 77 (4), 799-811, 2011
782011
Multiple genome rearrangement by swaps and by element duplications
VY Popov
Theoretical Computer Science 385 (1-3), 115-126, 2007
782007
Long mRNAs coding for yeast mitochondrial proteins of prokaryotic origin preferentially localize to the vicinity of mitochondria
J Sylvestre, S Vialette, MC Debrinski, C Jacq
Genome biology 4 (7), 1-9, 2003
782003
On the approximability of comparing genomes with duplicates.
S Angibaud, G Fertin, I Rusu, A Thévenin, S Vialette
Journal of Graph Algorithms and Applications 13 (1), 19-53, 2009
582009
Combinatorics of genome rearrangements. Computational molecular biology
G Fertin, A Labarre, I Rusu, É Tannier, S Vialette
MIT Press, 2009
512009
Comparing genomes with duplications: a computational complexity point of view
G Blin, C Chauve, G Fertin, R Rizzi, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 523-534, 2007
502007
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
G Blin, G Fertin, F Sikora, S Vialette
International Workshop on Algorithms and Computation, 357-368, 2009
432009
Exemplar longest common subsequence
P Bonizzoni, G Della Vedova, R Dondi, G Fertin, R Rizzi, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 535-543, 2007
412007
Approximating the 2-interval pattern problem
M Crochemore, D Hermelin, GM Landau, S Vialette
European Symposium on Algorithms, 426-437, 2005
392005
Complexity issues in vertex-colored graph pattern matching
R Dondi, G Fertin, S Vialette
Journal of Discrete Algorithms 9 (1), 82-99, 2011
362011
Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes
S Angibaud, G Fertin, I Rusu, A Thévenin, S Vialette
Journal of Computational Biology 15 (8), 1093-1115, 2008
362008
Querying graphs in protein-protein interactions networks using feedback vertex set
G Blin, F Sikora, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 7 (4), 628-635, 2010
332010
New results for the 2-interval pattern problem
G Blin, G Fertin, S Vialette
Annual Symposium on Combinatorial Pattern Matching, 311-322, 2004
332004
Locating a tree in a phylogenetic network in quadratic time
P Gambette, ADM Gunawan, A Labarre, S Vialette, L Zhang
International Conference on Research in Computational Molecular Biology, 96-107, 2015
322015
Pattern matching for 321-avoiding permutations
S Guillemot, S Vialette
International Symposium on Algorithms and Computation, 1064-1073, 2009
302009
The system can't perform the operation now. Try again later.
Articles 1–20