FR
Stéphane VIALETTE
Directeur de Recherche CNRS Directeur du Laboratoire d'Informatique Gaspard-Monge (LIGM), UMR 8049
CFR / LIGM - Laboratoire d’Informatique Gaspard Monge
Champs-sur-Marne
Bâtiment: Building: Copernic
5 boulevard Descartes$Champs-sur-Marne$77454 Marne-la-Vallée Cedex 2
Bureau: Office: 4B135
+33 (0)1 60 95 77 30
Qui contacter en cas d'absence:
In case of emergency:
Jamal NAJIM
Stéphane VIALETTE
Directeur de Recherche CNRS Directeur du Laboratoire d'Informatique Gaspard-Monge (LIGM), UMR 8049
CFR / LIGM - Laboratoire d’Informatique Gaspard Monge
Mes dernières références
My latest references
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
Parity Permutation Pattern Matching. WALCOM, Mar 2023, Hsinchu, Taiwan
Parity Permutation Pattern Matching. WALCOM, Mar 2023, Hsinchu, Taiwan
Laurent Bulteau, Vincent Jugé, Stéphane Vialette
On shuffled-square-free words. Theoretical Computer Science, 2023, 941, pp.91-103
⟨10.1016/j.tcs.2022.10.028⟩
On shuffled-square-free words. Theoretical Computer Science, 2023, 941, pp.91-103
⟨10.1016/j.tcs.2022.10.028⟩
Romeo Rizzi, Stéphane Vialette
On recognising words that are squares for the shuffle product. Theoretical Computer Science, 2023, 956, pp.111156.1-16
⟨10.1016/j.tcs.2017.04.003⟩
On recognising words that are squares for the shuffle product. Theoretical Computer Science, 2023, 956, pp.111156.1-16
⟨10.1016/j.tcs.2017.04.003⟩
Virginia Ardévol Martínez, Florian Sikora, Romeo Rizzi, Stéphane Vialette
Recognizing Unit Multiple Intervals Is Hard. 34th International Symposium on Algorithms and Computation (ISAAC 2023), Dec 2023, Kyoto, Japan
⟨10.4230/LIPIcs.ISAAC.2023.8⟩
Recognizing Unit Multiple Intervals Is Hard. 34th International Symposium on Algorithms and Computation (ISAAC 2023), Dec 2023, Kyoto, Japan
⟨10.4230/LIPIcs.ISAAC.2023.8⟩
Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette
Permutation Pattern Matching for Doubly Partially Ordered Patterns. 33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic
Permutation Pattern Matching for Doubly Partially Ordered Patterns. 33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic
Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
The Maximum Zero-Sum Partition Problem. 25th International Computer Symposium, ICS 2022, Dec 2022, Taoyuan, Taiwan. pp.73-85
⟨10.1007/978-981-19-9582-8_7⟩
The Maximum Zero-Sum Partition Problem. 25th International Computer Symposium, ICS 2022, Dec 2022, Taoyuan, Taiwan. pp.73-85
⟨10.1007/978-981-19-9582-8_7⟩
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic Aspects of Small Quasi-Kernels. 48TH International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2022, Tubingen/Germany, Germany. pp.370-382
⟨10.1007/978-3-031-15914-5_27⟩
Algorithmic Aspects of Small Quasi-Kernels. 48TH International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2022, Tubingen/Germany, Germany. pp.370-382
⟨10.1007/978-3-031-15914-5_27⟩
Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
Algorithmic aspects of quasi-kernels. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Algorithmic aspects of quasi-kernels. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Laurent Bulteau, Samuele Giraudo, Stéphane Vialette
Disorders and Permutations. 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland
⟨10.4230/LIPIcs.CPM.2021.11⟩
Disorders and Permutations. 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland
⟨10.4230/LIPIcs.CPM.2021.11⟩
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, et al.
Efficient, robust and effective rank aggregation for massive biological datasets. Future Generation Computer Systems, 2021, 124, pp.406-421
⟨10.1016/j.future.2021.06.013⟩
Efficient, robust and effective rank aggregation for massive biological datasets. Future Generation Computer Systems, 2021, 124, pp.406-421
⟨10.1016/j.future.2021.06.013⟩
Laurent Bulteau, Stéphane Vialette
Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, 2020, 806, pp.116-132
⟨10.1016/j.tcs.2019.01.012⟩
Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, 2020, 806, pp.116-132
⟨10.1016/j.tcs.2019.01.012⟩
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, et al.
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. 2019 15th International Conference on eScience (eScience), Sep 2019, San Diego, France. pp.136-145
⟨10.1109/eScience.2019.00022⟩
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. 2019 15th International Conference on eScience (eScience), Sep 2019, San Diego, France. pp.136-145
⟨10.1109/eScience.2019.00022⟩
Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC, Apr 2019, Kitakyushu, Japan. pp.242-261
⟨10.1007/978-3-030-14812-6_15⟩
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC, Apr 2019, Kitakyushu, Japan. pp.242-261
⟨10.1007/978-3-030-14812-6_15⟩
Laurent Bulteau, Danny Hermelin, Dušan Knop, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. Theory of Computing Systems, 2019, 64, pp.17-34
⟨10.1007/s00224-019-09917-z⟩
The Clever Shopper Problem. Theory of Computing Systems, 2019, 64, pp.17-34
⟨10.1007/s00224-019-09917-z⟩
Laurent Bulteau, Konrad K
Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, et al.. Finding a Small Number of Colourful Components. CPM 2019, Jul 2019, Pise, Italy
⟨10.4230/LIPIcs.CPM.2019.20⟩
Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, et al.. Finding a Small Number of Colourful Components. CPM 2019, Jul 2019, Pise, Italy
⟨10.4230/LIPIcs.CPM.2019.20⟩
Laurent Bulteau, Konrad K
Dabrowski, Guillaume Fertin, Matthew Johnson, Daniel Paulusma, et al.. Finding a Small Number of Colourful Components. 2019
⟨10.4230/LIPIcs.CPM.2019.20⟩
Dabrowski, Guillaume Fertin, Matthew Johnson, Daniel Paulusma, et al.. Finding a Small Number of Colourful Components. 2019
⟨10.4230/LIPIcs.CPM.2019.20⟩
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting With Forbidden Intermediates. Discrete Applied Mathematics, 2019, 279, pp.49-68
⟨10.1016/j.dam.2019.10.025⟩
Sorting With Forbidden Intermediates. Discrete Applied Mathematics, 2019, 279, pp.49-68
⟨10.1016/j.dam.2019.10.025⟩
Samuele Giraudo, Stéphane Vialette
Algorithmic and algebraic aspects of unshuffling permutations. Theoretical Computer Science, 2018, 729, pp.20 - 41
⟨10.1016/j.tcs.2018.02.007⟩
Algorithmic and algebraic aspects of unshuffling permutations. Theoretical Computer Science, 2018, 729, pp.20 - 41
⟨10.1016/j.tcs.2018.02.007⟩
Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. The 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia
⟨10.1007/978-3-319-90530-3_6⟩
The Clever Shopper Problem. The 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia
⟨10.1007/978-3-319-90530-3_6⟩
Philippe Gambette, Andreas D.M
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Applied Mathematics, 2018, 246, pp.62-79
⟨10.1016/j.dam.2017.07.015⟩
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Applied Mathematics, 2018, 246, pp.62-79
⟨10.1016/j.dam.2017.07.015⟩
Guillaume Fertin, Irena Rusu, Stéphane Vialette
The S-labeling problem: An algorithmic tour. Discrete Applied Mathematics, 2018, 246, pp.49-61
⟨10.1016/j.dam.2017.07.036⟩
The S-labeling problem: An algorithmic tour. Discrete Applied Mathematics, 2018, 246, pp.49-61
⟨10.1016/j.dam.2017.07.036⟩
Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
Pattern Matching for k-Track Permutations. International Workshop on Combinatorial Algorithms (IWOCA), Jul 2018, Singapore, Singapore. pp.102-114
⟨10.1007/978-3-319-94667-2_9⟩
Pattern Matching for k-Track Permutations. International Workshop on Combinatorial Algorithms (IWOCA), Jul 2018, Singapore, Singapore. pp.102-114
⟨10.1007/978-3-319-94667-2_9⟩
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Permutation Pattern matching in (213, 231)-avoiding permutations. Discrete Mathematics and Theoretical Computer Science, 2017, Vol. 18 no. 2, Permutation Patterns 2015 (2), pp.#14.1-22
⟨10.46298/dmtcs.1329⟩
Permutation Pattern matching in (213, 231)-avoiding permutations. Discrete Mathematics and Theoretical Computer Science, 2017, Vol. 18 no. 2, Permutation Patterns 2015 (2), pp.#14.1-22
⟨10.46298/dmtcs.1329⟩
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Pattern Matching for Separable Permutations. SPIRE 2016, Oct 2016, Beppu, Japan. pp.260-272
⟨10.1007/978-3-319-46049-9_25⟩
Pattern Matching for Separable Permutations. SPIRE 2016, Oct 2016, Beppu, Japan. pp.260-272
⟨10.1007/978-3-319-46049-9_25⟩
Samuele Giraudo, Stéphane Vialette
Unshuffling Permutations. LATIN 2016, Apr 2016, Ensenada, Mexico. pp.509-521
⟨10.1007/978-3-662-49529-2_38⟩
Unshuffling Permutations. LATIN 2016, Apr 2016, Ensenada, Mexico. pp.509-521
⟨10.1007/978-3-662-49529-2_38⟩
Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
Sorting With Forbidden Intermediates. Third International Conference on Algorithms for Computational Biology (AlCoB 2016), María Botón-Fernández; Carlos Martín-Vide; Miguel A. Vega-Rodríguez; Florentina Lilica Voicu, Jun 2016, Trujillo, Spain
⟨10.1016/j.dam.2019.10.025⟩
Sorting With Forbidden Intermediates. Third International Conference on Algorithms for Computational Biology (AlCoB 2016), María Botón-Fernández; Carlos Martín-Vide; Miguel A. Vega-Rodríguez; Florentina Lilica Voicu, Jun 2016, Trujillo, Spain
⟨10.1016/j.dam.2019.10.025⟩
Paul Morel, Ryan Thomas Flynn, Edgar Gelover, Guillaume Blin, Stéphane Vialette, et al.
MSPT: An open-source motion simulator for proton therapy. Biomedical Physics & Engineering Express, 2015, 1 (3), 12 pp
MSPT: An open-source motion simulator for proton therapy. Biomedical Physics & Engineering Express, 2015, 1 (3), 12 pp
Paul Morel, Xiadong Wu, Guillaume Blin, Stéphane Vialette, Ryan Flynn, et al.
Spot Weight Adaptation for Moving Target in Spot Scanning Proton Therapy. Frontiers in Oncology, 2015, 5 (119), pp.1-7
⟨10.3389/fonc.2015.00119⟩
Spot Weight Adaptation for Moving Target in Spot Scanning Proton Therapy. Frontiers in Oncology, 2015, 5 (119), pp.1-7
⟨10.3389/fonc.2015.00119⟩
Guillaume Fertin, Irena Rusu, Stéphane Vialette
Algorithmic aspects of the S-Labeling problem. 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Algorithmic aspects of the S-Labeling problem. 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Philippe Gambette, Andreas D.M
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015, Apr 2015, Varsovie, Poland. pp.96-107
⟨10.1007/978-3-319-16706-0_12⟩
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015, Apr 2015, Varsovie, Poland. pp.96-107
⟨10.1007/978-3-319-16706-0_12⟩
Philippe Gambette, Andreas D.M
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015, Oct 2015, Verona, Italy. pp.197-208
⟨10.1007/978-3-319-29516-9_17⟩
Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015, Oct 2015, Verona, Italy. pp.197-208
⟨10.1007/978-3-319-29516-9_17⟩
Laurent Bulteau, Guillaume Fertin, Stéphane Vialette, Roméo Rizzi
Some algorithmic results for [2]-sumset covers. Information Processing Letters, 2015, 115 (1), pp.1-5
Some algorithmic results for [2]-sumset covers. Information Processing Letters, 2015, 115 (1), pp.1-5
Guillaume Fertin, Irena Rusu, Stéphane Vialette
Obtaining a Triangular Matrix by Independent Row-Column Permutations. 26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France
⟨10.1007/978-3-662-48971-0_15⟩
Obtaining a Triangular Matrix by Independent Row-Column Permutations. 26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France
⟨10.1007/978-3-662-48971-0_15⟩
Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette
Towards unlocking the full potential of Multileaf Collimators. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Towards unlocking the full potential of Multileaf Collimators. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
On the combinatorics of suffix arrays. Information Processing Letters, 2013, 113 (22-24), pp.915-920
⟨10.1016/j.ipl.2013.09.009⟩
On the combinatorics of suffix arrays. Information Processing Letters, 2013, 113 (22-24), pp.915-920
⟨10.1016/j.ipl.2013.09.009⟩
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
Single and multiple consecutive permutation motif search. ISAAC 2013, Dec 2013, Hong-Kong, Hong Kong SAR China. pp.66-77
⟨10.1007/978-3-642-45030-3_7⟩
Single and multiple consecutive permutation motif search. ISAAC 2013, Dec 2013, Hong-Kong, Hong Kong SAR China. pp.66-77
⟨10.1007/978-3-642-45030-3_7⟩
Romeo Rizzi, Stéphane Vialette
On recognizing words that are squares for the shuffle product. The 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.235-245
On recognizing words that are squares for the shuffle product. The 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.235-245
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. International Journal of Foundations of Computer Science, 2013, 24 (1), pp.51-66
⟨10.1142/S0129054113400042⟩
Minimum Mosaic Inference of a Set of Recombinants. International Journal of Foundations of Computer Science, 2013, 24 (1), pp.51-66
⟨10.1142/S0129054113400042⟩
Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, et al.
Flexible RNA design under structure and sequence constraints using formal languages. ACM-BCB - ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics - 2013, Sep 2013, Bethesda, Washigton DC, United States
Flexible RNA design under structure and sequence constraints using formal languages. ACM-BCB - ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics - 2013, Sep 2013, Bethesda, Washigton DC, United States
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Finding Approximate and Constrained Motifs in Graphs. Theoretical Computer Science, 2013, 483 (-), pp.10-21
⟨10.1016/j.tcs.2012.08.023⟩
Finding Approximate and Constrained Motifs in Graphs. Theoretical Computer Science, 2013, 483 (-), pp.10-21
⟨10.1016/j.tcs.2012.08.023⟩
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J
Tejada, Stéphane Vialette. Hardness of longest common subsequence for sequences with bounded run-lengths. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148
⟨10.1007/978-3-642-31265-6_11⟩
Tejada, Stéphane Vialette. Hardness of longest common subsequence for sequences with bounded run-lengths. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148
⟨10.1007/978-3-642-31265-6_11⟩
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, 2012, 51 (3), pp.270-281
⟨10.1007/s00224-012-9388-1⟩
A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, 2012, 51 (3), pp.270-281
⟨10.1007/s00224-012-9388-1⟩
Guillaume Blin, Minghui Jiang, Stéphane Vialette
The longest common subsequence problem with crossing-free arc-annotated sequences. 19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
The longest common subsequence problem with crossing-free arc-annotated sequences. 19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012, Dec 2012, Taipei, Taiwan. pp.465-474
⟨10.1007/978-3-642-35261-4_49⟩
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012, Dec 2012, Taipei, Taiwan. pp.465-474
⟨10.1007/978-3-642-35261-4_49⟩
Guillaume Blin, Maxime Crochemore, Stéphane Vialette
Algorithmic Aspects of Arc-Annotated Sequences. Elloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011
Algorithmic Aspects of Arc-Annotated Sequences. Elloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants. 17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Minimum Mosaic Inference of a Set of Recombinants. 17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Finding Approximate and Constrained Motifs in Graphs. CPM 2011, 2011, Palermo, Italy. pp.388-401
⟨10.1007/978-3-642-21458-5_33⟩
Finding Approximate and Constrained Motifs in Graphs. CPM 2011, 2011, Palermo, Italy. pp.388-401
⟨10.1007/978-3-642-21458-5_33⟩
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, et al.
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. pp.272-286
⟨10.1007/978-3-642-22616-8_22⟩
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. pp.272-286
⟨10.1007/978-3-642-22616-8_22⟩
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384
⟨10.1007/978-3-642-20712-9_29⟩
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384
⟨10.1007/978-3-642-20712-9_29⟩
Michael R
Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences, 2011, 77 (4), pp.799-811
⟨10.1016/j.jcss.2010.07.003⟩
Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences, 2011, 77 (4), pp.799-811
⟨10.1016/j.jcss.2010.07.003⟩
Guillaume Blin, Maxime Crochemore, Sylvie Hamel, Stéphane Vialette
Median of an odd number of permutations. Pure Mathematics and Applications, 2011, 21 (2), pp.161 - 175
Median of an odd number of permutations. Pure Mathematics and Applications, 2011, 21 (2), pp.161 - 175
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Complexity issues in Vertex-Colored Graph Pattern Matching. Journal of Discrete Algorithms, 2011, 9 (1), pp.82-99
⟨10.1016/j.jda.2010.09.002⟩
Complexity issues in Vertex-Colored Graph Pattern Matching. Journal of Discrete Algorithms, 2011, 9 (1), pp.82-99
⟨10.1016/j.jda.2010.09.002⟩
Guillaume Blin, Romeo Rizzi, Stéphane Vialette
A faster algorithm for finding minimum Tucker submatrices. 6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
A faster algorithm for finding minimum Tucker submatrices. 6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Stéphane Vialette
Algorithmic Contributions to Computational Molecular Biology. Data Structures and Algorithms [cs.DS]. Université Paris-Est, 2010
Algorithmic Contributions to Computational Molecular Biology. Data Structures and Algorithms [cs.DS]. Université Paris-Est, 2010
Guillaume Blin, Florian Sikora, Stéphane Vialette
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Finding Common Structured Patterns in Linear Graphs. Theoretical Computer Science, 2010, 411 (26-28), pp.2475-2486
⟨10.1016/j.tcs.2010.02.017⟩
Finding Common Structured Patterns in Linear Graphs. Theoretical Computer Science, 2010, 411 (26-28), pp.2475-2486
⟨10.1016/j.tcs.2010.02.017⟩
Guillaume Blin, Sylvie Hamel, Stéphane Vialette
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions. 4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions. 4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Craig Nelson, Stéphane Vialette (Dir.)
RECOMB - Comparative Genomics Special Issue. Mary Ann Liebert, Inc., pp.1285-1500, 2010
RECOMB - Comparative Genomics Special Issue. Mary Ann Liebert, Inc., pp.1285-1500, 2010
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (4), pp.628-635
Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (4), pp.628-635
Marcin Kubica, Romeo Rizzi, Thomas Waleń, Stéphane Vialette
Approximation of RNA Multiple Structural Alignment. Journal of Discrete Algorithms, 2010, ? (?)
Approximation of RNA Multiple Structural Alignment. Journal of Discrete Algorithms, 2010, ? (?)
Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
Complexity Issues in Color-Preserving Graph Embeddings. Theoretical Computer Science, 2010, 411 (4-5), pp.716-729
⟨10.1016/j.tcs.2009.10.010⟩
Complexity Issues in Color-Preserving Graph Embeddings. Theoretical Computer Science, 2010, 411 (4-5), pp.716-729
⟨10.1016/j.tcs.2009.10.010⟩
Sébastien Angibaud, Guillaume Fertin, Annelyse Thevenin, Stéphane Vialette
Pseudo-Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137
⟨10.1007/978-3-642-04744-2_11⟩
Pseudo-Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137
⟨10.1007/978-3-642-04744-2_11⟩
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, 2009, 7 (1), pp.90-101
Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, 2009, 7 (1), pp.90-101
Danny Hermelin, Mike Fellows, Frances Rosamond, Stéphane Vialette
On the Parameterized Complexity of Multiple-Interval Graph Problems. Theoretical Computer Science, 2009, 410 (1), pp.53-61
On the Parameterized Complexity of Multiple-Interval Graph Problems. Theoretical Computer Science, 2009, 410 (1), pp.53-61
Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. WALCOM 2009, 2009, Kolkata, India. pp.357-368
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. WALCOM 2009, 2009, Kolkata, India. pp.357-368
Guillaume Blin, Maxime Crochemore, Sylvie Hamel, Stéphane Vialette
Finding the median of three permutations under the Kendall-tau distance. 7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Finding the median of three permutations under the Kendall-tau distance. 7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
On the Approximability of Comparing Genomes with Duplicates. Journal of Graph Algorithms and Applications, 2009, 13 (1), pp.19-53
On the Approximability of Comparing Genomes with Duplicates. Journal of Graph Algorithms and Applications, 2009, 13 (1), pp.19-53
Guillaume Fertin, Stéphane Vialette
On the S-labeling Problem. Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
On the S-labeling Problem. Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette
On Finding Small 2-Generating Sets. COCOON 2009, 2009, Niagara Falls, United States. pp.378-387
⟨10.1007/978-3-642-02882-3_38⟩
On Finding Small 2-Generating Sets. COCOON 2009, 2009, Niagara Falls, United States. pp.378-387
⟨10.1007/978-3-642-02882-3_38⟩
Guillaume Blin, Florian Sikora, Stéphane Vialette
Querying Protein-Protein Interaction Networks. 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Querying Protein-Protein Interaction Networks. 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Sylvain Guillemot, Stéphane Vialette
Pattern matching for 321-avoiding permutations. 20th International Symposium on Algorithms and Computation (ISAAC'09), 2009, United States. pp.1064-1073
Pattern matching for 321-avoiding permutations. 20th International Symposium on Algorithms and Computation (ISAAC'09), 2009, United States. pp.1064-1073
Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette
Combinatorics of Genome Rearrangements. MIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Combinatorics of Genome Rearrangements. MIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Maximum Motif Problem in Vertex-Colored Graphs. 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235
⟨10.1007/978-3-642-02441-2_20⟩
Maximum Motif Problem in Vertex-Colored Graphs. 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235
⟨10.1007/978-3-642-02441-2_20⟩
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, 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, 2008, 15 (8), pp.1093-1115
⟨10.1089/cmb.2008.0061⟩
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes. Journal of Computational Biology, 2008, 15 (8), pp.1093-1115
⟨10.1089/cmb.2008.0061⟩
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
The Minimum Substring Cover Problem. Information and Computation, 2008, 206 (11), pp.1303-1312
The Minimum Substring Cover Problem. Information and Computation, 2008, 206 (11), pp.1303-1312
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints. Journal of Discrete Algorithms, 2008, 6 (4), pp.618-626
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints. Journal of Discrete Algorithms, 2008, 6 (4), pp.618-626
Craig Nelson, Stéphane Vialette (Dir.)
Comparative Genomics: International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Springer, 276pp., 2008
Comparative Genomics: International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Springer, 276pp., 2008
Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, 2008, 6 (2), pp.178-191
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, 2008, 6 (2), pp.178-191
Guillaume Blin, Sylvie Hamel, Stéphane Vialette
Comparing RNA structures using a full set of biologically relevant edit operations is intractable. 2008
Comparing RNA structures using a full set of biologically relevant edit operations is intractable. 2008
Maxime Crochemore, Danny Hermelin, Gad Landau, Dror Rawitz, Stéphane Vialette
Approximating the 2-Interval Pattern problem. Theoretical Computer Science, 2008, 395 (2-3), pp.283-297
Approximating the 2-Interval Pattern problem. Theoretical Computer Science, 2008, 395 (2-3), pp.283-297
Stéphane Vialette
Two-Interval Pattern Problems. Kao Ming-Yang. Encyclopedia of Algorithms, Springer-Verlag, pp.985-989, 2008
Two-Interval Pattern Problems. Kao Ming-Yang. Encyclopedia of Algorithms, Springer-Verlag, pp.985-989, 2008
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette
On the Approximability of Comparing Genomes with Duplicates. 2008
On the Approximability of Comparing Genomes with Duplicates. 2008
Philippe Gambette, Stéphane Vialette
On restrictions of balanced 2-interval graphs. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), ?, Jun 2007, Dornburg, Germany. pp.55-65
⟨10.1007/978-3-540-74839-7_6⟩
On restrictions of balanced 2-interval graphs. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), ?, Jun 2007, Dornburg, Germany. pp.55-65
⟨10.1007/978-3-540-74839-7_6⟩
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern between Permutations. Symposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327
Longest Common Separable Pattern between Permutations. Symposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327
Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems. Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems. Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Michael R
Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern between Permutations. Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Longest Common Separable Pattern between Permutations. Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Gaëlle Brevier-Giberti, Roméo Rizzi, Stéphane Vialette
Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007, Aug 2007, Budapest, Hungary. pp.137-148
⟨10.1007/978-3-540-74240-1_13⟩
Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007, Aug 2007, Budapest, Hungary. pp.137-148
⟨10.1007/978-3-540-74240-1_13⟩
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation. 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation. 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Guillaume Blin, Guillaume Fertin, Stéphane Vialette
Extracting Constrained 2-Interval Subsets in 2-Interval Sets. Theoretical Computer Science, 2007, 385 (1-3), pp.241-263
Extracting Constrained 2-Interval Subsets in 2-Interval Sets. Theoretical Computer Science, 2007, 385 (1-3), pp.241-263
Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
Pattern Matching in Protein-Protein Interaction Graphs. Proc. 16th International Symposium on Fundamentals of Computation Theory (FCT), 2007, Budapest, Hungary, Croatia. pp.125-136
Pattern Matching in Protein-Protein Interaction Graphs. Proc. 16th International Symposium on Fundamentals of Computation Theory (FCT), 2007, Budapest, Hungary, Croatia. pp.125-136
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
The Minimum Substring Cover Problem. 5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
The Minimum Substring Cover Problem. 5th Workshop on Approximation and Online Algorithms (WAOA'07), 2007, Eilat, Israel, Iceland. pp.170-183
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
A General Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology, 2007, 14 (4), pp.379-393
⟨10.1089/cmb.2007.A001⟩
A General Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology, 2007, 14 (4), pp.379-393
⟨10.1089/cmb.2007.A001⟩
Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Weak pattern matching in colored graphs: Minimizing the number of connected components. 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Weak pattern matching in colored graphs: Minimizing the number of connected components. 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Rafaella Rizzi, et al.
Exemplar Longest Common Subsequence. ACM Transactions on Computational Logic, 2007, 4 (4), pp.535-543
Exemplar Longest Common Subsequence. ACM Transactions on Computational Logic, 2007, 4 (4), pp.535-543
Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Comparing Genomes with Duplications: a Computational Complexity Point of View. ACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534
⟨10.1109/TCBB.2007.1069⟩
Comparing Genomes with Duplications: a Computational Complexity Point of View. ACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534
⟨10.1109/TCBB.2007.1069⟩
Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Thomas Waleń
Approximation of RNA Multiple Structural Alignment. 17th Symposium on Combinatorial Pattern Matching (CPM'06), 2006, Barcelona, Spain, Spain. pp.211-222
Approximation of RNA Multiple Structural Alignment. 17th Symposium on Combinatorial Pattern Matching (CPM'06), 2006, Barcelona, Spain, Spain. pp.211-222
Gaëlle Lelandais, Pierre Vincens, Anne Badel-Chagnon, Stéphane Vialette, Claude Jacq, et al.
Comparing gene expression networks in multi-dimensional space to extract similarities and differences between organisms. Bioinformatics, 2006, 22 (11), pp.1359-1366
Comparing gene expression networks in multi-dimensional space to extract similarities and differences between organisms. Bioinformatics, 2006, 22 (11), pp.1359-1366
Stéphane Vialette
Packing of (0,1)-matrices. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40 (4), pp.519-536
Packing of (0,1)-matrices. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40 (4), pp.519-536
Paola Bonizzoni, Gianuca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Exemplar Longest Common Subsequences. Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Exemplar Longest Common Subsequences. Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Genomes containing duplicates are hard to compare. Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Genomes containing duplicates are hard to compare. Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
Exemplar Longest Common Subsequence (extended abstract). International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
Exemplar Longest Common Subsequence (extended abstract). International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
G
Lelandais, P. Vincens, A. Badel-Chagnon, Stéphane Vialette, C. Jacq, et al.. Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms.. Bioinformatics, 2006, 22, pp.1359-1366
Lelandais, P. Vincens, A. Badel-Chagnon, Stéphane Vialette, C. Jacq, et al.. Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms.. Bioinformatics, 2006, 22, pp.1359-1366
Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Genomes containing Duplicates are Hard to compare. International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Genomes containing Duplicates are Hard to compare. International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
What Makes the Arc-Preserving Subsequence Problem Hard?. 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
What Makes the Arc-Preserving Subsequence Problem Hard?. 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
Claire Herrbach, Stéphane Vialette
Linear graph non-crossing structural alignment under the RNA stacking-pair scoring scheme. 2nd Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'05), 2005, Lyon, France, France. 10pp
Linear graph non-crossing structural alignment under the RNA stacking-pair scoring scheme. 2nd Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'05), 2005, Lyon, France, France. 10pp
Maxime Crochemore, Danny Hermelin, Gad M
Landau, Stéphane Vialette. Approximating the 2-Interval Pattern Problem. 13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Landau, Stéphane Vialette. Approximating the 2-Interval Pattern Problem. 13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
What makes the Arc-Preserving Subsequence problem hard ?. LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
What makes the Arc-Preserving Subsequence problem hard ?. LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Guillaume Blin, Guillaume Fertin, Stéphane Vialette
New Results for the 2-Interval Pattern Problem. 15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
New Results for the 2-Interval Pattern Problem. 15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
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, 2004, 5, pp.20
⟨10.1186/1471-2105-5-20⟩
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states.. BMC Bioinformatics, 2004, 5, pp.20
⟨10.1186/1471-2105-5-20⟩
Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionar, Dec 2004, Recife,Brazil, Brazil. pp.45-70
Bounded List Injective Homomorphism for Comparative Analysis of Protein-Protein Interaction Graphs. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionar, Dec 2004, Recife,Brazil, Brazil. pp.45-70
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, 2004, 5 (20), 10pp
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. BMC Bioinformatics, 2004, 5 (20), 10pp
Gaëlle Lelandais, Stéphane Le Crom, Frédéric Devaux, Stéphane Vialette, George M
Church, et al.. yMGV: a cross-species expression data mining tool. Nucleic Acids Research, 2004, 32 (1), pp.D323-D325
Church, et al.. yMGV: a cross-species expression data mining tool. Nucleic Acids Research, 2004, 32 (1), pp.D323-D325
Stéphane Vialette
On the computational complexity of 2-interval pattern matching. Theoretical Computer Science, 2004, 312 (2-3), pp.223-249
On the computational complexity of 2-interval pattern matching. Theoretical Computer Science, 2004, 312 (2-3), pp.223-249
Guillaume Blin, Guillaume Fertin, Roméo Rizzi, Stéphane Vialette
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem. 5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem. 5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Julien Sylvestre, Stéphane Vialette, Marisol Corral-Debrinski, Claude Jacq
Long mRNA coding for yeast mitochondrial proteins of prokaryotic origin preferentially localize to the vicinity of mitochondria. Genome Biology, 2003, 4 (7), pp.1-9
Long mRNA coding for yeast mitochondrial proteins of prokaryotic origin preferentially localize to the vicinity of mitochondria. Genome Biology, 2003, 4 (7), pp.1-9
Stéphane Vialette
Pattern Matching over 2-intervals sets. Symposium on Combinatorial Pattern Matching (CPM'02), 2002, Fukuoka, Japan, Japan. pp.53-63
Pattern Matching over 2-intervals sets. Symposium on Combinatorial Pattern Matching (CPM'02), 2002, Fukuoka, Japan, Japan. pp.53-63