Abstract
Given a set of strings U={T 1, T 2, ... ,T ℓ}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem.
Work supported by IMT 2000 Project AB02.
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.
Similar content being viewed by others
References
Apostolico, A., Gong, F., Lonardi, S.: Verbumculus and the discovery of unusual words. Journal of Computer Science and Technology 19(1), 22–41 (2003)
Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the Fourth Latin American Symposium, pp. 88–94 (2000)
Falquet, L., Pagini, M., Bucher, P., Hulo, N., Sigrist, C.J., Hofmann, K., Bairoch, A.: The PROSITE database, its status in 2002. Nucleic Acids Research 30, 235–238 (2002)
Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM 47(6), 987–1011 (2000)
Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. SIAM Journal on Computing 13(2), 338–355 (1984)
Hui, L.C.K.: Color set size problem with applications to string matching. In: Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching, pp. 230–243. Springer, Berlin (1992)
Karp, R.M., Miller, R.E., Rosenberg, A.L.: Rapid identification of repeated patterns in strings, trees and arrays. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pp. 125–136 (1972)
Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: Proceedings of the Fourth Combinatorial Pattern Matching, pp. 120–133 (1993)
McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262–272 (1976)
Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing 17, 1253–1262 (1988)
Schmidt, J.P.: All highest scoring paths in weighted grid graphs and its application to finding all approximate repeats in strings. SIAM Journal on Computing 27(4), 972–992 (1998)
Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, I., Iliopoulos, C.S., Park, K. (2004). Linear Time Algorithm for the Longest Common Repeat Problem. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive