Advertisement

An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem

  • Adrian Kosowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3246)

Abstract

The paper deals with the problem of finding a tandem scattered subsequence of maximum length (LTS) for a given character sequence. A sequence is referred to as tandem if it can be split into two identical sequences. An efficient algorithm for the LTS problem is presented and is shown to have O(n 2) computational complexity and linear memory complexity with respect to the length n of the analysed sequence. A conjecture is put forward and discussed, stating that the complexity of the given algorithm may not be easily improved. Finally, the potential application of the solution to the LTS problem in approximate tandem substring matching in DNA sequences is discussed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Information Processing Letters 18 (1975)Google Scholar
  2. 2.
    Kannan, S.K., Myers, E.W.: An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score. SIAM Journal of Computing 25, 648–662 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Kolpakov, R.M., Kucherov, G.: Finding Maximal Repetitions in a Word in Linear Time. In: Symposium on Foundations of Computer Science FOCS 1999, New-York, pp. 596–604 (1999)Google Scholar
  4. 4.
    Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theoretical Computer Science 303, 135–156 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, vol. 684, pp. 120–133 (1993)Google Scholar
  6. 6.
    Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys. Dokl 10, 707–710 (1966)MathSciNetGoogle Scholar
  7. 7.
    Main, M.G., Lorentz, R.J.: An O(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms 5, 422–432 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal of Computing 27, 972–992 (1998)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Adrian Kosowski
    • 1
  1. 1.Department of Algorithms and System ModelingGdańsk University of TechnologyPoland

Personalised recommendations