On the computational complexity of closest genome problems (Q2295622)
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 7167470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of closest genome problems |
scientific article; zbMATH DE number 7167470 |
Statements
On the computational complexity of closest genome problems (English)
0 references
14 February 2020
0 references
closest problem
0 references
single-cut-or-join
0 references
breakpoint
0 references
block-interchange
0 references
0.7886756658554077
0 references
0.7860291004180908
0 references
0.7855015397071838
0 references
0.7772237658500671
0 references
0.7703266739845276
0 references
