Optimally computing compressed indexing arrays based on the compact directed acyclic word graph (Q6545409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimally computing compressed indexing arrays based on the compact directed acyclic word graph |
scientific article; zbMATH DE number 7854951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimally computing compressed indexing arrays based on the compact directed acyclic word graph |
scientific article; zbMATH DE number 7854951 |
Statements
Optimally computing compressed indexing arrays based on the compact directed acyclic word graph (English)
0 references
29 May 2024
0 references
highly-repetitive text
0 references
suffix tree
0 references
longest common prefix
0 references
0 references
0.8312889933586121
0 references
0.7947202920913696
0 references
0.7922605276107788
0 references
0.77567058801651
0 references
