Add to ORKGAbstract. We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are sufficient to answer LCP-queries asymptotically in the same time that is needed to retrieve an entry from the suffix array. This yields the smallest compressed suffix tree with sub-logarithmic navigation time.
The suffix array, perhaps the most important data structure in modern string processing, needs to be...
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact...
Abstract—Suffix arrays and the corresponding longest com-mon prefix (LCP) array have wide applicatio...
The suffix array, a space efficient alternative to the suffix tree, is an important data structure f...
Abstract. When augmented with the longest common prefix (LCP) array and some other structures, the s...
Suffix arrays encode the lexicographical order of all suffixes of a text and are often combined with...
Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as fol...
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ]...
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string proc...
The longest common prefix array is a very advantageous data structure that, combined with the suffix...
When augmented with the longest common prefix (LCP) array and some other structures, the suffix arra...
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string proc...
Given two positions i and j in a string T of length N, a longest common extension (LCE) query asks f...
Abstract. The longest common extension problem (LCE problem) is to construct a data structure for an...
The suffix array, perhaps the most important data structure in modern string processing, needs to be...
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact...
Abstract—Suffix arrays and the corresponding longest com-mon prefix (LCP) array have wide applicatio...
The suffix array, a space efficient alternative to the suffix tree, is an important data structure f...
Abstract. When augmented with the longest common prefix (LCP) array and some other structures, the s...
Suffix arrays encode the lexicographical order of all suffixes of a text and are often combined with...
Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as fol...
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ]...
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string proc...
The longest common prefix array is a very advantageous data structure that, combined with the suffix...
When augmented with the longest common prefix (LCP) array and some other structures, the suffix arra...
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string proc...
Given two positions i and j in a string T of length N, a longest common extension (LCE) query asks f...
Abstract. The longest common extension problem (LCE problem) is to construct a data structure for an...
The suffix array, perhaps the most important data structure in modern string processing, needs to be...
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact...
Abstract—Suffix arrays and the corresponding longest com-mon prefix (LCP) array have wide applicatio...