Anne Bergeron

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 3

Top Topics

Quantitative Evaluation

Sequence Alignment

Computer Vision

Top Venues

PeerJ Comput. Sci.

Publications

Manuel Lafond, Anne Bergeron, Krister M. Swenson
Two Strikes Against the Phage Recombination Problem. RECOMB-CG (2023)
Anne Bergeron, Marie-Jean Meurs, Romy Valiquette-Labonté, Krister M. Swenson
On the Comparison of Bacteriophage Populations. RECOMB-CG (2022)
Sèverine Bérard, Annie Chateau, Nicolas Pompidor, Paul Guertin, Anne Bergeron, Krister M. Swenson
Aligning the unalignable: bacteriophage whole genome alignments. BMC Bioinform. 17 (2016)
Philippe Lavoie-Mongrain, Mahdi Belcaid, Aïda Ouangraoua, Anne Bergeron, Guylaine Poisson
Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm. PeerJ Comput. Sci. 1 (2015)
Krister M. Swenson, Paul Guertin, Hugo Deschênes, Anne Bergeron
Reconstructing the modular recombination history of Staphylococcus aureus phages. BMC Bioinform. 14 (S-15) (2013)
Aïda Ouangraoua, Krister M. Swenson, Anne Bergeron
On the Comparison of Sets of Alternative Transcripts. ISBRA (2012)
Mahdi Belcaid, Anne Bergeron, Guylaine Poisson
The evolution of the tape measure protein: units, duplications and losses. BMC Bioinform. 12 (S-9) (2011)
Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson
Theory and Practice of Ultra-Perfection. J. Comput. Biol. 18 (9) (2011)
Mahdi Belcaid, Anne Bergeron, Guylaine Poisson
Mosaic Graphs and Comparative Genomics in Phage Communities. J. Comput. Biol. 17 (9) (2010)
Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson
Ultra-Perfect Sorting Scenarios. RECOMB-CG (2010)
Anne Bergeron, Paul Medvedev, Jens Stoye
Rearrangement Models and Single-Cut Operations. J. Comput. Biol. 17 (9) (2010)
Aïda Ouangraoua, Anne Bergeron
Combinatorial Structure of Genome Rearrangements Scenarios. J. Comput. Biol. 17 (9) (2010)
Anne Bergeron, Julia Mixtacki, Jens Stoye
A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. Structure Discovery in Biology: Motifs, Networks & Phylogenies (2010)
Aïda Ouangraoua, Anne Bergeron
Parking Functions, Labeled Trees and DCJ Sorting Scenarios. RECOMB-CG (2009)
Aïda Ouangraoua, Anne Bergeron
Parking functions, labeled trees and DCJ sorting scenarios CoRR (2009)
Guylaine Poisson, Mahdi Belcaid, Anne Bergeron
Comparative Genomics and Extensive Recombinations in Phage Communities. RECOMB-CG (2009)
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) (2009)
Anne Bergeron, Julia Mixtacki, Jens Stoye
HP Distance Via Double Cut and Join Distance. CPM (2008)
Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discret. Math. 22 (3) (2008)
Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron
Exact Transcriptome Reconstruction from Short Sequence Reads. WABI (2008)
Anne Bergeron, Julia Mixtacki, Jens Stoye
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. RECOMB-CG (2008)
Eric Tannier, Anne Bergeron, Marie-France Sagot
Advances on sorting by reversals. Discret. Appl. Math. 155 (6-7) (2007)
Guylaine Poisson, Cédric Chauve, Xin Chen, Anne Bergeron
FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring. Genom. Proteom. Bioinform. 5 (2) (2007)
Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
Perfect Sorting by Reversals Is Not Always Difficult. IEEE ACM Trans. Comput. Biol. Bioinform. 4 (1) (2007)
Mahdi Belcaid, Anne Bergeron, Annie Chateau, Cédric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette
Exploring Genome Rearrangements using Virtual Hybridization. APBC (2007)
Anne Bergeron, Julia Mixtacki, Jens Stoye
A Unifying View of Genome Rearrangements. WABI (2006)
Anne Bergeron, Jens Stoye
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. J. Comput. Biol. 13 (7) (2006)
Anne Bergeron, Julia Mixtacki, Jens Stoye
On Sorting by Translocations. J. Comput. Biol. 13 (2) (2006)
Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
Perfect Sorting by Reversals Is Not Always Difficult. WABI (2005)
Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
Permutations, with Applications to Modular Decomposition of Graphs. ESA (2005)
Anne Bergeron
A very elementary presentation of the Hannenhalli-Pevzner theory. Discret. Appl. Math. 146 (2) (2005)
Anne Bergeron, Julia Mixtacki, Jens Stoye
On Sorting by Translocations. RECOMB (2005)
Sèverine Bérard, Anne Bergeron, Cédric Chauve
Conservation of Combinatorial Structures in Evolution Scenarios. Comparative Genomics (2004)
Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
An algorithmic view of gene teams. Theor. Comput. Sci. 320 (2-3) (2004)
Anne Bergeron, Sylvie Hamel
From cascade decompositions to bit-vector algorithms. Theor. Comput. Sci. 313 (1) (2004)
Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cédric Chauve
Reconstructing Ancestral Gene Orders Using Conserved Intervals. WABI (2004)
Anne Bergeron, Julia Mixtacki, Jens Stoye
Reversal Distance without Hurdles and Fortresses. CPM (2004)
Anne Bergeron, Jens Stoye
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. COCOON (2003)
Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot
Gene teams: a new formalization of gene clusters for comparative genomics. Comput. Biol. Chem. 27 (1) (2003)
Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
The Algorithmic of Gene Teams. WABI (2002)
Anne Bergeron, Sylvie Hamel
Vector Algorithms for Approximate String Matching. Int. J. Found. Comput. Sci. 13 (1) (2002)
Anne Bergeron, Steffen Heber, Jens Stoye
Common intervals and sorting by reversals: a marriage of necessity. ECCB (2002)
Anne Bergeron
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. CPM (2001)
Anne Bergeron, Sylvie Hamel
Cascade Decompositions are Bit-Vector Algorithms. CIAA (2001)
Anne Bergeron, François Strasbourg
Experiments in Computing Sequences of Reversals. WABI (2001)
Anne Bergeron, Sylvie Hamel
Fast Implementations of Automata Computations. CIAA (2000)
Anne Bergeron, Riccardo Catalano
Analysis of Reactive Systems with n Timers. WIA (1999)
Anne Bergeron, Jean-Christophe Manzoni
An Automated Analysis of Ping-Pong Interactions in E-mail Services. TACAS (1999)
Anne Bergeron, Paul Geanta, Dominique Bergeron
The Death factors: a combinatorial analysis. Silico Biol. 1 (3) (1998)
Marie-Chantal Beaulieu, Anne Bergeron
Automata and Computational Probabilities. Workshop on Implementing Automata (1998)
Anne Bergeron
On the Rational Behaviors of Concurrent Timers. Theor. Comput. Sci. 189 (1-2) (1997)
Anne Bergeron
Sharing Out Control in Distributed Processes. Theor. Comput. Sci. 139 (1&2) (1995)
Anne Bergeron
Symbolic Timing Devices. AMAST (1995)
Anne Bergeron
A Unified Approach to Control Problems in Discrete Event Processes. RAIRO Theor. Informatics Appl. 27 (6) (1993)
Anne Bergeron
Assisted Mathematics: The Case of Discrete Probabilities. Intelligent Tutoring Systems (1992)