Anne Bergeron

Orcid: 0000-0003-2156-254X

According to our database1, Anne Bergeron authored at least 51 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Two Strikes Against the Phage Recombination Problem.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

2022
On the Comparison of Bacteriophage Populations.
Proceedings of the Comparative Genomics - 19th International Conference, 2022

2016
Aligning the unalignable: bacteriophage whole genome alignments.
BMC Bioinform., 2016

2015
Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm.
PeerJ Comput. Sci., 2015

2013
Reconstructing the modular recombination history of Staphylococcus aureus phages.
BMC Bioinform., 2013

The Genesis of the DCJ Formula.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
On the Comparison of Sets of Alternative Transcripts.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
Theory and Practice of Ultra-Perfection.
J. Comput. Biol., 2011

The evolution of the tape measure protein: units, duplications and losses.
BMC Bioinform., 2011

2010
Combinatorial Structure of Genome Rearrangements Scenarios.
J. Comput. Biol., 2010

Rearrangement Models and Single-Cut Operations.
J. Comput. Biol., 2010

Mosaic Graphs and Comparative Genomics in Phage Communities.
J. Comput. Biol., 2010

Ultra-Perfect Sorting Scenarios.
Proceedings of the Comparative Genomics - International Workshop, 2010

2009
A new linear time algorithm to compute the genomic distance via the double cut and join distance.
Theor. Comput. Sci., 2009

Comparative Genomics and Extensive Recombinations in Phage Communities.
Proceedings of the Comparative Genomics, International Workshop, 2009

Parking Functions, Labeled Trees and DCJ Sorting Scenarios.
Proceedings of the Comparative Genomics, International Workshop, 2009

2008
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.
SIAM J. Discret. Math., 2008

Exact Transcriptome Reconstruction from Short Sequence Reads.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios.
Proceedings of the Comparative Genomics, International Workshop, 2008

HP Distance Via Double Cut and Join Distance.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Perfect Sorting by Reversals Is Not Always Difficult.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring.
Genom. Proteom. Bioinform., 2007

Advances on sorting by reversals.
Discret. Appl. Math., 2007

Exploring Genome Rearrangements using Virtual Hybridization.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

The inversion distance problem.
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison.
J. Comput. Biol., 2006

On Sorting by Translocations.
J. Comput. Biol., 2006

A Unifying View of Genome Rearrangements.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

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

Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs.
Proceedings of the Algorithms, 2005

2004
From cascade decompositions to bit-vector algorithms.
Theor. Comput. Sci., 2004

An algorithmic view of gene teams.
Theor. Comput. Sci., 2004

Reconstructing Ancestral Gene Orders Using Conserved Intervals.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Conservation of Combinatorial Structures in Evolution Scenarios.
Proceedings of the Comparative Genomics, 2004

Reversal Distance without Hurdles and Fortresses.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Gene teams: a new formalization of gene clusters for comparative genomics.
Comput. Biol. Chem., 2003

2002
Vector Algorithms for Approximate String Matching.
Int. J. Found. Comput. Sci., 2002

The Algorithmic of Gene Teams.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Common intervals and sorting by reversals: a marriage of necessity.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001
Cascade Decompositions are Bit-Vector Algorithms.
Proceedings of the Implementation and Application of Automata, 2001

Experiments in Computing Sequences of Reversals.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

2000
Fast Implementations of Automata Computations.
Proceedings of the Implementation and Application of Automata, 2000

1999
Analysis of Reactive Systems with n Timers.
Proceedings of the Automata Implementation, 1999

An Automated Analysis of Ping-Pong Interactions in E-mail Services.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

1998
The Death factors: a combinatorial analysis.
Silico Biol., 1998

Automata and Computational Probabilities.
Proceedings of the Automata Implementation, 1998

1997
On the Rational Behaviors of Concurrent Timers.
Theor. Comput. Sci., 1997

1995
Sharing Out Control in Distributed Processes.
Theor. Comput. Sci., 1995

Symbolic Timing Devices.
Proceedings of the Algebraic Methodology and Software Technology, 1995

1993
A Unified Approach to Control Problems in Discrete Event Processes.
RAIRO Theor. Informatics Appl., 1993

1992
Assisted Mathematics: The Case of Discrete Probabilities.
Proceedings of the Intelligent Tutoring Systems, Second International Conference, 1992


  Loading...