Gene tree reconciliation including transfers with replacement is NP-hard and FPT - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Optimization Year : 2019

Gene tree reconciliation including transfers with replacement is NP-hard and FPT

Abstract

Phylogenetic trees illustrate the evolutionary history of genes and species. Although genes evolve along with the species they belong to, a species tree and gene tree are often not identical. The reasons for this are the evolutionary events at the gene level, like duplication or transfer. These differences are handled by phylogenetic reconciliation, which formally is a mapping between a gene tree nodes and a species tree nodes and branches. We investigate models of reconciliation with gene transfers replacing existing genes, which is a biologically important event, but has never been included in the reconciliation models. The problem is close to the dated version of the classical subtree prune and regraft (SPR) distance problem, where a pruned subtree has to be regrafted only on a branch closer to the root. We prove that the reconciliation problem including transfer with replacement is NP-hard, and that, if speciations and transfers with replacement are the only allowed evolutionary events, it is fixed-parameter tractable with respect to the reconciliation’s weight. We prove that the results extend to the dated SPR problem.

Dates and versions

hal-02301454 , version 1 (30-09-2019)

Identifiers

Cite

Damir Hasic, Eric Tannier. Gene tree reconciliation including transfers with replacement is NP-hard and FPT. Journal of Combinatorial Optimization, 2019, 38 (2), pp.502-544. ⟨10.1007/s10878-019-00396-z⟩. ⟨hal-02301454⟩
42 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More