title: On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
abstract: Duplication-Transfer-Loss (DTL) reconciliation has emerged as a powerful technique for studying gene family evolution in the presence of horizontal gene transfer. DTL reconciliation takes as input a gene family phylogeny and the corresponding species phylogeny, and reconciles the two by postulating speciation, gene duplication, horizontal gene transfer, and gene loss events. Efficient algorithms exist for finding optimal DTL reconciliations when the gene tree is binary. However, gene trees are frequently non-binary. With such non-binary gene trees, the reconciliation problem seeks to find a binary resolution of the gene tree that minimizes the reconciliation cost. Given the prevalence of non-binary gene trees, many efficient algorithms have been developed for this problem in the context of the simpler Duplication-Loss (DL) reconciliation model. Yet, no efficient algorithms exist for DTL reconciliation with non-binary gene trees and the complexity of the problem remains unknown. In this work, we resolve this open question by showing that the problem is, in fact, NP-hard. Our reduction applies to both the dated and undated formulations of DTL reconciliation. By resolving this long-standing open problem, this work will spur the development of both exact and heuristic algorithms for this important problem.
authors.forename: Misagh
authors.initials: M
authors.lastname: Kordi
authors.forename: Mukul S
authors.initials: MS
authors.lastname: Bansal
mesh_terms: D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D019143:Evolution, Molecular; D017353:Gene Deletion; D020440:Gene Duplication / Q000235:genetics*; D022761:Gene Transfer, Horizontal / Q000235:genetics*; D005810:Multigene Family / Q000235:genetics*; D010375:Pedigree; D010802:Phylogeny