The SCEAS System
Navigation Menu

Search the dblp DataBase


Anne Bergeron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anne Bergeron
    Symbolic Timing Devices. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:504-517 [Conf]
  2. M. Belcaid, Anne Bergeron, Annie Chateau, Cedric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette
    Exploring Genome Rearrangements using Virtual Hybridization. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:205-214 [Conf]
  3. Anne Bergeron, Jens Stoye
    On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:68-79 [Conf]
  4. Anne Bergeron
    A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:106-117 [Conf]
  5. Anne Bergeron, Julia Mixtacki, Jens Stoye
    Reversal Distance without Hurdles and Fortresses. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:388-399 [Conf]
  6. Anne Bergeron, Steffen Heber, Jens Stoye
    Common intervals and sorting by reversals: a marriage of necessity. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:54-63 [Conf]
  7. Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot
    Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:779-790 [Conf]
  8. Anne Bergeron
    Assisted Mathematics: The Case of Discrete Probabilities. [Citation Graph (0, 0)][DBLP]
    Intelligent Tutoring Systems, 1992, pp:40-49 [Conf]
  9. Sèverine Bérard, Anne Bergeron, Cedric Chauve
    Conservation of Combinatorial Structures in Evolution Scenarios. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2004, pp:1-14 [Conf]
  10. Anne Bergeron, Julia Mixtacki, Jens Stoye
    On Sorting by Translocations. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:615-629 [Conf]
  11. Anne Bergeron, Jean-Christophe Manzoni
    An Automated Analysis of Ping-Pong Interactions in E-mail Services. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:134-147 [Conf]
  12. Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul
    Perfect Sorting by Reversals Is Not Always Difficult. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:228-238 [Conf]
  13. Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cedric Chauve
    Reconstructing Ancestral Gene Orders Using Conserved Intervals. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:14-25 [Conf]
  14. Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
    The Algorithmic of Gene Teams. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:464-476 [Conf]
  15. Anne Bergeron, Julia Mixtacki, Jens Stoye
    A Unifying View of Genome Rearrangements. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:163-173 [Conf]
  16. Anne Bergeron, François Strasbourg
    Experiments in Computing Sequences of Reversals. [Citation Graph (0, 0)][DBLP]
    WABI, 2001, pp:164-174 [Conf]
  17. Marie-Chantal Beaulieu, Anne Bergeron
    Automata and Computational Probabilities. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:164-177 [Conf]
  18. Anne Bergeron, Riccardo Catalano
    Analysis of Reactive Systems with n Timers. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:27-38 [Conf]
  19. Anne Bergeron, Sylvie Hamel
    Fast Implementations of Automata Computations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:47-56 [Conf]
  20. Anne Bergeron, Sylvie Hamel
    Cascade Decompositions are Bit-Vector Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:13-26 [Conf]
  21. Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot
    Gene teams: a new formalization of gene clusters for comparative genomics. [Citation Graph (0, 0)][DBLP]
    Computational Biology and Chemistry, 2003, v:27, n:1, pp:59-67 [Journal]
  22. Anne Bergeron
    A very elementary presentation of the Hannenhalli-Pevzner theory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:2, pp:134-145 [Journal]
  23. Eric Tannier, Anne Bergeron, Marie-France Sagot
    Advances on sorting by reversals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:881-888 [Journal]
  24. Anne Bergeron, Sylvie Hamel
    Vector Algorithms for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:53-66 [Journal]
  25. Anne Bergeron, Paul Geanta, Dominique Bergeron
    The Death factors: a combinatorial analysis. [Citation Graph (0, 0)][DBLP]
    In Silico Biology, 1998, v:1, n:, pp:13- [Journal]
  26. Anne Bergeron
    A Unified Approach to Control Problems in Discrete Event Processes. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:6, pp:555-573 [Journal]
  27. Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
    An algorithmic view of gene teams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:395-418 [Journal]
  28. Anne Bergeron
    Sharing Out Control in Distributed Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:163-186 [Journal]
  29. Anne Bergeron
    On the Rational Behaviors of Concurrent Timers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:189, n:1-2, pp:229-237 [Journal]
  30. Anne Bergeron, Sylvie Hamel
    From cascade decompositions to bit-vector algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:1, pp:3-16 [Journal]
  31. Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul
    Perfect Sorting by Reversals Is Not Always Difficult. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:1, pp:4-16 [Journal]

  32. HP Distance Via Double Cut and Join Distance. [Citation Graph (, )][DBLP]

  33. On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. [Citation Graph (, )][DBLP]

  34. Parking Functions, Labeled Trees and DCJ Sorting Scenarios. [Citation Graph (, )][DBLP]

  35. Comparative Genomics and Extensive Recombinations in Phage Communities. [Citation Graph (, )][DBLP]

  36. Exact Transcriptome Reconstruction from Short Sequence Reads. [Citation Graph (, )][DBLP]

  37. Parking functions, labeled trees and DCJ sorting scenarios [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002