Optimal solutions for the closest-string problem via integer programming (Q2890443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6044589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal solutions for the closest-string problem via integer programming |
scientific article; zbMATH DE number 6044589 |
Statements
8 June 2012
0 references
closest-string problem
0 references
computational biology
0 references
mathematical programming
0 references
branch-and-bound algorithms
0 references
Optimal solutions for the closest-string problem via integer programming (English)
0 references
0.8854782581329346
0 references
0.8796446323394775
0 references
0.8723808526992798
0 references
0.8544283509254456
0 references
0.8528638482093811
0 references
