Comparing bacterial genomes from linear orders of patterns

Discrete Applied Mathematics

Volumn 156, Issue 8, 2008, Pages 1251-1262

  Guyon, Frédéric ^a,b   Guénoche, Alain ^a,b  

^a INSERM   (France)

^b IML CNRS   (France)

Author keywords

Genome comparison; Longest common circular chains; Maximal unique matches

Indexed keywords

BACTERIA; DNA SEQUENCES; EVOLUTIONARY ALGORITHMS;

GENOME COMPARISON; LONGEST COMMON CIRCULAR CHAINS; MAXIMAL UNIQUE MATCHES;

GENES;

EID: 40849118167     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.04.030     Document Type: Article

References (32)

1. Aldous D., and Diakonis P. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. 36 4 (1999) 413-432
2. Arratia R., Goldstein L., and Gordon L. Poisson approximation and the Chen-Stein method. Statist. Sci. 5 (1990) 403-434
3. Bader D.A., Moret B.M.E., and Yan M. A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. J. Comput. Biol. 8 (2001) 483-491
4. Bafna V., and Pevzner P. Transforming cabbage into Turnip: polynomial algorithm for sorting signed permutations by reversal. J. ACM 46 (1999) 1-27
5. Baik J., Deift P.A., and Johansson K. On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 (1999) 1119-1178
6. Berge C. Principes de Combinatoire (1968), Dunod, Paris
7. A. Bergeron, A very elementary presentation of the Hannenhalli-Pevzner theory, CPM'01, Lecture Notes in Computer Science, vol. 2089, 2001, pp. 106-117.
8. A. Caprara, G. Lancia, Experimental and statistical analysis of sorting by reversals, Kluwer Series in Computational Biology, vol. 1, 2000.
9. Chryssaphinou O., and Papastavridis S. A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials. J. Appl. Prob. 25 (1988) 428-431
10. Chryssaphinou O., and Papastavridis S. A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials. Probab. Theory Related Fields 79 (1988) 129-143
11. Delcher A.L., Kasif S., Fleischmann R.D., Peterson J., White O., and Salzberg S.L. Alignment of whole genomes. Nucleic Acids Res. 27 11 (1999) 2369-2376
12. J. Eisen, J. Heidelberg, O. White, S.L. Salzberg, Evidence for symmetric chromosomal inversions around the replication origin in bacteria, Genome Biol. 1(6) (2000).
13. Godbole A.P. Poison approximations for runs and patterns of rare events. Adv. Appl. Probab. 23 (1991) 851-865
14. Guénoche A. Enumération des tableaux standards. Discrete. Math. 25 (1979) 257-267
15. Guénoche A., and Vitte P. Méthodes exacte et approchée pour le problème de la plus longue sous-séquence commune à p chai{dotless}̂nes de caractères. T.S.I. 14 (1995) 887-915
16. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, New York
17. Hannenhalli S., and Pevzner P.A. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversal), STOC'95. J. Assoc. Comput. Mach. 6 1 (1999) 1-27
18. D.S. Hirschberg, A linear Space Algorithm for computing maximal common subsequences, Comm. ACM 18(6) (1975).
19. Höhl M., Kurtz S., and Ohlebusch E. Efficient multiple genome alignment. Bioinformatics 18 Suppl. 1 (2002) 312-320
20. Maier D. The complexity of some problems on subsequences and supersequences. J. Assoc. Comput. Mech. 25 (1978) 322-336
21. McCreight E.M. A space-economical suffix tree construction algorithm. J. Algorithms 23 2 (1976) 262-272
22. Mural R.J. A comparison of whole-genome shotgun-derived mouse chromosome 16 and the human genome. Science 296 (2002) 1661-1671
23. Pevzner P. Computational Molecular Biology: An Algorithmic Approach (2000), The MIT Press, Cambridge
24. Pevzner P., and Tesler G. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Res. 13 (2003) 37-45
25. D. Sankoff, Edit distance for genome comparisons based on non-local operations, CPM92, Lecture Notes in Computer Science, vol. 644, 1992, pp. 121-135.
26. Schbath S. Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probab. Statist. 1 (1995) 1-16
27. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961).
28. A. Siepel, An algorithm to find all sorting reversals, in: Proceedings of RECOMB2002, 2002, pp. 281-290.
29. E. Ukkonen, Constructing suffix tree on-line in linear time, in: Proceedings of IFIP 12th World Computer Congress, 1992, pp. 484-492.
30. L.S. Wang, T. Warnow, Estimating true evolutionary distances between genomes, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), 2001, pp. 637-646.
31. P. Weiner, Linear pattern matching algorithms, in: Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 1-11.
32. Zivanovic Y., Lopez Ph., Philippe H., and Forterre P. Pyrococcus genome comparison evidences chromosome shuffling-driven evolution. Nucleic Acids Res. 30 9 (2002) 1902-1910