Linear time algorithm for the longest common repeat problem

Authors:
Inbok Lee;Costas S. Iliopoulos;Kunsoo Park
Affiliations:
School of Computer Science & Engineering, Seoul National University, Seoul, Republic of Korea and Department of Computer Science, King's College London, London, United Kingdom;Department of Computer Science, King's College London, London, United Kingdom;School of Computer Science & Engineering, Seoul National University, Seoul, Republic of Korea
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 11
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

SIAM Journal on Computing
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Color Set Size Problem with Application to String Matching

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Verbumculus and the discovery of unusual words

Journal of Computer Science and Technology - Special issue on bioinformatics

Quantified Score

Hi-index	0.01

Visualization

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.