The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of calculating partition functions of optimal medians with Hamming distance |
scientific article |
Statements
The computational complexity of calculating partition functions of optimal medians with Hamming distance (English)
0 references
6 December 2018
0 references
computational complexity
0 references
partition function
0 references
median
0 references
genome rearrangement
0 references
single cut-or-join
0 references
FPRAS
0 references
FPAUS
0 references
