The Jump Index

FM-index et al.: LF cache-miss per character:(Link to heading

I/O-efficient pattern matching using suffix triesLink to heading

Suffix trees are in text space and I/O efficient!

Suffix trees of repetitive texts are repetitive!

listend

“run-length suffix trees” embedded in the text:

Suffixient Sets: Depuydt et al. (2023)

Suffixient Array: Cenzato et al. (2024)

Suffix Tree Path Decomposition: Becker et al. (2026)

Greedily match pattern against text.