Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q306717 |
Changed an Item |
||
| Property / author | |||
| Property / author: Roman M. Kolpakov / rank | |||
Normal rank | |||
Revision as of 18:28, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal bounds for computing \({\alpha}\)-gapped repeats |
scientific article |
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
