Ran Libeskind-Hadas, Ph.D.

R. Libeskind-Hadas, "Pairwise Distances and the Problem of Multiple Optima", Journal of Computational Biology, July 2024.

N. Liu, T. Gonzalez, J. Fischer, C. Hong, R. Mawhorter, F. Mugnatto, R. Soh, S. Somji, J. Wirth, R. Libeskind-Hadas, Eliot Bush, “xenoGI 3: Using the DTLOR model to reconstruct the evolution of gene families in clades of microbes,” BMC Bioinformatics, July 2023.

R. Libeskind-Hadas, “Tree reconciliation methods for host-symbiont cophylogenetic analyses,” Life,
(special issue on Untangling Host-Symbiont Coevolutionary History in the High Throughput Se-
quencing Era), March 2022, DOI: 10.3390/life12030443.

M. LeMay, R. Libeskind-Hadas, Y-C Wu, "A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks," IEEE-ACM Transactions on Computational Biology and Bioinformatics, IEEE/ACM Transactions on Computational Biology
and Bioinformatics, August 2021, DOI: 10.1109/TCBB.2021.3105922

M. LeMay, R. Libeskind-Hadas, Y-C Wu, “The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard," WABI 2021, LIPIcs:  Leibniz International Proceedings in Informatics.

J. Liu, R. Mawhorter, N. Liu, S. Santichaivekin, E. Bush, R. Libeskind-Hadas, “Maximum Parsimony Reconciliation in the DTLOR Model,”  BMC Bioinformatics, August 2021.

S. Santichaivekin, Q. Yang, J. Liu, R. Mawhorter, J.Jiang, T. Wesley, Y-C Wu, R. Libeskind-Hadas, “eMPRess: A Systematic Cophylogeny Reconciliation Tool,” Bioinformatics, November 2020.

S. Santichaivekin, R. Mawhorter, R. Libeskind-Hadas, “An Efficient Exact Algorithm for Computing All Pairwise Distances between Reconciliations in the Duplication-Transfer-Loss Mode,” BMC Bioinformatics, 2019.