Assisted Mathematics: The Case of Discrete Probabilities. - Anne Bergeron (Intelligent Tutoring Systems, 1992)

A Unified Approach to Control Problems in Discrete Event Processes. - Anne Bergeron (RAIRO Theor. Informatics Appl., 1993)

Symbolic Timing Devices. - Anne Bergeron (AMAST, 1995)

Sharing Out Control in Distributed Processes. - Anne Bergeron (Theor. Comput. Sci., 1995)

On the Rational Behaviors of Concurrent Timers. - Anne Bergeron (Theor. Comput. Sci., 1997)

Automata and Computational Probabilities. - Marie-Chantal Beaulieu; Anne Bergeron (Workshop on Implementing Automata, 1998)

The Death factors: a combinatorial analysis. - Anne Bergeron; Paul Geanta; Dominique Bergeron (Silico Biol., 1998)

An Automated Analysis of Ping-Pong Interactions in E-mail Services. - Anne Bergeron; Jean-Christophe Manzoni (TACAS, 1999)

Analysis of Reactive Systems with n Timers. - Anne Bergeron; Riccardo Catalano (WIA, 1999)

Fast Implementations of Automata Computations. - Anne Bergeron; Sylvie Hamel (CIAA, 2000)

Experiments in Computing Sequences of Reversals. - Anne Bergeron; François Strasbourg (WABI, 2001)

Cascade Decompositions are Bit-Vector Algorithms. - Anne Bergeron; Sylvie Hamel (CIAA, 2001)

Common intervals and sorting by reversals: a marriage of necessity. - Anne Bergeron; Steffen Heber; Jens Stoye (ECCB, 2002)

The Algorithmic of Gene Teams. - Anne Bergeron; Sylvie Corteel; Mathieu Raffinot (WABI, 2002)

Vector Algorithms for Approximate String Matching. - Anne Bergeron; Sylvie Hamel (Int. J. Found. Comput. Sci., 2002)

Gene teams: a new formalization of gene clusters for comparative genomics. - Nicolas Luc; Jean-Loup Risler; Anne Bergeron; Mathieu Raffinot (Comput. Biol. Chem., 2003)

Reversal Distance without Hurdles and Fortresses. - Anne Bergeron; Julia Mixtacki; Jens Stoye (CPM, 2004)

Conservation of Combinatorial Structures in Evolution Scenarios. - Sèverine Bérard; Anne Bergeron; Cédric Chauve (Comparative Genomics, 2004)

Reconstructing Ancestral Gene Orders Using Conserved Intervals. - Anne Bergeron; Mathieu Blanchette; Annie Chateau; Cédric Chauve (WABI, 2004)

An algorithmic view of gene teams. - Marie-Pierre Béal; Anne Bergeron; Sylvie Corteel; Mathieu Raffinot (Theor. Comput. Sci., 2004)

From cascade decompositions to bit-vector algorithms. - Anne Bergeron; Sylvie Hamel (Theor. Comput. Sci., 2004)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (ESA, 2005)

A very elementary presentation of the Hannenhalli-Pevzner theory. - Anne Bergeron (Discret. Appl. Math., 2005)

A Unifying View of Genome Rearrangements. - Anne Bergeron; Julia Mixtacki; Jens Stoye (WABI, 2006)

On Sorting by Translocations. - Anne Bergeron; Julia Mixtacki; Jens Stoye (J. Comput. Biol., 2006)

On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. - Anne Bergeron; Jens Stoye (J. Comput. Biol., 2006)

The inversion distance problem. - Anne Bergeron; Julia Mixtacki; Jens Stoye (Mathematics of Evolution and Phylogeny, 2007)

Exploring Genome Rearrangements using Virtual Hybridization. - Mahdi Belcaid; Anne Bergeron; Annie Chateau; Cédric Chauve; Yannick Gingras; Guylaine Poisson; M. Vendette (APBC, 2007)

Advances on sorting by reversals. - Eric Tannier; Anne Bergeron; Marie-France Sagot (Discret. Appl. Math., 2007)

FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring. - Guylaine Poisson; Cédric Chauve; Xin Chen; Anne Bergeron (Genom. Proteom. Bioinform., 2007)

Perfect Sorting by Reversals Is Not Always Difficult. - Sèverine Bérard; Anne Bergeron; Cédric Chauve; Christophe Paul (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

HP Distance Via Double Cut and Join Distance. - Anne Bergeron; Julia Mixtacki; Jens Stoye (CPM, 2008)

On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. - Anne Bergeron; Julia Mixtacki; Jens Stoye (RECOMB-CG, 2008)

Exact Transcriptome Reconstruction from Short Sequence Reads. - Vincent Lacroix; Michael Sammeth; Roderic Guigó; Anne Bergeron (WABI, 2008)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2008)

Parking Functions, Labeled Trees and DCJ Sorting Scenarios. - Aïda Ouangraoua; Anne Bergeron (RECOMB-CG, 2009)

Comparative Genomics and Extensive Recombinations in Phage Communities. - Guylaine Poisson; Mahdi Belcaid; Anne Bergeron (RECOMB-CG, 2009)

A new linear time algorithm to compute the genomic distance via the double cut and join distance. - Anne Bergeron; Julia Mixtacki; Jens Stoye (Theor. Comput. Sci., 2009)

Ultra-Perfect Sorting Scenarios. - Aïda Ouangraoua; Anne Bergeron; Krister M. Swenson (RECOMB-CG, 2010)

Mosaic Graphs and Comparative Genomics in Phage Communities. - Mahdi Belcaid; Anne Bergeron; Guylaine Poisson (J. Comput. Biol., 2010)

Rearrangement Models and Single-Cut Operations. - Anne Bergeron; Paul Medvedev; Jens Stoye (J. Comput. Biol., 2010)

Combinatorial Structure of Genome Rearrangements Scenarios. - Aïda Ouangraoua; Anne Bergeron (J. Comput. Biol., 2010)

The evolution of the tape measure protein: units, duplications and losses. - Mahdi Belcaid; Anne Bergeron; Guylaine Poisson (BMC Bioinform., 2011)

Theory and Practice of Ultra-Perfection. - Aïda Ouangraoua; Anne Bergeron; Krister M. Swenson (J. Comput. Biol., 2011)

On the Comparison of Sets of Alternative Transcripts. - Aïda Ouangraoua; Krister M. Swenson; Anne Bergeron (ISBRA, 2012)

The Genesis of the DCJ Formula. - Anne Bergeron; Jens Stoye (Models and Algorithms for Genome Evolution, 2013)

Reconstructing the modular recombination history of Staphylococcus aureus phages. - Krister M. Swenson; Paul Guertin; Hugo Deschênes; Anne Bergeron (BMC Bioinform., 2013)

Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm. - Philippe Lavoie-Mongrain; Mahdi Belcaid; Aïda Ouangraoua; Anne Bergeron; Guylaine Poisson (PeerJ Comput. Sci., 2015)

Aligning the unalignable: bacteriophage whole genome alignments. - Sèverine Bérard; Annie Chateau; Nicolas Pompidor; Paul Guertin; Anne Bergeron; Krister M. Swenson (BMC Bioinform., 2016)

On the Comparison of Bacteriophage Populations. - Anne Bergeron; Marie-Jean Meurs; Romy Valiquette-Labonté; Krister M. Swenson (RECOMB-CG, 2022)

Two Strikes Against the Phage Recombination Problem. - Manuel Lafond; Anne Bergeron; Krister M. Swenson (RECOMB-CG, 2023)