Anne Bergeron

2008
35	EE	Anne Bergeron, Julia Mixtacki, Jens Stoye: HP Distance Via Double Cut and Join Distance. CPM 2008: 56-68
34	EE	Anne Bergeron, Julia Mixtacki, Jens Stoye: On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. RECOMB-CG 2008: 226-240
33	EE	Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron: Exact Transcriptome Reconstruction from Short Sequence Reads. WABI 2008: 50-63
32	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
31	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
30	EE	Eric Tannier, Anne Bergeron, Marie-France Sagot: Advances on sorting by reversals. Discrete Applied Mathematics 155(6-7): 881-888 (2007)
29	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
28	EE	Anne Bergeron, Julia Mixtacki, Jens Stoye: A Unifying View of Genome Rearrangements. WABI 2006: 163-173
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

Coauthor Index

1	Marie-Pierre Béal	[19]
2	Marie-Chantal Beaulieu	[7]
3	M. Belcaid	[31]
4	Sèverine Bérard	[22] [25] [29]
5	Dominique Bergeron	[6]
6	Mathieu Blanchette	[21]
7	Riccardo Catalano	[8]
8	Annie Chateau	[21] [31]
9	Cedric Chauve	[21] [22] [25] [27] [29] [31] [32]
10	Sylvie Corteel	[15] [19]
11	Paul Geanta	[6]
12	Yannick Gingras	[31]
13	Roderic Guigó	[33]
14	Sylvie Hamel	[10] [13] [14] [20]
15	Steffen Heber	[16]
16	Vincent Lacroix	[33]
17	Nicolas Luc	[17]
18	Jean-Christophe Manzoni	[9]
19	Julia Mixtacki	[23] [26] [28] [34] [35]
20	Fabien de Montgolfier	[27] [32]
21	Christophe Paul	[25] [29]
22	Guylaine Poisson	[31]
23	Mathieu Raffinot	[15] [17] [19] [27] [32]
24	Jean-Loup Risler	[17]
25	Marie-France Sagot	[30]
26	Michael Sammeth	[33]
27	Jens Stoye	[16] [18] [23] [26] [28] [34] [35]
28	François Strasbourg	[11]
29	Eric Tannier	[30]
30	M. Vendette	[31]

Colors in the list of coauthors