Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:59, 2 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
