Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees (Q6538718)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7848147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees |
scientific article; zbMATH DE number 7848147 |
Statements
Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees (English)
0 references
14 May 2024
0 references
