Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100)
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 5664061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays |
scientific article; zbMATH DE number 5664061 |
Statements
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (English)
0 references
28 January 2010
0 references
longest previous reverse factor
0 references
longest previous non-overlapping factor
0 references
longest previous factor
0 references
palindrome
0 references
runs
0 references
suffix array
0 references
text compression
0 references
0.8850372
0 references
0.8766981
0 references
0.8745724
0 references
0.87175035
0 references
0.86427265
0 references
0 references
0.85667133
0 references
0.85667133
0 references
