Reconstructing (super)trees from data sets with missing distances: Not all is lost

Kettleborough, George, Dicks, Jo L., Roberts, Ian N. and Huber, Katharina T. (2015) Reconstructing (super)trees from data sets with missing distances: Not all is lost. Molecular Biology and Evolution, 32 (6). pp. 1628-1642. ISSN 0737-4038

[thumbnail of Mol Biol Evol-2015-Kettleborough-1628-42]
PDF (Mol Biol Evol-2015-Kettleborough-1628-42) - Published Version
Available under License Creative Commons Attribution.

Download (860kB) | Preview


The wealth of phylogenetic information accumulated over many decades of biological research, coupled with recent technological advances in molecular sequence generation, present significant opportunities for researchers to investigate relationships across and within the kingdoms of life. However, to make best use of this data wealth, several problems must first be overcome. One key problem is finding effective strategies to deal with missing data. Here, we introduce Lasso, a novel heuristic approach for reconstructing rooted phylogenetic trees from distance matrices with missing values, for datasets where a molecular clock may be assumed. Contrary to other phylogenetic methods on partial datasets, Lasso possesses desirable properties such as its reconstructed trees being both unique and edge-weighted. These properties are achieved by Lasso restricting its leaf set to a large subset of all possible taxa, which in many practical situations is the entire taxa set. Furthermore, the Lasso approach is distance-based, rendering it very fast to run and suitable for datasets of all sizes, including large datasets such as those generated by modern Next Generation Sequencing technologies. To better understand the performance of Lasso, we assessed it by means of artificial and real biological datasets, showing its effectiveness in the presence of missing data. Furthermore, by formulating the supermatrix problem as a particular case of the missing data problem, we assessed Lasso's ability to reconstruct supertrees. We demonstrate that, although not specifically designed for such a purpose, Lasso performs better than or comparably with five leading supertree algorithms on a challenging biological data set. Finally, we make freely available a software implementation of Lasso so that researchers may, for the first time, perform both rooted tree and supertree reconstruction with branch lengths on their own partial datasets.

Item Type: Article
Additional Information: The online version of this article has been published in Oxford Open, which is an open access initiative (more information available here []). Readers are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the journal and Oxford University Press are attributed as the original place of publication with the correct citation details given. If an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work, this must be clearly indicated. For those wishing to make commercial use of the article, please go to for permissions information or see the website []. Oxford Journals, Oxford University Press [] Information for authors []
Uncontrolled Keywords: phylogenetic trees,rooted trees,partial distance,supertree,lasso,molecular clock,dendrogram
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018)
Faculty of Science > Research Groups > Computational Biology
Depositing User: Pure Connector
Date Deposited: 06 Feb 2015 12:48
Last Modified: 14 Jun 2023 12:04
DOI: 10.1093/molbev/msv027


Downloads per month over past year

Actions (login required)

View Item View Item