In the last 15 years, Phylogenetic Diversity (PD) has gained interests in the community of conservation biologists as a surrogate measure for assessing biodiversity. We have recently proposed two approaches to select taxa for maximizing PD, namely PD with budget constraints
and PD on split systems. In this paper, we will unify these two strategies and present a dynamic
programming algorithm to solve the unified framework of selecting taxa with maximal PD under budget
constraints on circular split systems. An improved algorithm will also be given if the underlying
split system is a tree.
%0 Journal Article
%1 minh2008
%A Minh, Bui Quang
%A Pardi, Fabio
%A Klaere, Steffen
%A von Haeseler, Arndt
%D 2009
%J IEEE/ACM Trans. Comput. Biol. Bioinform.
%K biodiversity_conservation budget_contraint dynamic_programming phylogenetic_diversity phylogenetic_network split_system
%N 1
%P 22-29
%T Budgeted Phylogenetic Diversity on Circular Split Systems
%U http://dx.doi.org/10.1109/TCBB.2008.54
%V 6
%X In the last 15 years, Phylogenetic Diversity (PD) has gained interests in the community of conservation biologists as a surrogate measure for assessing biodiversity. We have recently proposed two approaches to select taxa for maximizing PD, namely PD with budget constraints
and PD on split systems. In this paper, we will unify these two strategies and present a dynamic
programming algorithm to solve the unified framework of selecting taxa with maximal PD under budget
constraints on circular split systems. An improved algorithm will also be given if the underlying
split system is a tree.
@article{minh2008,
abstract = {In the last 15 years, Phylogenetic Diversity (PD) has gained interests in the community of conservation biologists as a surrogate measure for assessing biodiversity. We have recently proposed two approaches to select taxa for maximizing PD, namely PD with budget constraints
and PD on split systems. In this paper, we will unify these two strategies and present a dynamic
programming algorithm to solve the unified framework of selecting taxa with maximal PD under budget
constraints on circular split systems. An improved algorithm will also be given if the underlying
split system is a tree.},
added-at = {2009-05-14T23:43:03.000+0200},
author = {Minh, Bui Quang and Pardi, Fabio and Klaere, Steffen and von Haeseler, Arndt},
biburl = {https://www.bibsonomy.org/bibtex/2de54627c556c6fc07546dfbf8ee96cbc/compevol},
interhash = {ed0cfb15f79318862c98abc43a7434fa},
intrahash = {de54627c556c6fc07546dfbf8ee96cbc},
journal = {IEEE/ACM Trans. Comput. Biol. Bioinform.},
keywords = {biodiversity_conservation budget_contraint dynamic_programming phylogenetic_diversity phylogenetic_network split_system},
month = Jan,
number = 1,
pages = {22-29},
timestamp = {2009-05-14T23:43:03.000+0200},
title = {Budgeted Phylogenetic Diversity on Circular Split Systems},
url = {http://dx.doi.org/10.1109/TCBB.2008.54},
volume = 6,
year = 2009
}