The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.aam.2018.09.002 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129208656 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AAM.2018.09.002 / rank | |||
Normal rank | |||
Latest revision as of 23:47, 10 December 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
