Optimal suffix sorting and LCP array construction for constant alphabets (Q344531)
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 6655344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal suffix sorting and LCP array construction for constant alphabets |
scientific article; zbMATH DE number 6655344 |
Statements
Optimal suffix sorting and LCP array construction for constant alphabets (English)
0 references
23 November 2016
0 references
data structures
0 references
suffix array
0 references
LCP array
0 references
linear time
0 references
constant space
0 references
0 references
0 references
0.8604989051818848
0 references
0.8496477603912354
0 references
0.8347906470298767
0 references
0.8344157934188843
0 references
0.8333467841148376
0 references
