Supertree algorithms for ancestral divergence dates and nested taxa

17Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motivation: Supertree methods have been often identified as a possible approach to the reconstruction of the 'Tree of Life'. However, a limitation of such methods is that, typically, they use just leaf-labelled phylogenetic trees to infer the resulting supertree. Results: In this paper, we describe several now supertree algorithms that extend the allowable information that can be used for phylogenetic inference. These algorithms have been recently implemented and we describe here two illustrative applications. © Oxford University Press 2004; all rights reserved.

Cite

CITATION STYLE

APA

Semple, C., Daniel, P., Hordijk, W., Page, R. D. M., & Steel, M. (2004). Supertree algorithms for ancestral divergence dates and nested taxa. Bioinformatics, 20(15), 2355–2360. https://doi.org/10.1093/bioinformatics/bth246

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free