Folgen
Stéphane Vialette
Stéphane Vialette
LIGM, Univ Gustave Eiffel, CNRS, F-77454 Marne-la-Vallée, France
Bestätigte E-Mail-Adresse bei univ-eiffel.fr
Titel
Zitiert von
Zitiert von
Jahr
Combinatorics of Genome Rearrangements
G Fertin, A Labarre, I Rusu, E Tannier, S Vialette
MIT Press, August 29, 36-44, 2009
3622009
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
3452009
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
1282002
On the computational complexity of 2-interval pattern matching problems
S Vialette
Theoretical Computer Science 312 (2-3), 223-249, 2004
1032004
Long mRNAs coding for yeast mitochondrial proteins of prokaryotic origin preferentially localize to the vicinity of mitochondria
J Sylvestre, S Vialette, M Corral Debrinski, C Jacq
Genome biology 4 (7), 1-9, 2003
932003
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
842011
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
MR Fellows, G Fertin, D Hermelin, S Vialette
Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007
802007
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
682009
Combinatorics of genome rearrangements. Computational molecular biology
G Fertin, A Labarre, I Rusu, É Tannier, S Vialette
MIT Press, 2009
642009
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
WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009
462009
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
432007
Approximating the 2-interval pattern problem
M Crochemore, D Hermelin, GM Landau, S Vialette
Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005
402005
Complexity issues in vertex-colored graph pattern matching
R Dondi, G Fertin, S Vialette
Journal of Discrete Algorithms 9 (1), 82-99, 2011
392011
Pattern Matching for 321-Avoiding Permutations.
S Guillemot, S Vialette
ISAAC 5878, 1064-1073, 2009
382009
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
382008
Locating a tree in a phylogenetic network in quadratic time
P Gambette, ADM Gunawan, A Labarre, S Vialette, L Zhang
Research in Computational Molecular Biology: 19th Annual International …, 2015
352015
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
352010
New results for the 2-interval pattern problem
G Blin, G Fertin, S Vialette
Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul …, 2004
352004
Maximum Motif Problem in Vertex-Colored Graphs.
R Dondi, G Fertin, S Vialette
CPM, 221-235, 2009
332009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20