An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6588301 / rank
 
Normal rank
Property / zbMATH Keywords
 
analysis of algorithms
Property / zbMATH Keywords: analysis of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
computational molecular biology
Property / zbMATH Keywords: computational molecular biology / rank
 
Normal rank
Property / zbMATH Keywords
 
probabilistic method
Property / zbMATH Keywords: probabilistic method / rank
 
Normal rank
Property / zbMATH Keywords
 
Lovász local lemma
Property / zbMATH Keywords: Lovász local lemma / rank
 
Normal rank

Revision as of 20:36, 27 June 2023

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