A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701)

From MaRDI portal
Revision as of 22:12, 8 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
A graph-theoretic model to solve the approximate string matching problem allowing for translocations
scientific article

    Statements

    A graph-theoretic model to solve the approximate string matching problem allowing for translocations (English)
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    algorithms
    0 references
    pattern matching
    0 references
    translocations
    0 references
    graphs
    0 references
    approximate string matching
    0 references

    Identifiers