Tag
lcp-array
- Mar 25, 2026 From Suffix Trie to Suffix Array: Implicit Nodes and Intervals A suffix trie over a text is quadratic in nodes; a suffix tree keeps only branching positions; a suffix array replaces the nodes with sorted offsets plus an LCP array. What is gained and lost at each step. data structures
- Oct 4, 2024 Suffix Arrays, Prefix Doubling, and the Kasai LCP Scan How sorting all suffixes of a text supports substring queries with one integer array, why doubling sorts in O(n log n), and how the LCP array is computed in a single pass. algorithms