Advertisement

Periodic String Comparison

  • Alexander Tiskin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5577)

Abstract

In our previous work, we introduced the concept of semilocal string comparison, and developed for it an efficient method called the seaweed algorithm. In the current paper, we introduce its extension, called the periodic seaweed algorithm. The new algorithm allows efficient exploitation of the periodic structure in one of the input strings. By application of the periodic seaweed algorithm, we obtain new algorithms for the tandem LCS problem and the tandem cyclic alignment problem, improving on existing algorithms in running time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alves, C.E.R., Cáceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Discrete Applied Mathematics 156(7), 1025–1035 (2008)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Benson, G.: Tandem cyclic alignment. Discrete Applied Mathematics 146(2), 124–133 (2005)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Crochemore, M., Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Re-use dynamic programming for sequence alignment: An algorithmic toolkit. In: String Algorithmics. Texts in Algorithmics, vol. 2. College Publications, King’s (2004)Google Scholar
  4. 4.
    Fischetti, V.A., Landau, G.M., Sellers, P.H., Schmidt, J.P.: Identifying periodic occurrences of a template with applications to protein structure. Information Processing Letters 45(1), 11–18 (1993)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Jackson, B.N., Aluru, S.: Pairwise sequence alignment. In: Handbook of Computational Molecular Biology. Chapman and Hall/CRC Computer and Information Science Series, ch. 1, pp. 1–1 – 1–31. Chapman and Hall/CRC, Boca Raton (2006)Google Scholar
  6. 6.
    Landau, G.: Can DIST tables be merged in linear time? An open problem. In: Proceedings of the Prague Stringology Conference, p. 1. Czech Technical University in Prague (2006)Google Scholar
  7. 7.
    Landau, G.M., Myers, E., Ziv-Ukelson, M.: Two algorithms for LCS consecutive suffix alignment. Journal of Computer and System Sciences 73(7), 1095–1117 (2007)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. Journal of Algorithms 41(2), 338–359 (2001)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20, 18–31 (1980)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Myers, E.W., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology 51(1), 5–37 (1989)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48(3), 443–453 (1970)CrossRefGoogle Scholar
  12. 12.
    Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing 27(4), 972–992 (1998)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Sellers, P.H.: The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms 1(4), 359–373 (1980)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Tiskin, A.: Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms 6(4), 570–581 (2008)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science 1(4), 571–603 (2008)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Technical Report 0707.3619, arXiv (2009)Google Scholar
  17. 17.
    Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM 21(1), 168–173 (1974)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alexander Tiskin
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations