Efficient estimation of pairwise distances between genomes

Bioinformatics

Volumn 25, Issue 24, 2009, Pages 3221-3227

  Domazet Lošo Mirjana, M ^a,b   Haubold, Bernhard ^a  

^a MAX PLANCK INSTITUTE FOR EVOLUTIONARY BIOLOGY   (Germany)

^b UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

[No Author keywords available]

Indexed keywords

ENTEROBACTERIACEAE; HUMAN IMMUNODEFICIENCY VIRUS;

ALGORITHM; ANIMAL; ARTICLE; DNA SEQUENCE; GENETIC DATABASE; GENOME; GENOMICS; HUMAN; METHODOLOGY; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT;

ALGORITHMS; ANIMALS; BASE SEQUENCE; DATABASES, GENETIC; GENOME; GENOMICS; HUMANS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 75849146491     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btp590     Document Type: Article

References (33)

1. Abouelhoda, M. et al. (2002) The enhanced suffix array and its applications to genome analysis. In Proceedings of the Second Workshop on Algorithms in Bioinformatics. Lecture Notes in Computer Science 2452. Springer, New York, pp. 449-463.
2. Aho, A.V. et al. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, MA.
3. Blaisdell, B.E. (1986) A measure of the similarity of sets of sequences not requiring sequence alignment. Proc. Natl Acad. Sci. USA, 83, 5155-5159.
4. Bonnet, E. and Van de Peer, Y. (2002) zt: a software tool for simple and partial Mantel tests. J. Stat. Softw., 7, 1-12.
5. Bray, N. and Pachter, L. (2004) MAVID: constrained ancestral alignment of multiple sequences. Genome Res., 14, 693-699.
6. Carrillo, H. and Lipman, D. (1988) The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48, 1073-1082.
7. Dewey, C. and Pachter, L. (2006) Evolution at the nucleotide level: the problem of multiple whole-genome alignment. Hum. Mol. Genet., 15, R51-R56.
8. Drosophila 12 Genomes Consortium (2007) Evolution of genes and genomes on the Drosophila phylogeny. Nature, 450, 203-218.
9. Edgar, R.C. (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
10. Felsenstein, J. (2004) Inferring Phylogenies. Sinauer, Sunderland.
11. Felsenstein, J. (1989) PHYLIP - Phylogeny Inference Package (Version 3.2). Cladistics, 5, 164-166.
12. Gusfield, D. (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge.
13. Haubold, B. and Wiehe, T. (2006a) How repetitive are genomes? BMC Bioinformatics, 7, 541.
14. Haubold, B. and Wiehe, T. (2006b) Introduction to Computational Biology: An Evolutionary Approach. Birkhäuser, Basel.
15. Haubold, B. et al. (2005) Genome comparison without alignment using shortest unique substrings. BMC Bioinformatics, 6, 123.
16. Haubold, B. et al. (2009) Estimating mutation distances from unaligned genomes. J. Comput. Biol., 16, 1487-1500.
17. Höhl, M. and Ragan, M. (2007) Is multiple-sequence alignment required for accurate inference of phylogeny? Syst. Biol., 56, 206-221.
18. Höhl, M. et al. (2006) Pattern-based phylogenetic distance estimation and tree reconstruction. Evol. Bioinform.Online, 2, 359-375.
19. Hudson, R.R. (2002) Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics, 18, 337-338.
20. Katoh, K. et al. (2005) MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Res., 33, 511-518.
21. Kumar, S. et al. (2008) MEGA: a biologist-centric software for evolutionary analysis of DNA and protein sequences. Brief. Bioinform., 9, 299-306.
22. Kurtz, S. et al. (2004)Versatile and open software forc omparing large genomes. Genome Biol., 5, R12.
23. Larkin, M. et al. (2007) Clustal w and clustal x version 2.0. Bioinformatics, 23, 2947-2948.
24. Manzini, G. and Ferragina, P. (2002) Engineering a lightweight suffix array construction algorithm. In ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms. Springer, London, pp. 698-710.
25. Rigoutsos, I. and Floratos, A. (1998) Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics, 14, 55-67.
26. Robinson, D.F. and Foulds, L.R. (1981) Comparison of phylogenetic trees. Math. Biosci., 53, 514-525.
27. Saitou, N. and Nei, M. (1987) The neighbor-joining method: a new method for reconstructing phylgenetic trees. Mol. Biol. Evol., 4, 406-425.
28. Sims, E.G. et al. (2009) Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolution. Proc. Natl Acad. Sci. USA, 106, 2677-2682.
29. Ulitsky, I. et al. (2006) The average common substring approach to phylogenomic reconstruction. J. Comput. Biol., 13, 336-350.
30. van Passel, M. et al. (2008) The emergence and fate of horizontally acquired genes in Escherichia coli. PLoS Comput. Biol., 4, e1000059.
31. Vinga, S. and Almeida, J. (2003) Alignment-free sequence comparison-a review. Bioinformatics, 19, 513-523.
32. Wang, L. and Jiang, T. (1994) On the complexity of multiple sequence alignment. J. Comput. Biol., 1, 337-348.
33. Wu, X. et al. (2007) Nucleotide composition string selection in HIV-1 subtyping using whole genomes. Bioinformatics, 23, 1744-1752.