Submit a preprint

83

MaxTiC: Fast ranking of a phylogenetic tree by Maximum Time Consistency with lateral gene transfersuse asterix (*) to get italics
Cédric Chauve, Akbar Rafiey, Adrian A. Davin, Celine Scornavacca, Philippe Veber, Bastien Boussau, Gergely J Szöllosi, Vincent Daubin, and Eric TannierPlease use the format "First name initials family name" as in "Marie S. Curie, Niels H. D. Bohr, Albert Einstein, John R. R. Tolkien, Donna T. Strickland"
2017
Lateral gene transfers (LGTs) 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 LGT event can be translated into a time constraint between nodes of a phylogeny if donors and recipients can be identified. When a set of LGTs are detected by interpreting the phylogenetic discordance between gene trees and a species tree, the set of all deduced time constraints can be used to order totally the internal nodes and thus produce a ranked tree. Unfortunately LGT detection is still very challenging and current methods produce a significant proportion of false positives. As a result the set of time constraints is not always compatible with a ranked species tree. We propose an optimization method, which we call MaxTiC (Maximum Time Consistency), for obtaining a ranked species tree compatible with a maximum number of time constraints. The problem in general inherits NP-completeness from feedback arc sets. However we give an exact polynomial time method based on dynamic programming to compute an optimal ranked binary tree supposing that its two children are ranked. We turn this principle into a heuristic to solve the general problem and test it on simulated datasets. Under a wide range of conditions, which we compare to biological datasets, the obtained ranked tree is very close to the real one, confirming the theoretical possibility of dating in the history of life with transfers by maximizing time consistency. MaxTiC is available within the ALE package: https://github.com/ssolo/ALE/tree/master/misc.
You should fill this box only if you chose 'All or part of the results presented in this preprint are based on data'. URL must start with http:// or https://
You should fill this box only if you chose 'Scripts were used to obtain or analyze the results'. URL must start with http:// or https://
You should fill this box only if you chose 'Codes have been used in this study'. URL must start with http:// or https://
dating; simulations; phylogeny; optimization; transfer; reconciliation; ultrametric tree; algorithmics;
NonePlease indicate the methods that may require specialised expertise during the peer review process (use a comma to separate various required expertises).
Bioinformatics & Computational Biology, Evolutionary Dynamics, Genome Evolution, Life History, Molecular Evolution, Phylogenetics / Phylogenomics
No need for them to be recommenders of PCIEvolBiol. Please do not suggest reviewers for whom there might be a conflict of interest. Reviewers are not allowed to review preprints written by close colleagues (with whom they have published in the last four years, with whom they have received joint funding in the last four years, or with whom they are currently writing a manuscript, or submitting a grant proposal), or by family members, friends, or anyone for whom bias might affect the nature of the review - see the code of conduct
e.g. John Doe [john@doe.com]
2017-06-28 13:40:52
Tatiana Giraud