Fast alignment-free sequence comparison using spaced-word frequencies

Bioinformatics

Volumn 30, Issue 14, 2014, Pages 1991-1999

  Leimeister, Chris Andre ^a   Boden, Marcus ^a   Horwege, Sebastian ^a   Lindner, Sebastian ^a   Morgenstern, Burkhard ^a,b  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; DNA SEQUENCE; GENOMICS; METHODOLOGY; MITOCHONDRIAL GENOME; PHYLOGENY; PLANT GENOME; PRIMATE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

ALGORITHMS; ANIMALS; GENOME, MITOCHONDRIAL; GENOME, PLANT; GENOMICS; PHYLOGENY; PRIMATES; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE ANALYSIS, PROTEIN;

EID: 84904013371     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu177     Document Type: Article

References (52)

1. Altschul, S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Blackshields, G. et al. (2010) Sequence embedding for fast construction of guide trees for multiple sequence alignment. Algorithms Mol. Biol., 5, 21.
3. Boden, M. et al. (2013) Alignment-free sequence comparison with spaced k-mers. In: German Conference on Bioinformatics 2013. Volume 34 of OpenAccess Series in Informatics (OASIcs). pp. 24-34.
4. Brown, D.G. (2008) A survey of seeding for sequence alignment. In: Mǎndoiu, I. and Zelikovsky, A. (eds) Bioinformatics Algorithms: Techniques and Applications. Wiley-Interscience, New York, pp. 126-152.
5. Chor, B. et al. (2009) Genomic DNA k-mer spectra: models and modalities. Genome Biol., 10, R108.
6. Cohen, J.D. (1997) Recursive hashing functions for n-grams. ACM Trans. Inf. Syst., 15, 291-320.
7. Comin, M. and Verzotto, D. (2012) Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms Mol. Biol., 7, 34.
8. Corel, E. et al. (2010) MS4-multi-scale selector of sequence signatures: an alignment-free method for classification of biological sequences. BMC Bioinformatics, 11, 406.
9. Darling, A.E. et al. (2010) progressive Mauve: multiple genome alignment with gene gain, loss and rearrangement. PLoS One, 5, e11147.
10. Dayhoff, M. et al. (1978) A model of evolutionary change in proteins. Atlas Protein Seq. Struct., 6, 345-362.
11. st. Theor. Comp. Sci., 215, 31-49.
12. Didier, G. et al. (2007) Comparing sequences without using alignments: application to HIV/SIV subtyping. BMC Bioinformatics, 8, 1.
13. Didier, G. et al. (2012) Variable length local decoding and alignment-free sequence comparison. Theor. Comput. Sci., 462, 1-11.
14. Ebersberger, I. et al. (2009) HaMStR: profile hidden markov model based search for orthologs in ESTs. BMC Evol. Biol., 9, 157.
15. Edgar, R.C. (2004) MUSCLE: Multiple sequence alignment with high score accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
16. Felsenstein, J. (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol., 17, 368-376.
17. Felsenstein, J. (1989) PHYLIP-Phylogeny Inference Package (Version 3.2). Cladistics, 5, 164-166.
18. Felsenstein, J. (2003) Inferring Phylogenies. Sinauer Associates, Sunderland, MA.
19. Göke, J. et al. (2012) Estimation of pairwise sequence similarity of mammalian enhancers with word neighbourhood counts. Bioinformatics, 28, 656-663.
20. Hatje, K. and Kollmar, M. (2012) A phylogenetic analysis of the brassicales clade based on an alignment-free sequence comparison method. Front. Plant Sci., 3, 192.
21. Haubold, B. et al. (2005) Genome comparison without alignment using shortest unique substrings. BMC Bioinformatics, 6, 123.
22. Haubold, B. et al. (2009) Estimating mutation distances from unaligned genomes. J. Comput. Biol., 16, 1487-1500.
23. Hauser, M. et al. (2013) kClust: fast and sensitive clustering of large protein sequence databases. BMC Bioinformatics, 14, 248.
24. Höhl, M. et al. (2006) Pattern-based phylogenetic distance estimation and tree reconstruction. Evol. Bioinform. Online, 2, 359-375.
25. Horwege, S. et al. (2014) Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Res., doi: 10.1093/nar/gku398.
26. Karp, R.M. and Rabin, M.O. (1987) Efficient randomized pattern-matching algorithms. IBM J. Res. Dev., 31, 249-260.
27. Katoh, K. et al. (2002) MAFFT: a novel method for rapid multiple sequence alignment based on fast fourier transform. Nucleic Acids Res., 30, 3059-3066.
28. Keich, U. et al. (2004) On spaced seeds for similarity search. Discrete Appl. Math., 138, 253-263.
29. Kolekar, P. et al. (2012) Alignment-free distance measure based on return time distribution for sequence analysis: applications to clustering, molecular phylogeny and subtyping. Mol. Phylogenet. Evol., 65, 510-522.
30. Kullback, S. (1987) The kullbackleibler distance. Am. Stat., 41, 340-341.
31. Leimeister, C.-A. and Morgenstern, B. (2014) kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics, 30, 2000-2008.
32. Li, M. et al. (2003) PatternHunter II: highly sensitive and fast homology search. Genome Inform., 14, 164-175.
33. Lin, J. (1991) Divergence measures based on the shannon entropy. IEEE Trans. Inf. Theory, 37, 145-151.
34. Lingner, T. and Meinicke, P. (2006) Remote homology detection based on oligomer distances. Bioinformatics, 22, 2224-2231.
35. Ma, B. et al. (2002) PatternHunter: faster and more sensitive homology search. Bioinformatics, 18, 440-445.
36. Morgenstern, B. (2002) A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Appl. Math. Lett., 15, 11-16.
37. Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
38. Robin, S. et al. (2005) DNA, Words and Models: Statistics of Exceptional Words. Cambridge University Press, Cambridge, UK.
39. Robinson, D. and Foulds, L. (1981) Comparison of phylogenetic trees. Math. Biosci., 53, 131-147.
40. Saitou, N. and Nei, M. (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4, 406-425.
41. Schreiber, F. et al. (2009) Orthoselect: a protocol for selecting orthologous groups in phylogenomics. BMC Bioinformatics, 10, 219.
42. Sievers, F. et al. (2011) Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Mol. Syst. Biol., 7, 539.
43. Sims, G.E. et al. (2009) Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions. Proc. Natl Acad. Sci. USA, 106, 2677-2682.
44. Sokal, R.R. and Michener, C.D. (1958)A Statistical Method for Evaluating Systematic Relationships. University of Kansas Science Bulletin, 38, 1409-1438.
45. Song, K. et al. (2013) Alignment-free sequence comparison based on next generation sequencing reads. J. Comput. Biol, 20, 64-79.
46. Stoye, J. et al. (1998) Rose: generating sequence families. Bioinformatics, 14, 157-163.
47. Thompson, J.D. et al. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
48. Thompson, J.D. et al. (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins, 61, 127-136.
49. Ulitsky, I. et al. (2006) The average common substring approach to phylogenomic reconstruction. J. Comput. Biol., 13, 336-350.
50. Uzgalis, R. (1996) Hashing concepts and the java programming language. In: Technical report. University of Auckland.
51. Vinga, S. and Almeida, J. (2003) Alignment-free sequence comparison-a review. Bioinformatics, 19, 513-523.
52. Vinga, S. et al. (2012) Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms Mol. Biol., 7, 10.