Lemay, M., Wu, Y., & Libeskind-Hadas, R. (2021, March 16). The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard bioRxiv. https://doi.org/10.1101/2021.03.14.435321
Chicago Style (17th ed.) CitationLemay, Matthew, Yi-Chieh Wu, and Ran Libeskind-Hadas. "The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard." BioRxiv 16 Mar. 2021. https://doi.org/10.1101/2021.03.14.435321.
MLA (9th ed.) CitationLemay, Matthew, et al. "The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard." BioRxiv, 16 Mar. 2021, https://doi.org/10.1101/2021.03.14.435321.
Warning: These citations may not always be 100% accurate.