Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extracting the sparse longest common prefix array from the suffix binary search tree |
scientific article |
Statements
Extracting the sparse longest common prefix array from the suffix binary search tree (English)
0 references
15 June 2022
0 references
suffix binary search tree
0 references
sparse suffix sorting
0 references
longest common prefixes
0 references
Euler tour
0 references
