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

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Seminar Papers > Item 987654321/30907

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/30907

Title:	Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix
Authors:	游坤明 Yu, K.M.
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	Parallel computing;branch-and-bound;evolutionary tree;distance matrices;minimum ultrametric trees.
Date:	2005
Issue Date:	2014-06-27 01:15:07 (UTC+8)
Abstract:	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
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0075.pdf		25Kb	Adobe PDF	64	View/Open