.png){kind=icon}
Return
Phylogenetic diversity and the greedy algorithm
.png){kind=icon}
OA
AI
DOI：10.1080/10635150590947023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
2.2K
Citations:
1.9W
Organization
No organization information available
Cited Papers
.png){kind=icon}
Adaptation of the mechanisms controlling gastric motility following chronic vagotomy in the ferretOAAI
OAAIShareSaveAreal density effects on the blocking of 3-keV Ne7+ions guided through nanocapillaries in polymersOAAI
OAAIShareSave
no more
no more