Fast, practical algorithms for computing all the repeats in a string (Q626893): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:17, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast, practical algorithms for computing all the repeats in a string |
scientific article |
Statements
Fast, practical algorithms for computing all the repeats in a string (English)
0 references
19 February 2011
0 references
repeat
0 references
repetition
0 references
suffix array
0 references
suffix tree
0 references
