Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Bowtie 2 / rank | |||
Normal rank | |||
Revision as of 02:07, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds |
scientific article |
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
