A three-string approach to the closest string problem (Q414864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A three-string approach to the closest string problem |
scientific article; zbMATH DE number 6033486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A three-string approach to the closest string problem |
scientific article; zbMATH DE number 6033486 |
Statements
A three-string approach to the closest string problem (English)
0 references
11 May 2012
0 references
computational biology
0 references
the closest string problem
0 references
fixed-parameter algorithms
0 references
0.9847115874290466
0 references
0.9287518858909608
0 references
0.9248250126838684
0 references
0.8812955617904663
0 references
0.8738756775856018
0 references
