Journal
SYSTEMATIC BIOLOGY
Volume 58, Issue 6, Pages 586-594Publisher
OXFORD UNIV PRESS
DOI: 10.1093/sysbio/syp058
Keywords
Biodiversity conservation; dynamic programming; phylogenetic diversity; phylogenetic network; split diversity; split system
Categories
Funding
- Austrian Science Fund (FWF) [W1207] Funding Source: Austrian Science Fund (FWF)
Ask authors/readers for more resources
The phylogenetic diversity (PD) measure of biodiversity is evaluated using a phylogenetic tree, usually inferred from morphological or molecular data. Consequently, it is vulnerable to errors in that tree, including those resulting from sampling error, model misspecification, or conflicting signals. To improve the robustness of PD, we can evaluate the measure using either a collection (or distribution) of trees or a phylogenetic network. Recently, it has been shown that these 2 approaches are equivalent but that the problem of maximizing PD in the general concept is NP-hard. In this study, we provide an efficient dynamic programming algorithm for maximizing PD when splits in the trees or network form a circular split system. We illustrate our method using a case study of game birds (Galliformes) and discuss the different choices of taxa based on our approach and PD.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available