An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4004078 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4074927 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mapping the genome / rank | |||
Normal rank | |||
Latest revision as of 01:57, 12 July 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
