default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Bergeron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c29]Manuel Lafond, Anne Bergeron, Krister M. Swenson:
Two Strikes Against the Phage Recombination Problem. RECOMB-CG 2023: 68-83- 2022
- [c28]Anne Bergeron, Marie-Jean Meurs, Romy Valiquette-Labonté, Krister M. Swenson:
On the Comparison of Bacteriophage Populations. RECOMB-CG 2022: 3-20
2010 – 2019
- 2016
- [j24]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: 30 (2016) - 2015
- [j23]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: e6 (2015) - 2013
- [j22]Krister M. Swenson, Paul Guertin, Hugo Deschênes, Anne Bergeron:
Reconstructing the modular recombination history of Staphylococcus aureus phages. BMC Bioinform. 14(S-15): S17 (2013) - [p2]Anne Bergeron, Jens Stoye:
The Genesis of the DCJ Formula. Models and Algorithms for Genome Evolution 2013: 63-81 - 2012
- [c27]Aïda Ouangraoua, Krister M. Swenson, Anne Bergeron:
On the Comparison of Sets of Alternative Transcripts. ISBRA 2012: 201-212 - 2011
- [j21]Mahdi Belcaid, Anne Bergeron, Guylaine Poisson:
The evolution of the tape measure protein: units, duplications and losses. BMC Bioinform. 12(S-9): S10 (2011) - [j20]Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson:
Theory and Practice of Ultra-Perfection. J. Comput. Biol. 18(9): 1219-1230 (2011) - 2010
- [j19]Aïda Ouangraoua, Anne Bergeron:
Combinatorial Structure of Genome Rearrangements Scenarios. J. Comput. Biol. 17(9): 1129-1144 (2010) - [j18]Anne Bergeron, Paul Medvedev, Jens Stoye:
Rearrangement Models and Single-Cut Operations. J. Comput. Biol. 17(9): 1213-1225 (2010) - [j17]Mahdi Belcaid, Anne Bergeron, Guylaine Poisson:
Mosaic Graphs and Comparative Genomics in Phage Communities. J. Comput. Biol. 17(9): 1315-1326 (2010) - [c26]Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson:
Ultra-Perfect Sorting Scenarios. RECOMB-CG 2010: 50-61 - [i2]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
2000 – 2009
- 2009
- [j16]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): 5300-5316 (2009) - [c25]Aïda Ouangraoua, Anne Bergeron:
Parking Functions, Labeled Trees and DCJ Sorting Scenarios. RECOMB-CG 2009: 24-35 - [c24]Guylaine Poisson, Mahdi Belcaid, Anne Bergeron:
Comparative Genomics and Extensive Recombinations in Phage Communities. RECOMB-CG 2009: 205-216 - [i1]Aïda Ouangraoua, Anne Bergeron:
Parking functions, labeled trees and DCJ sorting scenarios. CoRR abs/0903.2499 (2009) - 2008
- [j15]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): 1022-1039 (2008) - [c23]Anne Bergeron, Julia Mixtacki, Jens Stoye:
HP Distance Via Double Cut and Join Distance. CPM 2008: 56-68 - [c22]Anne Bergeron, Julia Mixtacki, Jens Stoye:
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. RECOMB-CG 2008: 226-240 - [c21]Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron:
Exact Transcriptome Reconstruction from Short Sequence Reads. WABI 2008: 50-63 - 2007
- [j14]Eric Tannier, Anne Bergeron, Marie-France Sagot:
Advances on sorting by reversals. Discret. Appl. Math. 155(6-7): 881-888 (2007) - [j13]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): 121-130 (2007) - [j12]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): 4-16 (2007) - [c20]Mahdi Belcaid, Anne Bergeron, Annie Chateau, Cédric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette:
Exploring Genome Rearrangements using Virtual Hybridization. APBC 2007: 205-214 - [p1]Anne Bergeron, Julia Mixtacki, Jens Stoye:
The inversion distance problem. Mathematics of Evolution and Phylogeny 2007 - 2006
- [j11]Anne Bergeron, Julia Mixtacki, Jens Stoye:
On Sorting by Translocations. J. Comput. Biol. 13(2): 567-578 (2006) - [j10]Anne Bergeron, Jens Stoye:
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. J. Comput. Biol. 13(7): 1340-1354 (2006) - [c19]Anne Bergeron, Julia Mixtacki, Jens Stoye:
A Unifying View of Genome Rearrangements. WABI 2006: 163-173 - 2005
- [j9]Anne Bergeron:
A very elementary presentation of the Hannenhalli-Pevzner theory. Discret. Appl. Math. 146(2): 134-145 (2005) - [c18]Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ESA 2005: 779-790 - [c17]Anne Bergeron, Julia Mixtacki, Jens Stoye:
On Sorting by Translocations. RECOMB 2005: 615-629 - [c16]Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238 - 2004
- [j8]Anne Bergeron, Sylvie Hamel:
From cascade decompositions to bit-vector algorithms. Theor. Comput. Sci. 313(1): 3-16 (2004) - [j7]Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
An algorithmic view of gene teams. Theor. Comput. Sci. 320(2-3): 395-418 (2004) - [c15]Anne Bergeron, Julia Mixtacki, Jens Stoye:
Reversal Distance without Hurdles and Fortresses. CPM 2004: 388-399 - [c14]Sèverine Bérard, Anne Bergeron, Cédric Chauve:
Conservation of Combinatorial Structures in Evolution Scenarios. Comparative Genomics 2004: 1-14 - [c13]Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cédric Chauve:
Reconstructing Ancestral Gene Orders Using Conserved Intervals. WABI 2004: 14-25 - 2003
- [j6]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): 59-67 (2003) - [c12]Anne Bergeron, Jens Stoye:
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. COCOON 2003: 68-79 - 2002
- [j5]Anne Bergeron, Sylvie Hamel:
Vector Algorithms for Approximate String Matching. Int. J. Found. Comput. Sci. 13(1): 53-66 (2002) - [c11]Anne Bergeron, Steffen Heber, Jens Stoye:
Common intervals and sorting by reversals: a marriage of necessity. ECCB 2002: 54-63 - [c10]Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
The Algorithmic of Gene Teams. WABI 2002: 464-476 - 2001
- [c9]Anne Bergeron:
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. CPM 2001: 106-117 - [c8]Anne Bergeron, François Strasbourg:
Experiments in Computing Sequences of Reversals. WABI 2001: 164-174 - [c7]Anne Bergeron, Sylvie Hamel:
Cascade Decompositions are Bit-Vector Algorithms. CIAA 2001: 13-26 - 2000
- [c6]Anne Bergeron, Sylvie Hamel:
Fast Implementations of Automata Computations. CIAA 2000: 47-56
1990 – 1999
- 1999
- [c5]Anne Bergeron, Jean-Christophe Manzoni:
An Automated Analysis of Ping-Pong Interactions in E-mail Services. TACAS 1999: 134-147 - [c4]Anne Bergeron, Riccardo Catalano:
Analysis of Reactive Systems with n Timers. WIA 1999: 27-38 - 1998
- [j4]Anne Bergeron, Paul Geanta, Dominique Bergeron:
The Death factors: a combinatorial analysis. Silico Biol. 1(3): 147-158 (1998) - [c3]Marie-Chantal Beaulieu, Anne Bergeron:
Automata and Computational Probabilities. Workshop on Implementing Automata 1998: 164-177 - 1997
- [j3]Anne Bergeron:
On the Rational Behaviors of Concurrent Timers. Theor. Comput. Sci. 189(1-2): 229-237 (1997) - 1995
- [j2]Anne Bergeron:
Sharing Out Control in Distributed Processes. Theor. Comput. Sci. 139(1&2): 163-186 (1995) - [c2]Anne Bergeron:
Symbolic Timing Devices. AMAST 1995: 504-517 - 1993
- [j1]Anne Bergeron:
A Unified Approach to Control Problems in Discrete Event Processes. RAIRO Theor. Informatics Appl. 27(6): 555-573 (1993) - 1992
- [c1]Anne Bergeron:
Assisted Mathematics: The Case of Discrete Probabilities. Intelligent Tutoring Systems 1992: 40-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
