The selective fixing algorithm for the closest string problem (Q336747): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Improved LP-based algorithms for the closest string problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252342 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding similar regions in many strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact algorithm and heuristic for the closest string problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic algorithm based on Lagrangian relaxation for the closest string problem / rank | |||
Normal rank | |||
Revision as of 21:43, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The selective fixing algorithm for the closest string problem |
scientific article |
Statements
The selective fixing algorithm for the closest string problem (English)
0 references
10 November 2016
0 references
closest string problem
0 references
heuristics
0 references
continuous relaxation
0 references
