Anne Bergeron
Anne Bergeron
Verified email at
Cited by
Cited by
A unifying view of genome rearrangements
A Bergeron, J Mixtacki, J Stoye
Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich …, 2006
FragAnchor: a large-scale predictor of glycosylphosphatidylinositol anchors in eukaryote protein sequences by qualitative scoring
G Poisson, C Chauve, X Chen, A Bergeron
Genomics, proteomics and bioinformatics 5 (2), 121-130, 2007
Advances on sorting by reversals
E Tannier, A Bergeron, MF Sagot
Discrete Applied Mathematics 155 (6-7), 881-888, 2007
A very elementary presentation of the Hannenhalli-Pevzner theory
A Bergeron
Combinatorial Pattern Matching, 106-117, 2001
Wheat EST resources for functional genomics of abiotic stress
M Houde, M Belcaid, F Ouellet, J Danyluk, AF Monroy, A Dryanova, ...
BMC genomics 7, 1-22, 2006
The algorithmic of gene teams
A Bergeron, S Corteel, M Raffinot
Algorithms in Bioinformatics: Second International Workshop, WABI 2002 Rome …, 2002
A very elementary presentation of the Hannenhalli–Pevzner theory
A Bergeron
Discrete Applied Mathematics 146 (2), 134-145, 2005
On sorting by translocations
A Bergeron, J Mixtacki, J Stoye
Research in Computational Molecular Biology: 9th Annual International …, 2005
Reversal distance without hurdles and fortresses
A Bergeron, J Mixtacki, J Stoye
Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul …, 2004
On the similarity of sets of permutations and its applications to genome comparison
A Bergeron, J Stoye
International Computing and Combinatorics Conference, 68-79, 2003
Gene teams: a new formalization of gene clusters for comparative genomics
N Luc, JL Risler, A Bergeron, M Raffinot
Computational biology and chemistry 27 (1), 59-67, 2003
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
A Bergeron, C Chauve, F De Montgolfier, M Raffinot
Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005
Reconstructing ancestral gene orders using conserved intervals
A Bergeron, M Blanchette, A Chateau, C Chauve
Algorithms in Bioinformatics: 4th International Workshop, WABI 2004, Bergen …, 2004
Exact transcriptome reconstruction from short sequence reads
V Lacroix, M Sammeth, R Guigo, A Bergeron
International Workshop on Algorithms in Bioinformatics, 50-63, 2008
Perfect sorting by reversals is not always difficult
S Bérard, A Bergeron, C Chauve, C Paul
IEEE/ACM transactions on computational biology and bioinformatics 4 (1), 4-16, 2007
Identification of genomic features using microsyntenies of domains: domain teams
S Pasek, A Bergeron, JL Risler, A Louis, E Ollivier, M Raffinot
Genome research 15 (6), 867-874, 2005
Common intervals and sorting by reversals: a marriage of necessity
A Bergeron, S Heber, J Stoye
Bioinformatics 18 (Suppl 2), 2002
On the properties of sequences of reversals that sort a signed permutation
A Bergeron, C Chauve, T Hartman, K St-Onge
Proceedings of JOBIM 2, 99-108, 2002
An algorithmic view of gene teams
MP Béal, A Bergeron, S Corteel, M Raffinot
Theoretical Computer Science 320 (2-3), 395-418, 2004
Conservation of combinatorial structures in evolution scenarios
S Bérard, A Bergeron, C Chauve
RECOMB Workshop on Comparative Genomics, 1-14, 2004
The system can't perform the operation now. Try again later.
Articles 1–20