Computing the longest common prefix array based on the Burrows-Wheeler transform (Q2376799)
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: Computing the longest common prefix array based on the Burrows-Wheeler transform |
scientific article; zbMATH DE number 6180276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the longest common prefix array based on the Burrows-Wheeler transform |
scientific article; zbMATH DE number 6180276 |
Statements
Computing the longest common prefix array based on the Burrows-Wheeler transform (English)
0 references
24 June 2013
0 references
longest common prefix array
0 references
Burrows-Wheeler transform
0 references
wavelet tree
0 references
shortest unique substrings
0 references
shortest absent words
0 references
0.8360123038291931
0 references
0.8288499116897583
0 references
0.8174257278442383
0 references
0.8098703622817993
0 references
