Reconciling Multiple Genes Trees via Segmental Duplications and Losses
Riccardo Dondi, Manuel Lafond, Celine Scornavacca

TL;DR
This paper develops a polynomial-time solution for reconciling multiple gene trees with a species tree considering segmental duplications and losses, and introduces a fixed-parameter algorithm for more complex cases, validated on real datasets.
Contribution
It extends gene tree reconciliation to include segmental macro-evolutionary events and solves the NP-hard case with a fixed-parameter algorithm, addressing a longstanding open problem.
Findings
Polynomial-time solution when duplication cost ≤ loss cost
NP-hardness when duplication cost > loss cost
Effective algorithm validated on eukaryote and yeast datasets
Abstract
Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. However, it is well-known that the evolution of gene families is interconnected. In this paper, we extend a previous approach to reconcile a set of gene trees with a species tree based on segmental macro-evolutionary events, where segmental duplication events and losses are associated with cost and , respectively. We show that the problem is polynomial-time solvable when (via LCA-mapping), while if the problem is NP-hard, even when and a single gene tree is given, solving a long standing open problem on the complexity of the reconciliation problem. On the positive side, we give a fixed-parameter algorithm for the problem, where the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenomics and Phylogenetic Studies · Genome Rearrangement Algorithms · Bioinformatics and Genomic Networks
