Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2015.05.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W422844602 / rank | |||
Normal rank | |||
Latest revision as of 18:29, 19 March 2024
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
