Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2019.104434 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2019.104434 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 17 December 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
