Alignment-free genetic sequence comparisons: A review of recent approaches by word analysis

Briefings in Bioinformatics

Volumn 15, Issue 6, 2013, Pages 890-905

  Bonham Carter, Oliver ^a   Steele, Joe ^a   Bastola, Dhundy ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

Alignment free; Information theory; Sequence alignment; Word analysis

Indexed keywords

ALGORITHM; ANIMAL; BIOLOGY; COMPARATIVE STUDY; DNA SEQUENCE; INFORMATION SCIENCE; PHYLOGEOGRAPHY; PROCEDURES; SEQUENCE ALIGNMENT; STATISTICS AND NUMERICAL DATA;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; INFORMATION THEORY; PHYLOGEOGRAPHY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 84913590574     PISSN: 14675463     EISSN: 14774054     Source Type: Journal    
DOI: 10.1093/bib/bbt052     Document Type: Article

References (73)

1. Gusfield D. Algorithms On Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997.
2. Knuth DE, Morris JH, Pratt VR. Fast pattern matching in strings. SIAMJ Comput 1977;6:323-50.
3. Boyer RS, Moore SJ. A fast string searching algorithm. Commun ACM 1977;20:762-72.
4. Horspool RN. Practical fast searching in strings. Softw Pract Exp 1980;10:501-6.
5. Apostolico A, Giancarlo R. The boyer moore galil string searching strategies revisited. SiamJComput 1986;15:98-105.
6. Ukkonen E. Finding approximate patterns in strings. JAlgor 1985;6:132-7.
7. Navarro G. A guided tour to approximate string matching. JACMComp Surv 2001;33:31-88.
8. Cheng L-L, Cheung DW, Yiu S-M. Approximate string matching in DNA sequences. In: Procceedings of the Eighth International Conference on Database Systems for Advance Applications, 2003. pp. 303-10. http://dx.doi.org/10. 1109/DASFAA.2003.1192395.
9. Koonin E. The emerging paradigm and open problems in comparative genomics. Bioinformatics 1999;15:265-66.
10. Wooley J. Trends in computational biology: a summary based on a RECOMB plenary lecture. JComput Biol 1999; 6:459-74.
11. Li H, Homer N. A survey of sequence alignment algorithms for next-generation sequencing. Brief Bioinform 2010;11: 473-83.
12. Liao B-Y, Chang Y-J, Ho J-M, et al. The unimarker (um) method for synteny mapping of large genomes. Bioinformatics 2004;20:3156-65.
13. Domazet-Lošo M, Haubold B. Alignment-free detection of horizontal gene transfer between closely related bacterial genomes. Mob Genet Elements 2011;1:230-5.
14. Berkman PJ, Skarshewski A, Manoli S, et al. Sequencing wheat chromosome arm 7BS delimits the 7BS/4AL translocation and reveals homoeologous gene conservation. TheorAppl Genet 2012;124:423-32.
15. Crameri A, Raillard S-A, Bermudez E, et al. DNA shuffling of a family of genes from diverse species accelerates directed evolution. Nature 1998;391:288-91.
16. Orobitg M, Cores F, Guirado F, et al. Enhancing the scalability of consistency-based progressive multiple sequences alignment applications. In: Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International, 2012; pp. 71-82.
17. Eddy SR. What is dynamic programming? Nat Biotechnol 2004;22:909-10.
18. Smith T, Waterman M. Identification of common molecular subsequences. JMol Biol 1981;147:195-7.
19. Needleman S, Wunsch C. A general method applicable to the search for similarities in the amino acid sequence of two proteins. JMol Biol 1970;48:443-53.
20. Larkin M, Blackshields G, Brown N, et al. Clustalw and clustalx version 2. Bioinformatics 2007;23:2947-8.
21. Altschul SF, Madden TL, Schäffer AA, et al. Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Res 1997;25:3389-402.
22. Chen C, Rajapakse JC. Grid-enabled blastz: application to comparative genomics. JVLSI Signal Process Syst Signal Image VideoTechnol 2007;48:301-9.
23. Kent WJ. Blatthe blast-like alignment tool. Genome Res 2002;12:656-64.
24. Schadt EE, Linderman MD, Sorenson J, et al. Computational solutions to large-scale data management and analysis. Nat Rev Genet 2010;11:647-57.
25. Chenna R, Sugawara H, Koike T, et al. Multiple sequence alignment with the clustal series of programs. Nucleic Acids Res 2003;31:3497-500.
26. Katoh K, Toh H. Parallelization of the mafft multiple sequence alignment program. Bioinformatics 2010;26: 1899-900.
27. Hara Y, Imanishi T. Abundance of ultramicro inversions within local alignments between human and chimpanzee genomes. BMC Evol Biol 2011;11:308.
28. Vinga S, Almeida J. Alignment-free sequence comparison-a review. Bioinformatics 2003;19:513-23.
29. Mantaci S, Restivo A, Sciortino M. Distance measures for biological sequences: some recent approaches. Int J Approx Reason 2008;47:109-24.
30. Liu Z, Meng J, Sun X. A novel feature-based method for whole genome phylogenetic analysis without alignment: application to HEV genotyping and subtyping. Biochem Biophys Res Commun 2008;223:223-30.
31. Chan RH, Chan TH, Yeung HM, et al. Composition vector method based on maximum entropy principle for sequence comparison. IEEE/ACM Trans Comput Biol Bioinform, 2011. Mar 3.
32. Lu G, Zhang S, Fang X. An improved string composition method for sequence comparison. BMC Bioinform 2008;9: S15.
33. Cao MD, Dix TI, Allison L, et al. A simple statistical algorithm for biological sequence compression. In: Data CompressionConference, 2007. pp. 43-52.
34. Out HH, Sayood K. A new sequence distance measure for phylogenetic tree construction. Bioinformatics 2003;19: 2111-30.
35. Ulitsky I, Burstein D, Tuller T, et al. The average common substring approach to phylogenomic reconstruction. JComp Bio 2006;13:226-50.
36. Domazet-Lošo M, Haubold B. Alignment-free detection of local similarity among viral and bacterial genomes. Bioinformatics 2011;27:1466-72.
37. Shannon C. The mathematical theory of communication. Bell SystTechJ 1948;27:379-429.
38. Kim I, Watada J, Pedrycz W, et al. Pattern clustering with statistical methods using a DNA-based algorithm. IEEE TransNanobioscience 2012;11:100-10.
39. Wang J-D. A comparison study of virus classification by genome sequences. In: Bioinformatics and Bioengineering (BIBE), 2011 IEEE 11th International Conference, 2011. pp. 270-3.
40. Zhang L, Meng J, Liu H, et al. Clustering DNA methylation expressions using nonparametric beta mixture model. In: Genomic Signal Processing and Statistics (GENSIPS), 2011 IEEE International Workshop, 2011. pp. 170-3.
41. Wu T-J, Huang Y-H, Li L-A. Optimal word sizes for dissimilarity measures and estimation of the degree of dissimilarity between DNA sequences. Bioinformatics 2005; 21:4125-32.
42. Dai Q, Li L, Liu X, et al. Integrating overlapping structures and background information of words significantly improves biological sequence comparison. PLoS One 2011;6: e26779.
43. Arnau V, Gallach M, Marín I. Fast comparison of DNA sequences by oligonucleotide profiling. BMC Res Notes 2008;1:5.
44. Sims GE, Jun SR, Kim SH. Alignment-free genome comparison with feature frequency profiles (ffp) and optimal resolutions. Proc Natl Acad Sci USA 2008;106:2677-82.
45. Lin J. Divergence measures based on the shannon entropy. IEEETrans InfTheory 1991;37:145-51.
46. Prasad AB, Allard MW, Green ED. Confirming the phylogeny of mammals by use of large comparative sequence data sets. Mol Biol Evol 2008;25:1795-808.
47. Soares I, Goios A, Amorim A. Sequence comparison alignment- free approach based on suffix tree and l-words frequency. SciWorldJ 2012;2012:450124.
48. Hao B, Qi J, Wang B. Prokaryotic phylogeny based on complete genomes without sequence alignment. Mod Phys Lett B 2003;2:1-4.
49. Qi J, Wang B, Hao B-I. Whole proteome prokaryote phylogeny without sequence alignment: a k-string composition approach. JMol Evol 2004;58:1-11.
50. Wu X, Wan X, Wu G, et al. Phylogenetic analysis using complete signature information of whole genomes and clustered neighbour-joining method. Int J Bioinform Res Appl, 2006;2:219-48.
51. Brendel V, Beckmann JS, Trifonov EN. Linguistics of nucleotide sequences: morphology and comparison of vocabularies. J Biomol StructDyn 1986;4:11-21.
52. Hao B, Qi J. Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance. J Bioinform Comput Biol 2004;2:1-19.
53. Gentleman J, Mullin R. The distribution of the frequency of occurrence of nucleotide subsequences, based on their overlap capability. Biometrics 1989;45:35-52.
54. Hua R, Wanga B. Statistically significant strings are related to regulatory elements in the promoter regions of saccharomyces cerevisiae. Physica A 2001;290:464-74.
55. Yu Z-G, Zhou L-Q, Anh VV, et al. Phylogeny of prokaryotes and chloroplasts revealed by a simple composition approach on all protein sequences from complete genomes without sequence alignment. J Mol Evol 2005;60: 538-45.
56. Forêt S, Wilson SR, Burden CJ. Characterizing the d2 statistic: word matches in biological sequences. Stat Appl Genet Mol Biol 2009;8:1-21.
57. Waterman M. Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman and Hall, 1995.
58. Forêt S, Kantorovitz M, Burden CJ. Asymptotic behavior of k-word matches between two uniformly distributed sequences. BMC Bioinform 2006;7:S21.
59. Lippert R, Huang H, Waterman M. Distributional regimes for the number of k-word matches between two random sequences. Proc Natl Acad Sci USA 2002;99:13980-9.
60. Reinert G, Chew D, Sun F, et al. Alignment-free sequence comparison (i): Statistics and power. JComput Biol 2009;16: 1615-34.
61. Kantorovitz MR, Robinson GE, Sinha S. A statistical method for alignment-free comparison of regulatory sequences. Bioinformatics 2007;23:i249-55.
62. Wan L, Reinert G, Sun F, et al. Alignment-free sequence comparison (ii): theoretical power of comparison statistics. JComputBiol 2010;17:1467-90.
63. Song K, Ren J, Zhai Z, et al. Alignment-free sequence comparison based on next generation sequencing reads. In: Research in Computational Molecular Biology. Springer, 2012. pp. 272-85.
64. Liu X, Wan L, Li J, et al. New powerful statistics for alignment- free sequence comparison under a pattern transfer model. JTheor Biol 2011;284:106-16.
65. Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEETrans InfTheory 1977;23:337-43.
66. Mohammed MH, Dutta A, Bose T, et al. Deliminate-a fast and efficient method for loss-less compression of genomic sequences. Bioinformatics 2012;28:2527-9.
67. Cox AJ, Bauer MJ, Jakobi T, et al. Large-scale compression of genomic sequence databases with the burrows-wheeler transform. Bioinformatics 2012;28:1415-9.
68. Kozanitis C, Saunders C, Kruglyak S, et al. Compressing genomic sequence fragments using slimgene. J Comput Biol 2011;18:401-13.
69. Bonham-Carter O, Ali H, Bastola D. A meta-genome sequencing and assembly preprocessing algorithm inspired by restriction site base composition. In: Bioinformatics and Biomedicine Workshops (BIBMW), 2012 IEEE International Conference on IEEE, 2012. pp. 696-703.
70. Bonham-Carter O, Ali H, Bastola DK. A meta-genome sequencing and assembly preprocessing algorithm inspired by restriction site base composition. BMC Bioinformatics 2013.
71. Bonham-Carter O, Najjar L, Thapa I, et al. Distributions of palindromic proportional content in bacteria. Short Paper. In: The 8th International Symposium on Bioinformatics Research and Applications (ISBRA 2012), Dallas, TX, 2012.
72. Syvanen M. Evolutionary implications of horizontal gene transfer. AnnuRev Genet 2012;46:341-58.
73. Moreno-Letelier A, Olmedo G, Eguiarte LE, et al. "Parallel evolution and horizontal gene transfer of the pst operon in firmicutes from oligotrophic environments. Int J Evol Biol. vol. 2011;2011.