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 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
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Construction of aho corasick automaton in linear time for integer alphabets
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A Simple Algorithm for Finding Exact Common Repeats
IEICE - Transactions on Information and Systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
| Hi-index | 0.00 |
Given a set of strings $\mathcal{U} = \{T_{1}, T_{2}, . . . , T_{\ell}\}$, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of $\mathcal{U}$, considering direct, inverted, mirror as well as everted repeats. In this paper we define the generalised longest common repeat problem, where we can set the number of times that a repeat should appear in each string. We present a linear time algorithm for this problem using the suffix array. We also show an application of our algorithm for finding a longest common substring which appears only in a subset $\mathcal{U}^{\prime}$ of $\mathcal{U}$ but not in $\mathcal{U}$-$\mathcal{U}^{\prime}$.