Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989)
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: Optimal bounds for computing -gapped repeats |
scientific article; zbMATH DE number 7106208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal bounds for computing \({\alpha}\)-gapped repeats |
scientific article; zbMATH DE number 7106208 |
Statements
Optimal bounds for computing \({\alpha}\)-gapped repeats (English)
0 references
17 September 2019
0 references
combinatorics on words
0 references
algorithms on strings
0 references
combinatorial algorithms
0 references
time complexity
0 references
repeats
0 references
gapped repeats
0 references
subrepetitions
0 references
0.9947330951690674
0 references
0.9265203475952148
0 references
0.908477544784546
0 references
0.8982078433036804
0 references
0.8832741379737854
0 references
