TxT

A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree Tree reconciliation approach to inferring the duplication history for a gene family poses challenging problems when input gene and species trees are non-binary. We present the first linear-time algorithm that outputs a reconciliation of a non-binary gene tree and a binary species tree that minimizes the gene loss cost under the constraint of having the smallest gene duplication cost. As a part of a method for reconciling two non-binary trees, this algorithm has been implemented in a software package (http://phylotoo.appspot.com).