MaxTiC: Fast ranking of a phylogenetic tree by Maximum Time Consistency with lateral gene transfers

Author:

Chauve Cédric,Rafiey Akbar,Davín Adrián A.,Scornavacca Celine,Veber Philippe,Boussau Bastien,Szöllősi Gergely J.,Daubin Vincent,Tannier Eric

Abstract

AbstractLateral gene transfers between ancient species contain information about the relative timing of species diversification. Specifically, the ancestors of a donor species must have existed before the descendants of the recipient species. Hence, the detection of a transfer event can be translated into a time constraint between nodes of a phylogeny if the donor and recipient can be identified. When a set of transfers is detected by interpreting the phylogenetic discordance between gene trees and a species tree, the set of all deduced time constraints can be used to rank the species tree,i.e.order totally its internal nodes. Unfortunately lateral gene transfer detection is challenging and current methods produce a significant proportion of false positives. As a result, often, no ranking of the species tree is compatible with the full set of time constraints deduced from predicted transfers. Here we propose a method, implemented in a software called MaxTiC (Maximum Time Consistency), which takes as input a species tree and a series of (possibly inconsistent) time constraints between its internal nodes, weighted by confidence scores. MaxTiC outputs a ranked species tree compatible with a subset of constraints with maximum cumulated confidence score. We extensively test the method on simulated datasets, under a wide range of conditions that we compare to measures on biological datasets. In most conditions the obtained ranked tree is very close to the real one, confirming the potential of dating the history of life with transfers by maximizing time consistency. MaxTiC is freely available, distributed along with a documentation and several examples:https://github.com/ssolo/ALE/tree/master/maxtic.

Publisher

Cold Spring Harbor Laboratory

Reference26 articles.

1. Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests

2. Badescu, D. , Tahiri, N. , and Makarenkov, V. (2016). A new fast method for detecting and validating horizontal gene transfer events using phylogenetic trees and aggregation functions. In Pattern Recognition in Computational Molecular Biology: Techniques and Approaches, pages 483–504. Wiley Online Library.

3. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss

4. Biller, P. , Knibbe, C. , Beslon, G. , and Tannier, E. (2016). Comparative genomics on artificial life. In Computability in Europe, Lecture Notes in Computer Science.

5. Brandenburg, F. J. and Hanauer, K. (2011). Sorting heuristics for the feedback arc set problem. Technical report, Technical Report MIP-1104, Department of Informatics and Mathematics, University of Passau.

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3