English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14644237      Online Users : 120
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrices

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/13925

    Title: Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrices
    Authors: Kun-Ming Yu
    Jiayi Zhou
    Chun-Yuan Lin
    Chuan Yi Tang
    Date: 2005
    Publisher: Institute of Electrical and Electronics Engineers Computer Society
    Keywords: Parallel computing
    distance matrices
    evolutionary tree
    minimum ultrametric trees
    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 cost. It is shown that to construct a minimum cost ultrametric tree is NP-hard. In this paper, we present an efficient parallel branch and bound algorithm to construct a minimum ultrametric tree with less cost. The experimental results show that our proposed algorithm can discover optimal solutions for 38 species within reasonable time with 16 computing nodes.
    Relation Link: http://webservices.ieee.org/pindex_basic.html
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13925
    Appears in Collections:[資訊工程學系] 會議論文
    [資訊系統與應用研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文
    [腦科學研究中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030209030031.pdf208KbAdobe PDF1179View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback