.png){kind=icon}
返回
Phylogenetic diversity and the greedy algorithm
.png){kind=icon}
OA
AI
DOI：10.1080/10635150590947023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a phylogenetic tree with leaves labeled by a collection of species, and with weighted edges, the phylogenetic diversity of any subset of the species is the sum of the edge weights of the minimal subtree connecting the species. This measure is relevant in biodiversity conservation where one may wish to compare different subsets of species according to how much evolutionary variation they encompass. In this note we show that phylogenetic diversity has an attractive mathematical property that ensures that we can solve the following problem easily by the greedy algorithm: find a subset of the species of any given size k of maximal phylogenetic diversity. We also describe an extension of this result that also allows weights to be assigned to species.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.2K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
Adaptation of the mechanisms controlling gastric motility following chronic vagotomy in the ferretOAAI
OAAI分享收藏Areal density effects on the blocking of 3-keV Ne7+ions guided through nanocapillaries in polymersOAAI
OAAI分享收藏
没有更多内容
没有更多内容