Suffix trees underpin many string-processing applications, yet their classical O(n) construction algorithms suffer in practice from the gap between processor and memory speeds: cache misses, not arithmetic operations, dominate wall-clock time. This p...
read more