Computing longest previous factor in linear time and applications (Q963336)
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 5694910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing longest previous factor in linear time and applications |
scientific article; zbMATH DE number 5694910 |
Statements
Computing longest previous factor in linear time and applications (English)
0 references
19 April 2010
0 references
design of algorithms
0 references
analysis of algorithms
0 references
strings
0 references
suffix array
0 references
longest common prefix
0 references
longest previous factor
0 references
Lempel-Ziv factorization
0 references
repetitions
0 references
runs
0 references
0.90738046169281
0 references
0.8853347301483154
0 references
0.8838145732879639
0 references
0.8739038109779358
0 references
0.8663914799690247
0 references
