Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952359 | Theoretical Computer Science | 2016 | 14 Pages |
Abstract
The suffix array is frequently augmented with the longest-common-prefix (LCP) array that stores the lengths of the longest common prefixes between lexicographically adjacent suffixes of a text. While the sum of the values in the LCP array can be Ω(n2) for a text of length n, the sum of so-called irreducible LCP values was shown to be O(nlgâ¡n) a few years ago. In this paper, we improve the bound to O(nlgâ¡r), where râ¤n is the number of runs in the Burrows-Wheeler transform of the text. We also show that our bound is tight up to lower order terms (unlike the previous bound). Our results and the techniques used in proving them provide new insights into the combinatorics of text indexing and compression, and have immediate applications to LCP array construction algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Juha Kärkkäinen, Dominik Kempa, Marcin Pia̧tkowski,