Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model

Ross Mawhorter,Nuo Liu, Ran Libeskind-Hadas,Yi-Chieh Wu

BMC bioinformatics(2019)

引用 4|浏览26
暂无评分
摘要
Background Reconciliation methods are widely used to explain incongruence between a gene tree and species tree. However, the common approach of inferring maximum parsimony reconciliations (MPRs) relies on user-defined costs for each type of event, which can be difficult to estimate. Prior work has explored the relationship between event costs and maximum parsimony reconciliations in the duplication-loss and duplication-transfer-loss models, but no studies have addressed this relationship in the more complicated duplication-loss-coalescence model. Results We provide a fixed-parameter tractable algorithm for computing Pareto-optimal reconciliations and recording all events that arise in those reconciliations, along with their frequencies. We apply this method to a case study of 16 fungi to systematically characterize the complexity of MPR space across event costs and identify events supported across this space. Conclusion This work provides a new framework for studying the relationship between event costs and reconciliations that incorporates both macro-evolutionary events and population effects and is thus broadly applicable across eukaryotic species.
更多
查看译文
关键词
Phylogenetics,Reconciliation,Coalescence,Incomplete lineage sorting,Gene duplication and loss,Pareto optimality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要