Abstract
Alignment free sequence comparison methods are attracting persistent interest, driven by data-intensive applications in genome-wide molecular taxonomy and phylogentic reconstruction. Among the methods based on substring composition, the Average Common Substring (\(\mathsf {ACS}\)) measure proposed by Burstein et al. (RECOMB 2005) admits a straightforward linear time sequence comparison algorithm, while yielding impressive results in multiple applications. An important direction of research is to extend the approach to permit a bounded edit/hamming distance between substrings, so as to reflect more accurately the evolutionary process. To date, however, algorithms designed to incorporate \(k \ge 1\) mismatches have \(O(kn^2)\) worst-case complexity, worse than the \(O(n^2)\) alignment algorithms they are meant to replace. On the other hand, accounting for mismatches does show to lead to much improved classification, while heuristics can improve practical performance. In this paper, we close the gap by presenting the first provably efficient algorithm for the \(k\) -mismatch average common string (\(\mathsf {ACS}_k\)) problem that takes \(O(n)\) space and \(O(n\log ^{k+1} n)\) time in the worst case for any constant \(k\). Our method extends the generalized suffix tree model to incorporate a carefully selected bounded set of perturbed suffixes, and can be applicable to other complex approximate sequence matching problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolico, A., Giancarlo, R.: Sequence alignment in molecular biology. Journal of Computational Biology 5(2), 173–196 (1998)
Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with bounded hamming distance. In: DCC, pp. 183–192. IEEE (2014)
Asai, T., Zaporojets, D., Squires, C., Squires, C.L.: An escherichia coli strain with all chromosomal rRNA operons inactivated: complete exchange of rRNA genes between bacteria. National Academy of Sciences 96(5), 1971–1976 (1999)
Bonham-Carter, O., Steele, J., Bastola, D.: Alignment-free genetic sequence comparisons: a review of recent approaches by word analysis. Briefings in Bioinformatics 890–905 (2013)
Burstein, D., Ulitsky, I., Tuller, T., Chor, B.: Information theoretic approaches to whole genome phylogenies. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 283–295. Springer, Heidelberg (2005)
Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: STOC, pp. 91–100 (2004)
Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM 47(6), 987–1011 (2000)
Fitch, W.M., Margoliash, E., et al.: Construction of phylogenetic trees. Science 155(760), 279–284 (1967)
Flouri, T., Giaquinta, E., Kobert, K., Ukkonen, E.: Longest common substrings with k mismatches. arXiv preprint (2014). arXiv:1409.1694
Grabowski, S.: A note on the longest common substring with \( k \)-mismatches problem. arXiv preprint (2014). arXiv:1409.7217
Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. University Press, Cambridge (1997)
Haubold, B.: Alignment-free phylogenetics and population genetics. Briefings in Bioinformatics 15(3), 407–418 (2014)
Horwege, S., Lindner, S., Boden, M., Hatje, K., Kollmar, M., Leimeister, C.-A., Morgenstern, B.: Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Research (2014)
Leimeister, C.-A., Morgenstern, B.: kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics (2014)
McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262–272 (1976)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC, pp. 114–122 (1981)
Song, K., Ren, J., Reinert, G., Deng, M., Waterman, M.S., Sun, F.: New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing. Briefings in Bioinformatics (2013)
Ulitsky, I., Burstein, D., Tuller, T., Chor, B.: The average common substring approach to phylogenomic reconstruction. Journal of Computational Biology 13(2), 336–350 (2006)
Vinga, S., Almeida, J.: Alignment-free sequence comparison - qa review. Bioinformatics 19(4), 513–523 (2003)
Weiner, P.: Linear pattern matching algorithms. In: Switching and Automata Theory, pp. 1–11 (1973)
Zuckerkandl, E., Pauling, L.: Molecules as documents of evolutionary history. Journal of Theoretical Biology 8(2), 357–366 (1965)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Aluru, S., Apostolico, A., Thankachan, S.V. (2015). Efficient Alignment Free Sequence Comparison with Bounded Mismatches. In: Przytycka, T. (eds) Research in Computational Molecular Biology. RECOMB 2015. Lecture Notes in Computer Science(), vol 9029. Springer, Cham. https://doi.org/10.1007/978-3-319-16706-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-16706-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16705-3
Online ISBN: 978-3-319-16706-0
eBook Packages: Computer ScienceComputer Science (R0)