License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2018.8
URN: urn:nbn:de:0030-drops-93108
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9310/
Zhang, Qiuyi (Richard) ;
Rao, Satish ;
Warnow, Tandy
New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy
Abstract
Absolute fast converging (AFC) phylogeny estimation methods are ones that have been proven to recover the true tree with high probability given sequences whose lengths are polynomial in the number of number of leaves in the tree (once the shortest and longest branch lengths are fixed). While there has been a large literature on AFC methods, the best in terms of empirical performance was DCM_NJ, published in SODA 2001. The main empirical advantage of DCM_NJ over other AFC methods is its use of neighbor joining (NJ) to construct trees on smaller taxon subsets, which are then combined into a tree on the full set of species using a supertree method; in contrast, the other AFC methods in essence depend on quartet trees that are computed independently of each other, which reduces accuracy compared to neighbor joining. However, DCM_NJ is unlikely to scale to large datasets due to its reliance on supertree methods, as no current supertree methods are able to scale to large datasets with high accuracy. In this study we present a new approach to large-scale phylogeny estimation that shares some of the features of DCM_NJ but bypasses the use of supertree methods. We prove that this new approach is AFC and uses polynomial time. Furthermore, we describe variations on this basic approach that can be used with leaf-disjoint constraint trees (computed using methods such as maximum likelihood) to produce other AFC methods that are likely to provide even better accuracy. Thus, we present a new generalizable technique for large-scale tree estimation that is designed to improve scalability for phylogeny estimation methods to ultra-large datasets, and that can be used in a variety of settings (including tree estimation from unaligned sequences, and species tree estimation from gene trees).
BibTeX - Entry
@InProceedings{zhang_et_al:LIPIcs:2018:9310,
author = {Qiuyi (Richard) Zhang and Satish Rao and Tandy Warnow},
title = {{New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy}},
booktitle = {18th International Workshop on Algorithms in Bioinformatics (WABI 2018)},
pages = {8:1--8:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-082-8},
ISSN = {1868-8969},
year = {2018},
volume = {113},
editor = {Laxmi Parida and Esko Ukkonen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9310},
URN = {urn:nbn:de:0030-drops-93108},
doi = {10.4230/LIPIcs.WABI.2018.8},
annote = {Keywords: phylogeny estimation, short quartets, sample complexity, absolute fast converging methods, neighbor joining, maximum likelihood}
}
|
Keywords: |
|
phylogeny estimation, short quartets, sample complexity, absolute fast converging methods, neighbor joining, maximum likelihood |
|
Collection: |
|
18th International Workshop on Algorithms in Bioinformatics (WABI 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
02.08.2018 |
