Efficient algorithms for three variants of the LPF table (Q414447)
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: Efficient algorithms for three variants of the LPF table |
scientific article; zbMATH DE number 6033179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for three variants of the LPF table |
scientific article; zbMATH DE number 6033179 |
Statements
Efficient algorithms for three variants of the LPF table (English)
0 references
11 May 2012
0 references
longest previous reverse factor
0 references
longest previous non-overlapping 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 references
0 references
0 references
0.8745724
0 references
0 references
0.8122557
0 references
0.81045043
0 references
0.80794036
0 references
0 references
