Anne Bergeron

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