An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:05, 30 January 2024
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
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
