Published in: LIPIcs, Volume 201, 21st International Workshop on Algorithms in Bioinformatics (WABI 2021)
Matthew LeMay, Yi-Chieh Wu, and Ran Libeskind-Hadas. The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. In 21st International Workshop on Algorithms in Bioinformatics (WABI 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 201, pp. 1:1-1:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lemay_et_al:LIPIcs.WABI.2021.1, author = {LeMay, Matthew and Wu, Yi-Chieh and Libeskind-Hadas, Ran}, title = {{The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard}}, booktitle = {21st International Workshop on Algorithms in Bioinformatics (WABI 2021)}, pages = {1:1--1:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-200-6}, ISSN = {1868-8969}, year = {2021}, volume = {201}, editor = {Carbone, Alessandra and El-Kebir, Mohammed}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2021.1}, URN = {urn:nbn:de:0030-drops-143546}, doi = {10.4230/LIPIcs.WABI.2021.1}, annote = {Keywords: phylogenetics, reconciliation, deep coalescence, hybridization, NP-hardness} }
Feedback for Dagstuhl Publishing