.png){kind=icon}
返回
Phylogenetic diversity within seconds
.png){kind=icon}
OA
AI
DOI：10.1080/10635150600981604.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a (phylogenetic) tree with n labeled leaves, the taxa, and a length for each branch in the tree. For any subset of k taxa, the phylogenetic diversity is defined as the sum of the branch-lengths of the minimal subtree connecting the taxa in the subset. We introduce two time-efficient algorithms ( greedy and pruning) to compute a subset of size k with maximal phylogenetic diversity in O( n log k) and O[ n + ( n - k) log( n - k)] time, respectively. The greedy algorithm is an efficient implementation of the so-called greedy strategy ( Steel, 2005; Pardi and Goldman, 2005), whereas the pruning algorithm provides an alternative description of the same problem. Both algorithms compute within seconds a subtree with maximal phylogenetic diversity for trees with 100,000 taxa or more.
Keyword:
CONSERVATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.2K
被引数:
1.9W
机构
暂无机构信息
引用论文
Areal density effects on the blocking of 3-keV Ne7+ions guided through nanocapillaries in polymersOAAI
OAAI分享收藏Unearthing the molecular phylodiversity of desert soil green algae (Chlorophyta).png)
SYSTEMATIC BIOLOGYOAAI
SYSTEMATIC BIOLOGYIF5.7
OAAI分享收藏Inhibition of the yeast-mycelial transition and the phorogenesis of Mucorales by diamino butanone
PREAI
分享收藏 没有更多内容
没有更多内容