Abstract
We present a solution for the following problem. Given two sequences X = x 1 x 2 ... x n and Y = y 1 y 2 ...y m , n ≤ m, find the best scoring alignment of X′ = X k[i] vs Y over all possible pairs (k; i), for k = 1, 2,... and 1 ≤ i ≤ n, where X[i] is the cyclic permutation of X, X k[i] is the concatenation of k complete copies of X[i] (k tandem copies), and the alignment must include all of Y and all of X′. Our algorithm allows any alignment scoring scheme with additive gap costs and runs in time O(nm log n). We have used it to identify related tandem repeats in the C. elegans genome as part of the development of a multi-genome database of tandem repeats.
This is a preview of subscription content, log in via an institution to check access.
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
A. Apostolico, M.J. Atallah, L.L. Larmore, and S. Mcfaddin. Efficient parallel algorithms for string editing and related problems. SIAM J. Comput., 19:968–988, 1990.
G. Benson. Tandem repeats finder: a program to analyze DNA sequences. Nucleic Acids Research, 27:573–580, 1999.
V. Fischetti, G. Landau, J. Schmidt, and P. Sellers. Identifying periodic occurrences of a template with applications to a protein structure. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. 3rd annual Symp. On Combinatorial Pattern Matching, Lecture Notes in Computer Science, volume 644, pages 111–120. Springer-Verlag, 1992.
H. Fuchs, Z. Kedem, and S. Uselton. Optimal surface reconstruction from planar contours. CACM, 20:693–702, 1977.
G.M. Landau, E.W. Myers, and J.P. Schmidt. Incremental string comparison. SIAM J. Comput., 27:7–82, 1998.
V.I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl., 10:707–710, 1966.
M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73–78, 1990.
W. Miller and E. Myers. Approximate matching of regular expressions. Bulletin of Mathematical Biology, 51:5–37, 1989.
J. Schmidt. All shortest paths in weighted grid graphs and its application to finding all aproximate repeats in strings. SIAM J. Comput., 27:972–992, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benson, G. (2001). Tandem Cyclic Alignment. In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-48194-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42271-6
Online ISBN: 978-3-540-48194-2
eBook Packages: Springer Book Archive