The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard

The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard
复制标题

存在不完整谱系排序和杂交时最简约的协调问题是 NP 难问题

DOI:
10.4230/lipics.wabi.2021.1
复制
发表时间:
2021
期刊:
21st International Workshop on Algorithms in Bioinformatics (WABI 2021
影响因子:
--
通讯作者:
Libeskind-Hadas, Ran
Libeskind-Hadas, Ran
中科院分区:
--
文献类型:
--
作者:
LeMay, Matthew;Wu, Yi-Chieh;Libeskind-Hadas, Ran

文献摘要

相似文献