3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction

Chung-Hua University Repository > 資訊學院 > 資訊工程學系 > 研討會論文 > Item 987654321/30819

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/30819

题名:	3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction
作者:	游坤明 Yu, K.M.
贡献者:	資訊工程學系 Computer Science & Information Engineering
日期:	2007
上传时间:	2014-06-27 01:11:59 (UTC+8)
摘要:	To construct an evolutionary tree is an important topic in computational biology. An evolutionary tree can symbolize the relationship and histories for a set of species. There are many models had been proposed to resolve these problems. However, most of
显示于类别:	[資訊工程學系] 研討會論文

文件中的档案:

档案	描述	大小	格式	浏览次数
s_e331_0056.pdf		26Kb	Adobe PDF	302	检视/开启

在CHUR中所有的数据项都受到原著作权保护.