<?xml version="1.0"?>
<dblpperson name="Anne Bergeron" pid="02/312" n="57">
<person key="homepages/02/312" mdate="2009-06-08">
<author pid="02/312">Anne Bergeron</author>
</person>
<r><inproceedings key="conf/recombcg/LafondBS23" mdate="2023-07-25">
<author pid="117/8942">Manuel Lafond</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="50/5594">Krister M. Swenson</author>
<title>Two Strikes Against the Phage Recombination Problem.</title>
<pages>68-83</pages>
<year>2023</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-031-36911-7_5</ee>
<crossref>conf/recombcg/2023</crossref>
<url>db/conf/recombcg/recombcg2023.html#LafondBS23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/recombcg/BergeronMVS22" mdate="2023-11-06">
<author pid="02/312">Anne Bergeron</author>
<author pid="10/314">Marie-Jean Meurs</author>
<author pid="320/3472">Romy Valiquette-Labont&#233;</author>
<author pid="50/5594">Krister M. Swenson</author>
<title>On the Comparison of Bacteriophage Populations.</title>
<pages>3-20</pages>
<year>2022</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-031-06220-9_1</ee>
<crossref>conf/recombcg/2022</crossref>
<url>db/conf/recombcg/recombcg2022.html#BergeronMVS22</url>
</inproceedings>
</r>
<r><article key="journals/bmcbi/BerardCPGBS16" mdate="2020-03-15">
<author pid="89/3537">S&#232;verine B&#233;rard</author>
<author pid="92/6470">Annie Chateau</author>
<author pid="176/7394">Nicolas Pompidor</author>
<author pid="140/3358">Paul Guertin</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="50/5594">Krister M. Swenson</author>
<title>Aligning the unalignable: bacteriophage whole genome alignments.</title>
<pages>30</pages>
<year>2016</year>
<volume>17</volume>
<journal>BMC Bioinform.</journal>
<ee type="oa">https://doi.org/10.1186/s12859-015-0869-5</ee>
<ee>https://www.wikidata.org/entity/Q27319503</ee>
<url>db/journals/bmcbi/bmcbi17.html#BerardCPGBS16</url>
</article>
</r>
<r><article key="journals/peerj-cs/Lavoie-Mongrain15" mdate="2025-10-14">
<author pid="163/2367">Philippe Lavoie-Mongrain</author>
<author pid="46/5684">Mahdi Belcaid</author>
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author orcid="0000-0003-2156-254X" pid="02/312">Anne Bergeron</author>
<author pid="87/3068">Guylaine Poisson</author>
<title>Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm.</title>
<pages>e6</pages>
<year>2015</year>
<volume>1</volume>
<journal>PeerJ Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.7717/peerj-cs.6</ee>
<ee>https://www.wikidata.org/entity/Q110949909</ee>
<url>db/journals/peerj-cs/peerj-cs1.html#Lavoie-Mongrain15</url>
</article>
</r>
<r><article key="journals/bmcbi/SwensonGDB13" mdate="2023-09-30">
<author pid="50/5594">Krister M. Swenson</author>
<author pid="140/3358">Paul Guertin</author>
<author pid="140/3416">Hugo Desch&#234;nes</author>
<author orcid="0000-0003-2156-254X" pid="02/312">Anne Bergeron</author>
<title>Reconstructing the modular recombination history of Staphylococcus aureus phages.</title>
<pages>S17</pages>
<year>2013</year>
<volume>14</volume>
<journal>BMC Bioinform.</journal>
<number>S-15</number>
<ee type="oa">https://doi.org/10.1186/1471-2105-14-S15-S17</ee>
<ee>https://www.wikidata.org/entity/Q35101704</ee>
<url>db/journals/bmcbi/bmcbi14S.html#SwensonGDB13</url>
</article>
</r>
<r><incollection key="books/daglib/p/BergeronS13" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>The Genesis of the DCJ Formula.</title>
<pages>63-81</pages>
<year>2013</year>
<booktitle>Models and Algorithms for Genome Evolution</booktitle>
<ee>https://doi.org/10.1007/978-1-4471-5298-9_5</ee>
<crossref>books/daglib/0032286</crossref>
<url>db/books/daglib/0032286.html#BergeronS13</url>
</incollection>
</r>
<r><inproceedings key="conf/isbra/OuangraouaSB12" mdate="2025-10-14">
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="50/5594">Krister M. Swenson</author>
<author pid="02/312">Anne Bergeron</author>
<title>On the Comparison of Sets of Alternative Transcripts.</title>
<pages>201-212</pages>
<year>2012</year>
<booktitle>ISBRA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-30191-9_19</ee>
<crossref>conf/isbra/2012</crossref>
<url>db/conf/isbra/isbra2012.html#OuangraouaSB12</url>
</inproceedings>
</r>
<r><article key="journals/bmcbi/BelcaidBP11" mdate="2020-03-15">
<author pid="46/5684">Mahdi Belcaid</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="87/3068">Guylaine Poisson</author>
<title>The evolution of the tape measure protein: units, duplications and losses.</title>
<pages>S10</pages>
<year>2011</year>
<volume>12</volume>
<journal>BMC Bioinform.</journal>
<number>S-9</number>
<ee type="oa">https://doi.org/10.1186/1471-2105-12-S9-S10</ee>
<ee>https://www.wikidata.org/entity/Q34094333</ee>
<url>db/journals/bmcbi/bmcbi12S.html#BelcaidBP11</url>
</article>
</r>
<r><article key="journals/jcb/OuangraouaBS11" mdate="2025-10-14">
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="50/5594">Krister M. Swenson</author>
<title>Theory and Practice of Ultra-Perfection.</title>
<pages>1219-1230</pages>
<year>2011</year>
<volume>18</volume>
<journal>J. Comput. Biol.</journal>
<number>9</number>
<ee>https://doi.org/10.1089/cmb.2011.0086</ee>
<ee>https://www.wikidata.org/entity/Q51533886</ee>
<url>db/journals/jcb/jcb18.html#OuangraouaBS11</url>
</article>
</r>
<r><article key="journals/jcb/OuangraouaB10" mdate="2025-10-14">
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="02/312">Anne Bergeron</author>
<title>Combinatorial Structure of Genome Rearrangements Scenarios.</title>
<pages>1129-1144</pages>
<year>2010</year>
<volume>17</volume>
<journal>J. Comput. Biol.</journal>
<number>9</number>
<ee>https://doi.org/10.1089/cmb.2010.0126</ee>
<ee>https://www.wikidata.org/entity/Q51655072</ee>
<url>db/journals/jcb/jcb17.html#OuangraouaB10</url>
</article>
</r>
<r><article key="journals/jcb/BergeronMS10" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="95/4828">Paul Medvedev</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>Rearrangement Models and Single-Cut Operations.</title>
<pages>1213-1225</pages>
<year>2010</year>
<volume>17</volume>
<journal>J. Comput. Biol.</journal>
<number>9</number>
<ee>https://doi.org/10.1089/cmb.2010.0091</ee>
<ee>https://www.wikidata.org/entity/Q51655053</ee>
<url>db/journals/jcb/jcb17.html#BergeronMS10</url>
</article>
</r>
<r><article key="journals/jcb/BelcaidBP10" mdate="2020-03-12">
<author pid="46/5684">Mahdi Belcaid</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="87/3068">Guylaine Poisson</author>
<title>Mosaic Graphs and Comparative Genomics in Phage Communities.</title>
<pages>1315-1326</pages>
<year>2010</year>
<volume>17</volume>
<journal>J. Comput. Biol.</journal>
<number>9</number>
<ee>https://doi.org/10.1089/cmb.2010.0108</ee>
<ee>https://www.wikidata.org/entity/Q35067223</ee>
<url>db/journals/jcb/jcb17.html#BelcaidBP10</url>
</article>
</r>
<r><inproceedings key="conf/recomb/OuangraouaBS10" mdate="2025-10-14">
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="50/5594">Krister M. Swenson</author>
<title>Ultra-Perfect Sorting Scenarios.</title>
<pages>50-61</pages>
<year>2010</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-642-16181-0_5</ee>
<crossref>conf/recomb/2010cg</crossref>
<url>db/conf/recomb/recomb-cg2010.html#OuangraouaBS10</url>
</inproceedings>
</r>
<r><inproceedings publtype="informal" key="conf/dagstuhl/BergeronMS10" mdate="2018-08-23">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author pid="72/3506">Jens Stoye</author>
<title>A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance.</title>
<year>2010</year>
<booktitle>Structure Discovery in Biology: Motifs, Networks &#38; Phylogenies</booktitle>
<ee type="oa">http://drops.dagstuhl.de/opus/volltexte/2010/2689/</ee>
<crossref>conf/dagstuhl/2010P10231</crossref>
<url>db/conf/dagstuhl/P10231.html#BergeronMS10</url>
</inproceedings>
</r>
<r><article key="journals/tcs/BergeronMS09" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>A new linear time algorithm to compute the genomic distance via the double cut and join distance.</title>
<pages>5300-5316</pages>
<year>2009</year>
<volume>410</volume>
<journal>Theor. Comput. Sci.</journal>
<number>51</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2009.09.008</ee>
<url>db/journals/tcs/tcs410.html#BergeronMS09</url>
</article>
</r>
<r><inproceedings key="conf/recomb/OuangraouaB09" mdate="2025-10-14">
<author orcid="0000-0002-2040-4948" pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="02/312">Anne Bergeron</author>
<title>Parking Functions, Labeled Trees and DCJ Sorting Scenarios.</title>
<pages>24-35</pages>
<year>2009</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-642-04744-2_3</ee>
<crossref>conf/recomb/2009cg</crossref>
<url>db/conf/recomb/recomb-cg2009.html#OuangraouaB09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/recomb/PoissonBB09" mdate="2019-05-13">
<author pid="87/3068">Guylaine Poisson</author>
<author pid="46/5684">Mahdi Belcaid</author>
<author pid="02/312">Anne Bergeron</author>
<title>Comparative Genomics and Extensive Recombinations in Phage Communities.</title>
<pages>205-216</pages>
<year>2009</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-642-04744-2_17</ee>
<crossref>conf/recomb/2009cg</crossref>
<url>db/conf/recomb/recomb-cg2009.html#PoissonBB09</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-0903-2499" mdate="2018-08-13">
<author pid="42/1216">A&#239;da Ouangraoua</author>
<author pid="02/312">Anne Bergeron</author>
<title>Parking functions, labeled trees and DCJ sorting scenarios</title>
<ee type="oa">http://arxiv.org/abs/0903.2499</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0903.2499</volume>
<url>db/journals/corr/corr0903.html#abs-0903-2499</url>
</article>
</r>
<r><article key="journals/siamdm/BergeronCMR08" mdate="2023-09-30">
<author orcid="0000-0003-2156-254X" pid="02/312">Anne Bergeron</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<author pid="57/6313">Fabien de Montgolfier</author>
<author pid="98/2963">Mathieu Raffinot</author>
<title>Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.</title>
<pages>1022-1039</pages>
<year>2008</year>
<volume>22</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>3</number>
<ee>https://doi.org/10.1137/060651331</ee>
<url>db/journals/siamdm/siamdm22.html#BergeronCMR08</url>
</article>
</r>
<r><inproceedings key="conf/cpm/BergeronMS08" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>HP Distance Via Double Cut and Join Distance.</title>
<pages>56-68</pages>
<year>2008</year>
<booktitle>CPM</booktitle>
<ee>https://doi.org/10.1007/978-3-540-69068-9_8</ee>
<crossref>conf/cpm/2008</crossref>
<url>db/conf/cpm/cpm2008.html#BergeronMS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/recomb/BergeronMS08" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios.</title>
<pages>226-240</pages>
<year>2008</year>
<booktitle>RECOMB-CG</booktitle>
<ee>https://doi.org/10.1007/978-3-540-87989-3_17</ee>
<crossref>conf/recomb/2008cg</crossref>
<url>db/conf/recomb/recomb-cg2008.html#BergeronMS08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wabi/LacroixSGB08" mdate="2017-05-25">
<author pid="70/3649">Vincent Lacroix</author>
<author pid="11/1682">Michael Sammeth</author>
<author pid="84/1360">Roderic Guig&#243;</author>
<author pid="02/312">Anne Bergeron</author>
<title>Exact Transcriptome Reconstruction from Short Sequence Reads.</title>
<pages>50-63</pages>
<year>2008</year>
<booktitle>WABI</booktitle>
<ee>https://doi.org/10.1007/978-3-540-87361-7_5</ee>
<crossref>conf/wabi/2008</crossref>
<url>db/conf/wabi/wabi2008.html#LacroixSGB08</url>
</inproceedings>
</r>
<r><article key="journals/dam/TannierBS07" mdate="2021-02-11">
<author pid="31/1212">Eric Tannier</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="53/296">Marie-France Sagot</author>
<title>Advances on sorting by reversals.</title>
<pages>881-888</pages>
<year>2007</year>
<volume>155</volume>
<journal>Discret. Appl. Math.</journal>
<number>6-7</number>
<ee type="oa">https://doi.org/10.1016/j.dam.2005.02.033</ee>
<url>db/journals/dam/dam155.html#TannierBS07</url>
</article>
</r>
<r><article key="journals/gpb/PoissonCCB07" mdate="2020-02-20">
<author pid="87/3068">Guylaine Poisson</author>
<author orcid="0000-0001-9837-1878" pid="52/3751">C&#233;dric Chauve</author>
<author pid="24/1518">Xin Chen</author>
<author pid="02/312">Anne Bergeron</author>
<title>FragAnchor: A Large-Scale Predictor of Glycosylphosphatidylinositol Anchors in Eukaryote Protein Sequences by Qualitative Scoring.</title>
<pages>121-130</pages>
<year>2007</year>
<volume>5</volume>
<journal>Genom. Proteom. Bioinform.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.1016/S1672-0229(07)60022-9</ee>
<ee>https://www.wikidata.org/entity/Q37318346</ee>
<url>db/journals/gpb/gpb5.html#PoissonCCB07</url>
</article>
</r>
<r><article key="journals/tcbb/BerardBCP07" mdate="2023-08-28">
<author pid="89/3537">S&#232;verine B&#233;rard</author>
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0001-9837-1878" pid="52/3751">C&#233;dric Chauve</author>
<author orcid="0000-0001-6519-975X" pid="51/6396">Christophe Paul</author>
<title>Perfect Sorting by Reversals Is Not Always Difficult.</title>
<pages>4-16</pages>
<year>2007</year>
<volume>4</volume>
<journal>IEEE ACM Trans. Comput. Biol. Bioinform.</journal>
<number>1</number>
<ee>https://doi.org/10.1109/TCBB.2007.1011</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/TCBB.2007.1011</ee>
<ee>https://dl.acm.org/doi/10.1109/TCBB.2007.1011</ee>
<ee>https://www.wikidata.org/entity/Q51627771</ee>
<url>db/journals/tcbb/tcbb4.html#BerardBCP07</url>
</article>
</r>
<r><inproceedings key="conf/apbc/BelcaidBCCGPV07" mdate="2020-03-12">
<author pid="46/5684">Mahdi Belcaid</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="92/6470">Annie Chateau</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<author pid="01/311">Yannick Gingras</author>
<author pid="87/3068">Guylaine Poisson</author>
<author pid="75/1004">M. Vendette</author>
<title>Exploring Genome Rearrangements using Virtual Hybridization.</title>
<pages>205-214</pages>
<year>2007</year>
<crossref>conf/apbc/2007</crossref>
<booktitle>APBC</booktitle>
<ee type="oa">http://www.comp.nus.edu.sg/~wongls/psZ/apbc2007/apbc217a.pdf</ee>
<url>db/conf/apbc/apbc2007.html#BelcaidBCCGPV07</url>
</inproceedings>
</r>
<r><incollection key="books/ox/07/BergeronMS07" mdate="2020-05-06">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author pid="72/3506">Jens Stoye</author>
<title>The inversion distance problem.</title>
<year>2007</year>
<booktitle>Mathematics of Evolution and Phylogeny</booktitle>
<crossref>books/ox/07/G2007</crossref>
<url>db/books/collections/G2007.html#BergeronMS07</url>
</incollection>
</r>
<r><article key="journals/jcb/BergeronMS06" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>On Sorting by Translocations.</title>
<pages>567-578</pages>
<year>2006</year>
<volume>13</volume>
<journal>J. Comput. Biol.</journal>
<number>2</number>
<ee>https://doi.org/10.1089/cmb.2006.13.567</ee>
<ee>https://www.wikidata.org/entity/Q51944558</ee>
<url>db/journals/jcb/jcb13.html#BergeronMS06</url>
</article>
</r>
<r><article key="journals/jcb/BergeronS06" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>On the Similarity of Sets of Permutations and Its Applications to Genome Comparison.</title>
<pages>1340-1354</pages>
<year>2006</year>
<volume>13</volume>
<journal>J. Comput. Biol.</journal>
<number>7</number>
<ee>https://doi.org/10.1089/cmb.2006.13.1340</ee>
<ee>https://www.wikidata.org/entity/Q51931170</ee>
<url>db/journals/jcb/jcb13.html#BergeronS06</url>
</article>
</r>
<r><inproceedings key="conf/wabi/BergeronMS06" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>A Unifying View of Genome Rearrangements.</title>
<pages>163-173</pages>
<year>2006</year>
<crossref>conf/wabi/2006</crossref>
<booktitle>WABI</booktitle>
<ee>https://doi.org/10.1007/11851561_16</ee>
<url>db/conf/wabi/wabi2006.html#BergeronMS06</url>
</inproceedings>
</r>
<r><article key="journals/dam/Bergeron05" mdate="2021-02-11">
<author pid="02/312">Anne Bergeron</author>
<title>A very elementary presentation of the Hannenhalli-Pevzner theory.</title>
<pages>134-145</pages>
<year>2005</year>
<volume>146</volume>
<journal>Discret. Appl. Math.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.1016/j.dam.2004.04.010</ee>
<url>db/journals/dam/dam146.html#Bergeron05</url>
</article>
</r>
<r><inproceedings key="conf/esa/BergeronCMR05" mdate="2017-05-26">
<author pid="02/312">Anne Bergeron</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<author pid="57/6313">Fabien de Montgolfier</author>
<author pid="98/2963">Mathieu Raffinot</author>
<title>Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs.</title>
<pages>779-790</pages>
<year>2005</year>
<crossref>conf/esa/2005</crossref>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/11561071_69</ee>
<url>db/conf/esa/esa2005.html#BergeronCMR05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/recomb/BergeronMS05" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>On Sorting by Translocations.</title>
<pages>615-629</pages>
<year>2005</year>
<crossref>conf/recomb/2005</crossref>
<booktitle>RECOMB</booktitle>
<ee>https://doi.org/10.1007/11415770_47</ee>
<url>db/conf/recomb/recomb2005.html#BergeronMS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wabi/BerardBCP05" mdate="2017-05-25">
<author pid="89/3537">S&#232;verine B&#233;rard</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<author pid="51/6396">Christophe Paul</author>
<title>Perfect Sorting by Reversals Is Not Always Difficult.</title>
<pages>228-238</pages>
<year>2005</year>
<crossref>conf/wabi/2005</crossref>
<booktitle>WABI</booktitle>
<ee>https://doi.org/10.1007/11557067_19</ee>
<url>db/conf/wabi/wabi2005.html#BerardBCP05</url>
</inproceedings>
</r>
<r><article key="journals/tcs/BergeronH04" mdate="2021-02-17">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-8941-2284" pid="96/6540">Sylvie Hamel</author>
<title>From cascade decompositions to bit-vector algorithms.</title>
<pages>3-16</pages>
<year>2004</year>
<volume>313</volume>
<journal>Theor. Comput. Sci.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2003.10.010</ee>
<ee>https://www.wikidata.org/entity/Q60704267</ee>
<url>db/journals/tcs/tcs313.html#BergeronH04</url>
</article>
</r>
<r><article key="journals/tcs/BealBCR04" mdate="2021-02-17">
<author pid="24/6086">Marie-Pierre B&#233;al</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="30/3382">Sylvie Corteel</author>
<author pid="98/2963">Mathieu Raffinot</author>
<title>An algorithmic view of gene teams.</title>
<pages>395-418</pages>
<year>2004</year>
<volume>320</volume>
<journal>Theor. Comput. Sci.</journal>
<number>2-3</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2004.02.036</ee>
<url>db/journals/tcs/tcs320.html#BealBCR04</url>
</article>
</r>
<r><inproceedings key="conf/cpm/BergeronMS04" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author pid="19/298">Julia Mixtacki</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>Reversal Distance without Hurdles and Fortresses.</title>
<pages>388-399</pages>
<ee>https://doi.org/10.1007/978-3-540-27801-6_29</ee>
<year>2004</year>
<crossref>conf/cpm/2004</crossref>
<booktitle>CPM</booktitle>
<url>db/conf/cpm/cpm2004.html#BergeronMS04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/recomb/BerardBC04" mdate="2019-05-13">
<author pid="89/3537">S&#232;verine B&#233;rard</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<title>Conservation of Combinatorial Structures in Evolution Scenarios.</title>
<pages>1-14</pages>
<ee>https://doi.org/10.1007/978-3-540-32290-0_1</ee>
<year>2004</year>
<crossref>conf/recomb/2004rcg</crossref>
<booktitle>Comparative Genomics</booktitle>
<url>db/conf/recomb/rcg2004.html#BerardBC04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wabi/BergeronBCC04" mdate="2017-05-25">
<author pid="02/312">Anne Bergeron</author>
<author pid="b/MathieuBlanchette">Mathieu Blanchette</author>
<author pid="92/6470">Annie Chateau</author>
<author pid="52/3751">C&#233;dric Chauve</author>
<title>Reconstructing Ancestral Gene Orders Using Conserved Intervals.</title>
<pages>14-25</pages>
<ee>https://doi.org/10.1007/978-3-540-30219-3_2</ee>
<year>2004</year>
<crossref>conf/wabi/2004</crossref>
<booktitle>WABI</booktitle>
<url>db/conf/wabi/wabi2004.html#BergeronBCC04</url>
</inproceedings>
</r>
<r><article key="journals/candc/LucRBR03" mdate="2020-03-13">
<author pid="14/1416">Nicolas Luc</author>
<author pid="37/3975">Jean-Loup Risler</author>
<author pid="02/312">Anne Bergeron</author>
<author pid="98/2963">Mathieu Raffinot</author>
<title>Gene teams: a new formalization of gene clusters for comparative genomics.</title>
<pages>59-67</pages>
<year>2003</year>
<volume>27</volume>
<journal>Comput. Biol. Chem.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/S1476-9271(02)00097-X</ee>
<ee>https://www.wikidata.org/entity/Q52014604</ee>
<url>db/journals/candc/candc27.html#LucRBR03</url>
</article>
</r>
<r><inproceedings key="conf/cocoon/BergeronS03" mdate="2023-03-21">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>On the Similarity of Sets of Permutations and Its Applications to Genome Comparison.</title>
<pages>68-79</pages>
<ee>https://doi.org/10.1007/3-540-45071-8_9</ee>
<year>2003</year>
<crossref>conf/cocoon/2003</crossref>
<booktitle>COCOON</booktitle>
<url>db/conf/cocoon/cocoon2003.html#BergeronS03</url>
</inproceedings>
</r>
<r><article key="journals/ijfcs/BergeronH02" mdate="2019-06-02">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-8941-2284" pid="96/6540">Sylvie Hamel</author>
<title>Vector Algorithms for Approximate String Matching.</title>
<pages>53-66</pages>
<year>2002</year>
<volume>13</volume>
<journal>Int. J. Found. Comput. Sci.</journal>
<number>1</number>
<ee>https://doi.org/10.1142/S0129054102000947</ee>
<ee>https://www.wikidata.org/entity/Q60704269</ee>
<url>db/journals/ijfcs/ijfcs13.html#BergeronH02</url>
</article>
</r>
<r><inproceedings key="conf/eccb/BergeronHS02" mdate="2026-02-01">
<author pid="02/312">Anne Bergeron</author>
<author pid="28/4920">Steffen Heber</author>
<author orcid="0000-0002-4656-7155" pid="72/3506">Jens Stoye</author>
<title>Common intervals and sorting by reversals: a marriage of necessity.</title>
<pages>54-63</pages>
<year>2002</year>
<crossref>conf/eccb/2002</crossref>
<booktitle>ECCB</booktitle>
<url>db/conf/eccb/eccb2002.html#BergeronHS02</url>
<ee>https://doi.org/10.1093/bioinformatics/18.suppl_2.s54</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/wabi/BergeronCR02" mdate="2018-11-14">
<author pid="02/312">Anne Bergeron</author>
<author pid="30/3382">Sylvie Corteel</author>
<author pid="98/2963">Mathieu Raffinot</author>
<title>The Algorithmic of Gene Teams.</title>
<pages>464-476</pages>
<year>2002</year>
<crossref>conf/wabi/2002</crossref>
<booktitle>WABI</booktitle>
<ee>https://doi.org/10.1007/3-540-45784-4_36</ee>
<ee>https://www.wikidata.org/entity/Q56686759</ee>
<url>db/conf/wabi/wabi2002.html#BergeronCR02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cpm/Bergeron01" mdate="2017-05-26">
<author pid="02/312">Anne Bergeron</author>
<title>A Very Elementary Presentation of the Hannenhalli-Pevzner Theory.</title>
<pages>106-117</pages>
<year>2001</year>
<crossref>conf/cpm/2001</crossref>
<booktitle>CPM</booktitle>
<ee>https://doi.org/10.1007/3-540-48194-X_9</ee>
<url>db/conf/cpm/cpm2001.html#Bergeron01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wabi/BergeronS01" mdate="2017-05-25">
<author pid="02/312">Anne Bergeron</author>
<author pid="53/1620">Fran&#231;ois Strasbourg</author>
<title>Experiments in Computing Sequences of Reversals.</title>
<pages>164-174</pages>
<year>2001</year>
<crossref>conf/wabi/2001</crossref>
<booktitle>WABI</booktitle>
<ee>https://doi.org/10.1007/3-540-44696-6_13</ee>
<url>db/conf/wabi/wabi2001.html#BergeronS01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wia/BergeronH01" mdate="2019-06-02">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-8941-2284" pid="96/6540">Sylvie Hamel</author>
<title>Cascade Decompositions are Bit-Vector Algorithms.</title>
<pages>13-26</pages>
<year>2001</year>
<crossref>conf/wia/2001</crossref>
<booktitle>CIAA</booktitle>
<ee>https://doi.org/10.1007/3-540-36390-4_2</ee>
<ee>https://www.wikidata.org/entity/Q60704270</ee>
<url>db/conf/wia/ciaa2001.html#BergeronH01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wia/BergeronH00" mdate="2019-06-02">
<author pid="02/312">Anne Bergeron</author>
<author orcid="0000-0002-8941-2284" pid="96/6540">Sylvie Hamel</author>
<title>Fast Implementations of Automata Computations.</title>
<pages>47-56</pages>
<year>2000</year>
<crossref>conf/wia/2000</crossref>
<booktitle>CIAA</booktitle>
<ee>https://doi.org/10.1007/3-540-44674-5_3</ee>
<ee>https://www.wikidata.org/entity/Q60704271</ee>
<url>db/conf/wia/ciaa2000.html#BergeronH00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tacas/BergeronM99" mdate="2017-05-23">
<author pid="02/312">Anne Bergeron</author>
<author pid="60/4187">Jean-Christophe Manzoni</author>
<title>An Automated Analysis of Ping-Pong Interactions in E-mail Services.</title>
<pages>134-147</pages>
<year>1999</year>
<crossref>conf/tacas/1999</crossref>
<booktitle>TACAS</booktitle>
<ee>https://doi.org/10.1007/3-540-49059-0_10</ee>
<url>db/conf/tacas/tacas99.html#BergeronM99</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wia/BergeronC99" mdate="2017-05-25">
<author pid="02/312">Anne Bergeron</author>
<author pid="67/1510">Riccardo Catalano</author>
<title>Analysis of Reactive Systems with n Timers.</title>
<pages>27-38</pages>
<year>1999</year>
<crossref>conf/wia/1999</crossref>
<booktitle>WIA</booktitle>
<ee>https://doi.org/10.1007/3-540-45526-4_3</ee>
<url>db/conf/wia/wia1999.html#BergeronC99</url>
</inproceedings>
</r>
<r><article key="journals/isb/BergeronGB98" mdate="2020-08-20">
<author pid="02/312">Anne Bergeron</author>
<author pid="75/4477">Paul Geanta</author>
<author pid="81/819">Dominique Bergeron</author>
<title>The Death factors: a combinatorial analysis.</title>
<pages>147-158</pages>
<year>1998</year>
<volume>1</volume>
<journal>Silico Biol.</journal>
<number>3</number>
<ee>http://content.iospress.com/articles/in-silico-biology/isb00013</ee>
<ee>http://www.bioinfo.de/isb/abstracts/01/0013.html</ee>
<url>db/journals/isb/isb1.html#BergeronGB98</url>
</article>
</r>
<r><inproceedings key="conf/wia/BeaulieuB98" mdate="2017-05-24">
<author pid="26/6700">Marie-Chantal Beaulieu</author>
<author pid="02/312">Anne Bergeron</author>
<title>Automata and Computational Probabilities.</title>
<pages>164-177</pages>
<year>1998</year>
<crossref>conf/wia/1998</crossref>
<booktitle>Workshop on Implementing Automata</booktitle>
<ee>https://doi.org/10.1007/3-540-48057-9_14</ee>
<url>db/conf/wia/wia1998.html#BeaulieuB98</url>
</inproceedings>
</r>
<r><article key="journals/tcs/Bergeron97" mdate="2021-02-17">
<author pid="02/312">Anne Bergeron</author>
<title>On the Rational Behaviors of Concurrent Timers.</title>
<pages>229-237</pages>
<year>1997</year>
<volume>189</volume>
<journal>Theor. Comput. Sci.</journal>
<number>1-2</number>
<url>db/journals/tcs/tcs189.html#Bergeron97</url>
<ee type="oa">https://doi.org/10.1016/S0304-3975(97)00074-1</ee>
</article>
</r>
<r><article key="journals/tcs/Bergeron95" mdate="2021-02-17">
<author pid="02/312">Anne Bergeron</author>
<title>Sharing Out Control in Distributed Processes.</title>
<pages>163-186</pages>
<year>1995</year>
<volume>139</volume>
<journal>Theor. Comput. Sci.</journal>
<number>1&#38;2</number>
<url>db/journals/tcs/tcs139.html#Bergeron95</url>
<ee type="oa">https://doi.org/10.1016/0304-3975(94)00132-3</ee>
</article>
</r>
<r><inproceedings key="conf/amast/Bergeron95" mdate="2017-05-20">
<author pid="02/312">Anne Bergeron</author>
<title>Symbolic Timing Devices.</title>
<pages>504-517</pages>
<year>1995</year>
<crossref>conf/amast/1995</crossref>
<booktitle>AMAST</booktitle>
<url>db/conf/amast/amast95.html#Bergeron95</url>
<ee>https://doi.org/10.1007/3-540-60043-4_74</ee>
</inproceedings>
</r>
<r><article key="journals/ita/Bergeron93" mdate="2020-05-25">
<author pid="02/312">Anne Bergeron</author>
<title>A Unified Approach to Control Problems in Discrete Event Processes.</title>
<pages>555-573</pages>
<year>1993</year>
<volume>27</volume>
<journal>RAIRO Theor. Informatics Appl.</journal>
<number>6</number>
<url>db/journals/ita/ita27.html#Bergeron93</url>
<ee>https://doi.org/10.1051/ita/1993270605551</ee>
</article>
</r>
<r><inproceedings key="conf/its/Bergeron92" mdate="2017-05-20">
<author pid="02/312">Anne Bergeron</author>
<title>Assisted Mathematics: The Case of Discrete Probabilities.</title>
<pages>40-49</pages>
<year>1992</year>
<crossref>conf/its/1992</crossref>
<booktitle>Intelligent Tutoring Systems</booktitle>
<url>db/conf/its/its1992.html#Bergeron92</url>
<ee>https://doi.org/10.1007/3-540-55606-0_7</ee>
</inproceedings>
</r>
<coauthors n="41" nc="1">
<co c="0"><na f="b/B=eacute=al:Marie=Pierre" pid="24/6086">Marie-Pierre B&#233;al</na></co>
<co c="-1"><na f="b/Beaulieu:Marie=Chantal" pid="26/6700">Marie-Chantal Beaulieu</na></co>
<co c="0"><na f="b/Belcaid:Mahdi" pid="46/5684">Mahdi Belcaid</na></co>
<co c="0"><na f="b/B=eacute=rard:S=egrave=verine" pid="89/3537">S&#232;verine B&#233;rard</na></co>
<co c="0"><na f="b/Bergeron:Dominique" pid="81/819">Dominique Bergeron</na></co>
<co c="0"><na f="b/Blanchette:Mathieu" pid="b/MathieuBlanchette">Mathieu Blanchette</na></co>
<co c="-1"><na f="c/Catalano:Riccardo" pid="67/1510">Riccardo Catalano</na></co>
<co c="0"><na f="c/Chateau:Annie" pid="92/6470">Annie Chateau</na></co>
<co c="0"><na f="c/Chauve:C=eacute=dric" pid="52/3751">C&#233;dric Chauve</na></co>
<co c="0"><na f="c/Chen:Xin" pid="24/1518">Xin Chen</na></co>
<co c="0"><na f="c/Corteel:Sylvie" pid="30/3382">Sylvie Corteel</na></co>
<co c="0"><na f="d/Desch=ecirc=nes:Hugo" pid="140/3416">Hugo Desch&#234;nes</na></co>
<co c="0"><na f="g/Geanta:Paul" pid="75/4477">Paul Geanta</na></co>
<co c="0"><na f="g/Gingras:Yannick" pid="01/311">Yannick Gingras</na></co>
<co c="0"><na f="g/Guertin:Paul" pid="140/3358">Paul Guertin</na></co>
<co c="0"><na f="g/Guig=oacute=:Roderic" pid="84/1360">Roderic Guig&#243;</na></co>
<co c="0"><na f="h/Hamel:Sylvie" pid="96/6540">Sylvie Hamel</na></co>
<co c="0"><na f="h/Heber:Steffen" pid="28/4920">Steffen Heber</na></co>
<co c="0"><na f="l/Lacroix:Vincent" pid="70/3649">Vincent Lacroix</na></co>
<co c="0"><na f="l/Lafond:Manuel" pid="117/8942">Manuel Lafond</na></co>
<co c="0"><na f="l/Lavoie=Mongrain:Philippe" pid="163/2367">Philippe Lavoie-Mongrain</na></co>
<co c="0"><na f="l/Luc:Nicolas" pid="14/1416">Nicolas Luc</na></co>
<co c="-1"><na f="m/Manzoni:Jean=Christophe" pid="60/4187">Jean-Christophe Manzoni</na></co>
<co c="0"><na f="m/Medvedev:Paul" pid="95/4828">Paul Medvedev</na></co>
<co c="0"><na f="m/Meurs:Marie=Jean" pid="10/314">Marie-Jean Meurs</na></co>
<co c="0"><na f="m/Mixtacki:Julia" pid="19/298">Julia Mixtacki</na></co>
<co c="0"><na f="m/Montgolfier:Fabien_de" pid="57/6313">Fabien de Montgolfier</na></co>
<co c="0"><na f="o/Ouangraoua:A=iuml=da" pid="42/1216">A&#239;da Ouangraoua</na></co>
<co c="0"><na f="p/Paul:Christophe" pid="51/6396">Christophe Paul</na></co>
<co c="0"><na f="p/Poisson:Guylaine" pid="87/3068">Guylaine Poisson</na></co>
<co c="0"><na f="p/Pompidor:Nicolas" pid="176/7394">Nicolas Pompidor</na></co>
<co c="0"><na f="r/Raffinot:Mathieu" pid="98/2963">Mathieu Raffinot</na></co>
<co c="0"><na f="r/Risler:Jean=Loup" pid="37/3975">Jean-Loup Risler</na></co>
<co c="0"><na f="s/Sagot:Marie=France" pid="53/296">Marie-France Sagot</na></co>
<co c="0"><na f="s/Sammeth:Michael" pid="11/1682">Michael Sammeth</na></co>
<co c="0"><na f="s/Stoye:Jens" pid="72/3506">Jens Stoye</na></co>
<co c="-1"><na f="s/Strasbourg:Fran=ccedil=ois" pid="53/1620">Fran&#231;ois Strasbourg</na></co>
<co c="0"><na f="s/Swenson:Krister_M=" pid="50/5594">Krister M. Swenson</na></co>
<co c="0"><na f="t/Tannier:Eric" pid="31/1212">Eric Tannier</na></co>
<co c="0"><na f="v/Valiquette=Labont=eacute=:Romy" pid="320/3472">Romy Valiquette-Labont&#233;</na></co>
<co c="0"><na f="v/Vendette:M=" pid="75/1004">M. Vendette</na></co>
</coauthors>
</dblpperson>

