![]() | 2009 | |
---|---|---|
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin: Average-Case Analysis of Perfect Sorting by Reversals. CPM 2009: 314-325 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Aïda Ouangraoua, Frédéric Boyer, Andrew McPherson, Eric Tannier, Cedric Chauve: Prediction of Contiguous Regions in the Amniote Ancestral Genome. ISBRA 2009: 173-185 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Nadia El-Mabrouk: New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees. RECOMB 2009: 46-58 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You: Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. RECOMB-CG 2009: 48-58 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin: Average-case analysis of perfect sorting by reversals CoRR abs/0901.2847: (2009) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Aïda Ouangraoua: A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model CoRR abs/0904.1645: (2009) |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Ján Manuch, Murray Patterson: Hardness Results for the Gapped Consecutive-Ones Property CoRR abs/0912.0309: (2009) |
2008 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel: Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations. RECOMB-CG 2008: 1-13 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Sèverine Bérard, Annie Chateau, Cedric Chauve, Christophe Paul, Eric Tannier: Perfect DCJ Rearrangement. RECOMB-CG 2008: 158-169 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Sèverine Bérard, Cedric Chauve, Christophe Paul: A more efficient algorithm for perfect sorting by reversals. Inf. Process. Lett. 106(3): 90-95 (2008) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Jean-Philippe Doyon, Nadia El-Mabrouk: Gene Family Evolution by Duplication, Speciation, and Loss. Journal of Computational Biology 15(8): 1043-1062 (2008) |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discrete Math. 22(3): 1022-1039 (2008) |
2007 | ||
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Mahdi Belcaid, Anne Bergeron, Annie Chateau, Cedric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette: Exploring Genome Rearrangements using Virtual Hybridization. APBC 2007: 205-214 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Jean-Philippe Doyon, Nadia El-Mabrouk: Inferring a Duplication, Speciation and Loss History from a Gene Tree (Extended Abstract). RECOMB-CG 2007: 45-57 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Guylaine Poisson, Cedric Chauve, Xin Chen, Anne Bergeron: FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring. Genomics, Proteomics & Bioinformatics 5(2): 121-130 (2007) |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul: Perfect Sorting by Reversals Is Not Always Difficult. IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 4-16 (2007) |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2006 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras: Inferring Positional Homologs with Common Intervals of Sequences. Comparative Genomics 2006: 24-38 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
2005 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Guillaume Blin, Cedric Chauve, Guillaume Fertin: Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ESA 2005: 779-790 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Valentin Guignon, Cedric Chauve, Sylvie Hamel: An Edit Distance Between RNA Stem-Loops. SPIRE 2005: 335-347 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul: Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238 |
2004 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Sèverine Bérard, Anne Bergeron, Cedric Chauve: Conservation of Combinatorial Structures in Evolution Scenarios. Comparative Genomics 2004: 1-14 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cedric Chauve: Reconstructing Ancestral Gene Orders Using Conserved Intervals. WABI 2004: 14-25 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Guillaume Fertin: On maximal instances for the original syntenic distance. Theor. Comput. Sci. 326(1-3): 29-43 (2004) |
2003 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve: Constellations are Lagrangian objects: a bijective proof. Discrete Mathematics & Theoretical Computer Science 6(1): 13-40 (2003) |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Michel Bousquet, Cedric Chauve, Gilbert Labelle, Pierre Leroux: Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. Theor. Comput. Sci. 307(2): 277-302 (2003) |
2002 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve: Tree Pattern Matching for Linear Static Terms. SPIRE 2002: 160-169 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Serge Dulucq: A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux. Discrete Mathematics 246(1-3): 67-81 (2002) |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve: Tree pattern matching with a more general notion of occurrence of the pattern. Inf. Process. Lett. 82(4): 197-201 (2002) |
2001 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Cedric Chauve, Serge Dulucq, Andrew Rechnitzer: Enumerating Alternating Trees. J. Comb. Theory, Ser. A 94(1): 142-151 (2001) |