ConceptTheory & Algos
Compact suffix tree
A representation of a suffix tree that stores a compressed binary trie without explicit edge lengths, using balanced parentheses and rank/select operations.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.