Locating all maximal approximate runs in a string (Q4928555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6176320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locating all maximal approximate runs in a string |
scientific article; zbMATH DE number 6176320 |
Statements
Locating All Maximal Approximate Runs in a String (English)
0 references
14 June 2013
0 references
algorithms on strings
0 references
pattern matching
0 references
repetitions
0 references
tandem repeats
0 references
runs
0 references
0.982155442237854
0 references
0.8820034265518188
0 references
0.7784551382064819
0 references
0.7746190428733826
0 references
0.7730030417442322
0 references
