Alignment-free phylogenetics and population genetics

Briefings in Bioinformatics

Volumn 15, Issue 3, 2014, Pages 407-418

  Haubold, Bernhard ^a  

^a MAX PLANCK INSTITUTE FOR EVOLUTIONARY BIOLOGY   (Germany)

Author keywords

Match length; Mutation distance; Phylogenetics; Population genetics; Suffix tree

Indexed keywords

ANIMAL; BIOLOGICAL MODEL; BIOLOGY; DNA SEQUENCE; GENETIC RECOMBINATION; GENETIC SELECTION; HUMAN; MITOCHONDRIAL GENOME; MOLECULAR EVOLUTION; MUTATION; PHYLOGENY; POPULATION GENETICS; PROCEDURES; SEQUENCE ALIGNMENT; STATISTICS AND NUMERICAL DATA;

ANIMALS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; GENETICS, POPULATION; GENOME, MITOCHONDRIAL; HUMANS; MODELS, GENETIC; MUTATION; PHYLOGENY; RECOMBINATION, GENETIC; SELECTION, GENETIC; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 84900808883     PISSN: 14675463     EISSN: 14774054     Source Type: Journal    
DOI: 10.1093/bib/bbt083     Document Type: Article

References (53)

1. Zuckerkandl E, Pauling L. Molecules as documents of evolutionary history. JTheor Biol 1965;8:357-66.
2. Felsenstein J. Inferring Phylogenies. Sunderland: Sinauer, 2004.
3. Wakeley J. Coalescent Theory: An Introduction. Colorado: Roberts&Company, 2009.
4. Vinga S, Almeida J. Alignment-free sequence comparison-a review. Bioinformatics 2003;19:513-23.
5. Höhl M, Ragan M. Is multiple-sequence alignment required for accurate inference of phylogeny? Syst Biol 2007;56(2):206-21.
6. Guyon F, Brochier-armanet C, Guénoche A. Comparison of alignment free string distances for complete genome phylogeny. AdvData Anal Classif 2009;3:95-108.
7. Cheng J, Cao F, Liu Z. AGP: a multimethods web server for alignment-free genome phylogeny. Mol Biol Evol 2013;30:1032-37.
8. Yi H, Jin L. Co-phylog: an assembly-free phylogenomic approach for closely related organisms. Nucleic Acids Res 2013;41:e75.
9. Yang K, Zhang L. Performance comparison between ktuple distance and four model-based distances in phylogenetic tree reconstruction. Nucleic Acids Res 2008;36(5):e33.
10. Sims GE, Kim SH. Whole-genome phylogeny of Escherichia coli/Shigella group by feature frequency profiles (FFPs). ProcNatl Acad SciUSA 2011;108:8329-34.
11. Qi J, Wang B, Hao BI. Whole proteome prokaryote phylogeny without sequence alignment: a k-string composition approach. JMol Evol 2004;58:1-11.
12. Russell DJ, Way SF, Benson AK, Sayood K. A grammarbased distance metric enables fast and accurate clustering of large sets of 16S sequences. BMC Bioinformatics 2010;11:601.
13. Ulitsky I, Burstein D, Tuller T, Chor B. The average common substring approach to phylogenomic reconstruction. JComput Biol 2006;13:336-50.
14. Haubold B, Pfaffelhuber P, Domazet-Lošo M, Wiehe T. Estimating mutation distances from unaligned genomes. JComputBiol 2009;16:1487-500.
15. Felsenstein J. PHYLIP (phylogeny interference package) version 3.6. 2005.
16. Perrière G, Gouy M. WWW-Query: an on-line retrieval system for biological sequence banks. Biochimie 1996;78:364-9.
17. Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 1986;4:406-25.
18. Fitch WM, Margoliash E. Construction of phylogenetic trees. Science 1967;155:279-84.
19. Edgar RC. MUSCLE: multiple sequence alignment with high accuracy and high throughput. NucleicAcids Res 2004;32:1792-7.
20. Katoh K, Toh H. Recent developments in the MAFFT multiple sequence alignment program. Brief Bioinformatics 2008;9:286-98.
21. Larkin M, Blackshields G, Brown N, et al. Clustal W and Clustal X version 2.0. Bioinformatics 2007;23:2947-8.
22. Tettelin H, Masignani V, Cieslewicz M, et al. Genome analysis of multiple pathogenic isolates of Streptococcus agalactiae: implications for the microbial "pan-genome". ProcNatlAcad SciUSA 2005;102(39):13950-5.
23. Nadeau JH, SankoffD. Counting on comparative maps. TrendsGenet 1998;14:495-501.
24. Blaisdell BE. A measure of the similarity of sets of sequences not requiring sequence alignment. Proc Natl Acad Sci USA 1986;83:5155-9.
25. Reinert G, Chew D, Sun F, Waterman M. Alignment-free sequence comparison (I): statistics and power. JComputBiol 2009;16:1615-34.
26. Sims EG, Jun SR, Wu AG, Kim SH. Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolution. Proc Natl Acad Sci USA 2009;106:2677-82.
27. Jun SR, Sims GE, Wu GA, Kim SH. Whole-proteome phylogeny of prokaryotes by feature frequency profiles: an alignment-free method with optimal feature resolution. Proc Natl Acad SciUSA 2010;107:133-8.
28. Wang H, Xu Z, Gao L, Hao B. A fungal phylogeny based on 82 complete genomes using the composition vector method. BMC Evol Biol 2009;9:195.
29. Qi J, Luo H, Hao B. CVTree: a phylogenetic tree reconstruction tool based on whole genomes. Nucleic Acids Res 2004;32:W45-7.
30. Weiner P. Linear pattern matching algorithms. In: Proceedings of the 14th Annual Symposium on Switching and AutomataTheory (swat 1973). Washington, DC, USA: IEEE Computer Society SWAT'73, 1973;1-11.
31. Gusfield D. Algorithms on Strings, Trees, and Sequences:Computer Science and Computational Biology. Cambridge: Cambridge University Press, 1973.
32. Cormen TH, Leiserson CE, Rivest RL, Stein CS. Introduction to Algorithms. Cambridge, MA: The MIT Press, 2009.
33. Kurtz S, Phillippy A, Delcher A, et al. Versatile and open software for comparing large genomes. Genome Biol 2004;5(2):R12.
34. Manber U, Myers EW. Suffix arrays: a new method for online string searches. SIAMJComput 1993;22:935-48.
35. Puglisi SJ, Smyth WF, Turpin AH. A taxonomy of suffix array construction algorithms. ACMComputSurv, 2007;39:4.
36. Nong G. Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACMTrans Inf Syst 2013;31:1-15.
37. Kasai T, Lee G, Arimura H, et al. Linear-time longestcommon-prefix computation in suffix arrays and its applications. LNCS 2001;2089:181-92.
38. Abouelhoda M, Kurtz S, Ohlebusch E. 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, 2002, pp. 449-63. Springer-Verlag.
39. Ferragina P, Manzini G. Opportunistic data structures with applications. In: Proceedings of the 41st Symposiumon Foundation of Computer Science (FOCS 2000). IEEE Computer Society, 2000;390-98.
40. Ferragina P, González R, Navarro G. Compressed text indexes: from theory to practice. ACM J Exp Algorithmics 2008. 13, 1.12:1-31.
41. Langmead B, Trapnell C, Pop M, Salzberg SL. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol 2009;10:R25.
42. Li H., Durbin R. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 2009;25:1754-60.
43. Otu HH, Sayood K. A new sequence distance measure for phylogenetic tree construction. Bioinformatics 2003;19:2122-30.
44. Haubold B, PierstorffN, Möller F, Wiehe T. Genome comparison without alignment using shortest unique substrings. BMC Bioinformatics 2005;6:123.
45. Domazet-Lošo M, Haubold B. Efficient estimation of pairwise distances between genomes. Bioinformatics 2009;25:3221-7.
46. Drosophila 12 Genomes Consortium. Evolution of genes and genomes on the Drosophila phylogeny. Nature 2007;450:203-18.
47. Haubold B, Reed FA, Pfaffelhuber P. Alignment-free estimation of nucleotide diversity. Bioinformatics 2011;27:449-55.
48. Haubold B, Pfaffelhuber P. Alignment-free population genomics: an efficient estimator of sequence diversity. Genes Genomes Genetics 2012;2:883-9.
49. Hudson RR. Gene genealogies and the coalescent process. Oxford Surveys Evol Biol 1990;7:1-44.
50. Haubold B, Krause L, Horn T, Pfaffelhuber P. An alignment-free test for recombination. Bioinformatics. doi:10.1093/bioinformatics/btt550 (Advance Access publication 12 October 2013).
51. Lynch M. The Origins of Genome Architecture. Sunderland: Sinauer, 2007.
52. Maynard Smith J, Haigh J. The hitch-hiking effect of a favourable gene. Genet Res Cambridge 1974;23:23-35.
53. Stephan W. Genetic hitchhiking versus background selection: the controversy and its implications. PhilosTrans RSoc Lond B 2010;365:1245-53