Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anne Bergeron
2010 – today
- 2012
[c27]Aïda Ouangraoua, Krister M. Swenson, Anne Bergeron: On the Comparison of Sets of Alternative Transcripts. ISBRA 2012: 201-212- 2011
- [j21]Mahdi Belcaid, Anne Bergeron, Guylaine Poisson: The evolution of the tape measure protein: units, duplications and losses. BMC Bioinformatics 12(S-9): S10 (2011)
- [j20]Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson: Theory and Practice of Ultra-Perfection. Journal of Computational Biology 18(9): 1219-1230 (2011)
- 2010
- [j19]Aïda Ouangraoua, Anne Bergeron: Combinatorial Structure of Genome Rearrangements Scenarios. Journal of Computational Biology 17(9): 1129-1144 (2010)
- [j18]Anne Bergeron, Paul Medvedev, Jens Stoye: Rearrangement Models and Single-Cut Operations. Journal of Computational Biology 17(9): 1213-1225 (2010)
- [j17]Mahdi Belcaid, Anne Bergeron, Guylaine Poisson: Mosaic Graphs and Comparative Genomics in Phage Communities. Journal of Computational Biology 17(9): 1315-1326 (2010)
- [c26]Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson: Ultra-Perfect Sorting Scenarios. RECOMB-CG 2010: 50-61
2000 – 2009
- 2009
- [j16]Anne Bergeron, Julia Mixtacki, Jens Stoye: A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theor. Comput. Sci. 410(51): 5300-5316 (2009)
- [c25]Aïda Ouangraoua, Anne Bergeron: Parking Functions, Labeled Trees and DCJ Sorting Scenarios. RECOMB-CG 2009: 24-35
- [c24]Guylaine Poisson, Mahdi Belcaid, Anne Bergeron: Comparative Genomics and Extensive Recombinations in Phage Communities. RECOMB-CG 2009: 205-216
- [i1]Aïda Ouangraoua, Anne Bergeron: Parking functions, labeled trees and DCJ sorting scenarios. CoRR abs/0903.2499 (2009)
- 2008
- [j15]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)
- [c23]Anne Bergeron, Julia Mixtacki, Jens Stoye: HP Distance Via Double Cut and Join Distance. CPM 2008: 56-68
- [c22]Anne Bergeron, Julia Mixtacki, Jens Stoye: On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. RECOMB-CG 2008: 226-240
- [c21]Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron: Exact Transcriptome Reconstruction from Short Sequence Reads. WABI 2008: 50-63
- 2007
- [j14]Eric Tannier, Anne Bergeron, Marie-France Sagot: Advances on sorting by reversals. Discrete Applied Mathematics 155(6-7): 881-888 (2007)
- [j13]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)
- [j12]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)
- [c20]Mahdi Belcaid, Anne Bergeron, Annie Chateau, Cedric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette: Exploring Genome Rearrangements using Virtual Hybridization. APBC 2007: 205-214
- 2006
- [j11]Anne Bergeron, Julia Mixtacki, Jens Stoye: On Sorting by Translocations. Journal of Computational Biology 13(2): 567-578 (2006)
- [j10]Anne Bergeron, Jens Stoye: On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. Journal of Computational Biology 13(7): 1340-1354 (2006)
- [c19]Anne Bergeron, Julia Mixtacki, Jens Stoye: A Unifying View of Genome Rearrangements. WABI 2006: 163-173
- 2005
- [j9]Anne Bergeron: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics 146(2): 134-145 (2005)
- [c18]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
- [c17]
- [c16]Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul: Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238
- 2004
- [j8]Anne Bergeron, Sylvie Hamel: From cascade decompositions to bit-vector algorithms. Theor. Comput. Sci. 313(1): 3-16 (2004)
- [j7]Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot: An algorithmic view of gene teams. Theor. Comput. Sci. 320(2-3): 395-418 (2004)
- [c15]Anne Bergeron, Julia Mixtacki, Jens Stoye: Reversal Distance without Hurdles and Fortresses. CPM 2004: 388-399
- [c14]Sèverine Bérard, Anne Bergeron, Cedric Chauve: Conservation of Combinatorial Structures in Evolution Scenarios. Comparative Genomics 2004: 1-14
- [c13]Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cedric Chauve: Reconstructing Ancestral Gene Orders Using Conserved Intervals. WABI 2004: 14-25
- 2003
- [j6]Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot: Gene teams: a new formalization of gene clusters for comparative genomics. Computational Biology and Chemistry 27(1): 59-67 (2003)
- [c12]Anne Bergeron, Jens Stoye: On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. COCOON 2003: 68-79
- 2002
- [j5]Anne Bergeron, Sylvie Hamel: Vector Algorithms for Approximate String Matching. Int. J. Found. Comput. Sci. 13(1): 53-66 (2002)
- [c11]Anne Bergeron, Steffen Heber, Jens Stoye: Common intervals and sorting by reversals: a marriage of necessity. ECCB 2002: 54-63
- [c10]
- 2001
- [c9]
- [c8]Anne Bergeron, François Strasbourg: Experiments in Computing Sequences of Reversals. WABI 2001: 164-174
- [c7]
- 2000
- [c6]
1990 – 1999
- 1999
- [c5]Anne Bergeron, Jean-Christophe Manzoni: An Automated Analysis of Ping-Pong Interactions in E-mail Services. TACAS 1999: 134-147
- [c4]
- 1998
- [j4]Anne Bergeron, Paul Geanta, Dominique Bergeron: The Death factors: a combinatorial analysis. In Silico Biology 1: 13 (1998)
- [c3]Marie-Chantal Beaulieu, Anne Bergeron: Automata and Computational Probabilities. Workshop on Implementing Automata 1998: 164-177
- 1997
- [j3]Anne Bergeron: On the Rational Behaviors of Concurrent Timers. Theor. Comput. Sci. 189(1-2): 229-237 (1997)
- 1995
- [j2]Anne Bergeron: Sharing Out Control in Distributed Processes. Theor. Comput. Sci. 139(1&2): 163-186 (1995)
- [c2]
- 1993
- [j1]Anne Bergeron: A Unified Approach to Control Problems in Discrete Event Processes. ITA 27(6): 555-573 (1993)
- 1992
- [c1]Anne Bergeron: Assisted Mathematics: The Case of Discrete Probabilities. Intelligent Tutoring Systems 1992: 40-49
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-05 19:34 CET by the dblp team