A parallel multistart algorithm for the closest string problem (Q2483510): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.04.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986798565 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Solutions for the Closest-String Problem via Integer Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distinguishing string selection problems. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the closest string and substring problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252402 / rank | |||
Normal rank | |||
Latest revision as of 22:26, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel multistart algorithm for the closest string problem |
scientific article |
Statements
A parallel multistart algorithm for the closest string problem (English)
0 references
28 April 2008
0 references
sequence analysis
0 references
parallel algorithms
0 references
closest string problem
0 references
