- 22
- 12
- 10
- 2
- 1
Stéphane Vialette
Publications de Stéphane Vialette
47
Documents
Publications
- 5
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 47
- 12
- 11
- 9
- 8
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 1
- 3
- 1
- 4
- 1
- 8
- 3
- 10
- 5
- 4
- 2
|
|
Permutation Pattern Matching for Doubly Partially Ordered Patterns33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic
Communication dans un congrès
hal-03624311v1
|
|
|
The Maximum Zero-Sum Partition Problem25th International Computer Symposium, ICS 2022, Dec 2022, Taoyuan, Taiwan. pp.73-85, ⟨10.1007/978-981-19-9582-8_7⟩
Communication dans un congrès
hal-04293802v1
|
|
|
Unshuffling PermutationsTAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩
Communication dans un congrès
hal-02304028v1
|
|
|
Finding a Small Number of Colourful ComponentsCPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩
Communication dans un congrès
hal-02304030v1
|
Algorithmic aspects of the S-Labeling problem26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Communication dans un congrès
hal-01311584v1
|
|
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. ⟨10.1007/978-3-662-48971-0_15⟩
Communication dans un congrès
hal-01189621v1
|
|
|
Finding Approximate and Constrained Motifs in GraphsCPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩
Communication dans un congrès
hal-00606173v1
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Communication dans un congrès
hal-00606375v1
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491v1
|
|
|
Pseudo-Boolean Programming for Partially Ordered GenomesRECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137, ⟨10.1007/978-3-642-04744-2_11⟩
Communication dans un congrès
hal-00416458v1
|
|
|
Maximum Motif Problem in Vertex-Colored Graphs20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235, ⟨10.1007/978-3-642-02441-2_20⟩
Communication dans un congrès
hal-00416463v1
|
|
|
On the S-labeling ProblemProc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
Communication dans un congrès
hal-00416570v1
|
|
|
On Finding Small 2-Generating SetsCOCOON 2009, 2009, Niagara Falls, United States. pp.378-387, ⟨10.1007/978-3-642-02882-3_38⟩
Communication dans un congrès
hal-00416577v1
|
|
|
Weak pattern matching in colored graphs: Minimizing the number of connected components10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Communication dans un congrès
hal-00417910v1
|
|
|
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Communication dans un congrès
hal-00417902v1
|
|
|
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Communication dans un congrès
hal-00418258v1
|
|
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Communication dans un congrès
hal-00417928v1
|
|
|
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS ProblemsBrazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Communication dans un congrès
hal-00417918v1
|
|
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Communication dans un congrès
hal-00418241v1
|
|
|
Exemplar Longest Common Subsequence (extended abstract)International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
Communication dans un congrès
hal-00461780v1
|
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Communication dans un congrès
hal-00619848v1
|
|
Genomes containing duplicates are hard to compareProc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Communication dans un congrès
hal-00620297v1
|
|
Exemplar Longest Common SubsequencesInt. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Communication dans un congrès
hal-00620296v1
|
|
|
|
Genomes containing Duplicates are Hard to compareInternational Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Communication dans un congrès
hal-00418260v1
|
|
|
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
Communication dans un congrès
hal-00620359v1
|
|
|
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Communication dans un congrès
hal-00620363v1
|
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Communication dans un congrès
hal-00620292v1
|
|
|
|
New Results for the 2-Interval Pattern Problem15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
Communication dans un congrès
hal-00620366v1
|
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Communication dans un congrès
hal-00620330v1
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Ouvrages
hal-00416453v1
|
Finding a Small Number of Colourful Components2019
Pré-publication, Document de travail
hal-01986725v1
|
|
|
|
On the Approximability of Comparing Genomes with Duplicates2008
Pré-publication, Document de travail
hal-00285511v1
|