An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem
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.
Unable to display preview. Download preview PDF.
- 1.Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Information Processing Letters 18 (1975)Google Scholar
- 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
- 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