An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n n) algorithm for finding dissimilar strings |
scientific article; zbMATH DE number 6588301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n\log n)\) algorithm for finding dissimilar strings |
scientific article; zbMATH DE number 6588301 |
Statements
An \(O(n\log n)\) algorithm for finding dissimilar strings (English)
0 references
1 June 2016
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
0.7477943301200867
0 references
0.7361592054367065
0 references
0.7330852746963501
0 references
