Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801)

From MaRDI portal
Revision as of 07:08, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers