Efficient Alignment Free Sequence Comparison with Bounded Mismatches

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9029)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apostolico, A., Giancarlo, R.: Sequence alignment in molecular biology. Journal of Computational Biology 5(2), 173–196 (1998)CrossRefGoogle Scholar
  2. 2.
    Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with bounded hamming distance. In: DCC, pp. 183–192. IEEE (2014)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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) CrossRefGoogle Scholar
  6. 6.
    Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: STOC, pp. 91–100 (2004)Google Scholar
  7. 7.
    Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM 47(6), 987–1011 (2000)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Fitch, W.M., Margoliash, E., et al.: Construction of phylogenetic trees. Science 155(760), 279–284 (1967)CrossRefGoogle Scholar
  9. 9.
    Flouri, T., Giaquinta, E., Kobert, K., Ukkonen, E.: Longest common substrings with k mismatches. arXiv preprint (2014). arXiv:1409.1694
  10. 10.
    Grabowski, S.: A note on the longest common substring with \( k \)-mismatches problem. arXiv preprint (2014). arXiv:1409.7217
  11. 11.
    Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. University Press, Cambridge (1997)CrossRefMATHGoogle Scholar
  12. 12.
    Haubold, B.: Alignment-free phylogenetics and population genetics. Briefings in Bioinformatics 15(3), 407–418 (2014)CrossRefGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Leimeister, C.-A., Morgenstern, B.: kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics (2014)Google Scholar
  15. 15.
    McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262–272 (1976)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC, pp. 114–122 (1981)Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Vinga, S., Almeida, J.: Alignment-free sequence comparison - qa review. Bioinformatics 19(4), 513–523 (2003)CrossRefGoogle Scholar
  20. 20.
    Weiner, P.: Linear pattern matching algorithms. In: Switching and Automata Theory, pp. 1–11 (1973)Google Scholar
  21. 21.
    Zuckerkandl, E., Pauling, L.: Molecules as documents of evolutionary history. Journal of Theoretical Biology 8(2), 357–366 (1965)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Computational Science and EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations