Sign inSign in

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.
Watch it explained

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.

Suffix array2Balanced parentheses sequences1Rank and select1Suffix tree1Trie1

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.