On the computational complexity of closest genome problems (Q2295622): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:14, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of closest genome problems |
scientific article |
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
