Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Fast parallel and serial approximate string matching
Journal of Algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
SIAM Journal on Computing
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
Quorums from difference covers
Information Processing Letters
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Approximate String Matching: A Simpler Faster Algorithm
SIAM Journal on Computing
Theoretical Computer Science
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Space efficient search for maximal repetitions
Theoretical Computer Science - Combinatorics on words
Linear work suffix array construction
Journal of the ACM (JACM)
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Searching for Gapped Palindromes
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On Space Efficient Two Dimensional Range Minimum Data Structures
Algorithmica - Special Issue: Algorithm Design and Analysis
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact data structure that supports fast LCE queries. An LCE query takes a pair (i,j) of indices in T and returns the length of the longest common prefix of the suffixes of T starting at positions i and j. We study the time-space trade-offs for the problem, that is, the space used for the data structure vs. the worst-case time for answering an LCE query. Let n be the length of T. Given a parameter @t, 1=