Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix

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

請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/30907

題名:	Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix
作者:	游坤明 Yu, K.M.
貢獻者:	資訊工程學系 Computer Science & Information Engineering
關鍵詞:	Parallel computing;branch-and-bound;evolutionary tree;distance matrices;minimum ultrametric trees.
日期:	2005
上傳時間:	2014-06-27 01:15:07 (UTC+8)
摘要:	An ultrametric tree is an evolutionary tree in which the distances from the root to all leaves in the tree are equal. The Minimum Ultrametric Tree construction problem is the problem of constructing an ultrametric tree from distance matrices with minimum
顯示於類別:	[資訊工程學系] 研討會論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
s_e331_0075.pdf		25Kb	Adobe PDF	59	檢視/開啟

在CHUR中所有的資料項目都受到原著作權保護.