The Enhanced Suffix Array and Its Applications to Genome Analysis
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
An Algorithm for Approximate Tandem Repeats
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
A fast algorithm for the generalized k-keyword proximity problem given keyword offsets
Information Processing Letters
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Linear time algorithm for the generalised longest common repeat problem
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
Given a set of strings U = {T1, T2,...,Tℓ}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string, considering direct, inverted, and mirror repeats. We define the generalised longest common repeat problem and present a linear time solution.