An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231)

From MaRDI portal
Revision as of 02:57, 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
An \(O(n\log n)\) algorithm for finding dissimilar strings
scientific article

    Statements

    An \(O(n\log n)\) algorithm for finding dissimilar strings (English)
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    analysis of algorithms
    0 references
    combinatorial problems
    0 references
    computational molecular biology
    0 references
    probabilistic method
    0 references
    Lovász local lemma
    0 references