Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees

Published:2009-11 Issue:11 Volume:69 Page:905-914
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Yu Kun-Ming,Zhou Jiayi,Lin Chun-Yuan,Tang Chuan Yi

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference43 articles.

1. FORTRAN 90 Handbooks;Adams,1992

2. Recognition of tree metrics;Bandelt;SIAM J. Discrete Math.,1990

3. Phylogenetic analysis: Models and estimation procedures;Cavalli-Sforza;Am. J. Hum. Genet.,1967

4. An efficient exact algorithm for the minimum ultrametric tree problem;Chen;Lect. Notes Comput. Sc.,2004

5. Genomic divergences between humans and other hominoids and the effective population size of the common ancestor of humans and chimpanzees;Chen;Am. J. Hum. Genet.,2001

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GPU-UPGMA: high-performance computing for UPGMA algorithm based on graphics processing units;Concurrency and Computation: Practice and Experience;2014-08-05

2. Bayesian models for comparative analysis integrating phylogenetic uncertainty;BMC Evolutionary Biology;2012-06-28

3. An Efficient Load Balancing Multi-core Frequent Patterns Mining Algorithm;2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications;2011-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP