Ran Libeskind-Hadas's Research

A CV and publications list can be found here.

My research addresses algorithmic issues in computational biology and, in particular, the problem of reconciling pairs of evolutionary trees such as gene trees and species trees and pairs of species trees (e.g., parasites and hosts).

This research has resulted in the three software packages for maximum parsimony reconciliation: Jane 4 (reconciliation of dated or undated trees), Xscape (reconciliation of undated trees using Pareto-optimality rather than specifying event costs a priori), and DTL-RnB (a reconciliation browser that summarizes the large space of possible optimal reconciliations).