Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alphabet-independent algorithms for finding context-sensitive repeats in linear time |
scientific article |
Statements
Alphabet-independent algorithms for finding context-sensitive repeats in linear time (English)
0 references
24 August 2015
0 references
maximal repeats
0 references
supermaximal repeats
0 references
near-supermaximal repeats
0 references
context-diverse repeats
0 references
enhanced suffix array
0 references
