Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Alphabet-independent algorithms for finding context-sensitive repeats in linear time |
scientific article; zbMATH DE number 6475105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alphabet-independent algorithms for finding context-sensitive repeats in linear time |
scientific article; zbMATH DE number 6475105 |
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
0 references
0.90247667
0 references
0.8760679
0 references
0.8701569
0 references
0.86801684
0 references
0.8672744
0 references
0.8670571
0 references
0.8670571
0 references
