Solution of the Generalized Noah's Ark Problem
收藏DataONE2020-06-24 更新2025-07-19 收录
下载链接:
https://search.dataone.org/view/sha256:2ae112a23858d3120281264d81071783c54f2fe43be57f21d452ea99b447cd1a
下载链接
链接失效反馈官方服务:
资源简介:
The phylogenetic diversity (PD) of a set of species is a measure of the evolutionary distance among the species in the collection, based on a phylogenetic tree. Such a tree is composed of a root, of internal nodes and of leaves that correspond to the set of taxa under study. With each edge of the tree is associated a non-negative branch length (evolutionary distance). If a particular survival probability is associated with each taxon, the PD measure becomes the expected PD measure. In the Noahâs Ark Problem (NAP) introduced by Weitzman (1998), these survival probabilities can be increased at some cost. The problem is to determine how best to allocate a limited amount of resources to maximize the expected PD of the considered species. It is easy to formulate the NAP as a (difficult) nonlinear 0-1 programming problem. The aim of this article is to show that a general version of the NAP (GNAP) can be solved simply and efficiently with any set of edge weights and any set of survival probabi...
创建时间:
2025-07-02



