Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801)
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 6603882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds |
scientific article; zbMATH DE number 6603882 |
Statements
Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (English)
0 references
15 July 2016
0 references
approximate string matching
0 references
lossless approximate seeds
0 references
Levenshtein distance
0 references
computational biology
0 references
0.9218215346336364
0 references
0.7810074687004089
0 references
0.7810074687004089
0 references
0.7765428423881531
0 references
