2009 |
39 | EE | Aïda Ouangraoua,
Anne Bergeron:
Parking functions, labeled trees and DCJ sorting scenarios
CoRR abs/0903.2499: (2009) |
2008 |
38 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
HP Distance Via Double Cut and Join Distance.
CPM 2008: 56-68 |
37 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios.
RECOMB-CG 2008: 226-240 |
36 | EE | Vincent Lacroix,
Michael Sammeth,
Roderic Guigó,
Anne Bergeron:
Exact Transcriptome Reconstruction from Short Sequence Reads.
WABI 2008: 50-63 |
35 | EE | Anne Bergeron,
Cedric Chauve,
Fabien de Montgolfier,
Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.
SIAM J. Discrete Math. 22(3): 1022-1039 (2008) |
2007 |
34 | EE | M. Belcaid,
Anne Bergeron,
Annie Chateau,
Cedric Chauve,
Yannick Gingras,
Guylaine Poisson,
M. Vendette:
Exploring Genome Rearrangements using Virtual Hybridization.
APBC 2007: 205-214 |
33 | EE | Eric Tannier,
Anne Bergeron,
Marie-France Sagot:
Advances on sorting by reversals.
Discrete Applied Mathematics 155(6-7): 881-888 (2007) |
32 | EE | Guylaine Poisson,
Cedric Chauve,
Xin Chen,
Anne Bergeron:
FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring.
Genomics, Proteomics & Bioinformatics 5(2): 121-130 (2007) |
31 | EE | Sèverine Bérard,
Anne Bergeron,
Cedric Chauve,
Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 4-16 (2007) |
2006 |
30 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
A Unifying View of Genome Rearrangements.
WABI 2006: 163-173 |
29 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
On Sorting by Translocations.
Journal of Computational Biology 13(2): 567-578 (2006) |
28 | EE | Anne Bergeron,
Jens Stoye:
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison.
Journal of Computational Biology 13(7): 1340-1354 (2006) |
2005 |
27 | EE | Anne Bergeron,
Cedric Chauve,
Fabien de Montgolfier,
Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.
ESA 2005: 779-790 |
26 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
On Sorting by Translocations.
RECOMB 2005: 615-629 |
25 | EE | Sèverine Bérard,
Anne Bergeron,
Cedric Chauve,
Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult.
WABI 2005: 228-238 |
24 | EE | Anne Bergeron:
A very elementary presentation of the Hannenhalli-Pevzner theory.
Discrete Applied Mathematics 146(2): 134-145 (2005) |
2004 |
23 | EE | Anne Bergeron,
Julia Mixtacki,
Jens Stoye:
Reversal Distance without Hurdles and Fortresses.
CPM 2004: 388-399 |
22 | EE | Sèverine Bérard,
Anne Bergeron,
Cedric Chauve:
Conservation of Combinatorial Structures in Evolution Scenarios.
Comparative Genomics 2004: 1-14 |
21 | EE | Anne Bergeron,
Mathieu Blanchette,
Annie Chateau,
Cedric Chauve:
Reconstructing Ancestral Gene Orders Using Conserved Intervals.
WABI 2004: 14-25 |
20 | EE | Anne Bergeron,
Sylvie Hamel:
From cascade decompositions to bit-vector algorithms.
Theor. Comput. Sci. 313(1): 3-16 (2004) |
19 | EE | 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) |
2003 |
18 | EE | Anne Bergeron,
Jens Stoye:
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison.
COCOON 2003: 68-79 |
17 | EE | Nicolas Luc,
Jean-Loup Risler,
Anne Bergeron,
Mathieu Raffinot:
Gene teams: a new formalization of gene clusters for comparative genomics.
Computational Biology and Chemistry 27(1): 59-67 (2003) |
2002 |
16 | | Anne Bergeron,
Steffen Heber,
Jens Stoye:
Common intervals and sorting by reversals: a marriage of necessity.
ECCB 2002: 54-63 |
15 | EE | Anne Bergeron,
Sylvie Corteel,
Mathieu Raffinot:
The Algorithmic of Gene Teams.
WABI 2002: 464-476 |
14 | EE | Anne Bergeron,
Sylvie Hamel:
Vector Algorithms for Approximate String Matching.
Int. J. Found. Comput. Sci. 13(1): 53-66 (2002) |
2001 |
13 | EE | Anne Bergeron,
Sylvie Hamel:
Cascade Decompositions are Bit-Vector Algorithms.
CIAA 2001: 13-26 |
12 | EE | Anne Bergeron:
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory.
CPM 2001: 106-117 |
11 | EE | Anne Bergeron,
François Strasbourg:
Experiments in Computing Sequences of Reversals.
WABI 2001: 164-174 |
2000 |
10 | EE | Anne Bergeron,
Sylvie Hamel:
Fast Implementations of Automata Computations.
CIAA 2000: 47-56 |
1999 |
9 | EE | Anne Bergeron,
Jean-Christophe Manzoni:
An Automated Analysis of Ping-Pong Interactions in E-mail Services.
TACAS 1999: 134-147 |
8 | EE | Anne Bergeron,
Riccardo Catalano:
Analysis of Reactive Systems with n Timers.
WIA 1999: 27-38 |
1998 |
7 | EE | Marie-Chantal Beaulieu,
Anne Bergeron:
Automata and Computational Probabilities.
Workshop on Implementing Automata 1998: 164-177 |
6 | EE | Anne Bergeron,
Paul Geanta,
Dominique Bergeron:
The Death factors: a combinatorial analysis.
In Silico Biology 1: 13 (1998) |
1997 |
5 | EE | Anne Bergeron:
On the Rational Behaviors of Concurrent Timers.
Theor. Comput. Sci. 189(1-2): 229-237 (1997) |
1995 |
4 | | Anne Bergeron:
Symbolic Timing Devices.
AMAST 1995: 504-517 |
3 | EE | Anne Bergeron:
Sharing Out Control in Distributed Processes.
Theor. Comput. Sci. 139(1&2): 163-186 (1995) |
1993 |
2 | | Anne Bergeron:
A Unified Approach to Control Problems in Discrete Event Processes.
ITA 27(6): 555-573 (1993) |
1992 |
1 | | Anne Bergeron:
Assisted Mathematics: The Case of Discrete Probabilities.
Intelligent Tutoring Systems 1992: 40-49 |