English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14642091      Online Users : 63
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 > 電機資訊學院 > 資訊工程學系 > 會議論文  >  An improved algorithm for the maximum agreement subtree problem

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

    Title: An improved algorithm for the maximum agreement subtree problem
    Authors: Lee,Chuan-Min
    Date: 2004
    Publisher: Institute of Electrical and Electronics Engineers Computer Society
    Keywords: Trees
    Problem solving
    Binary codes
    Dynamic programming
    Set theory
    Computational complexity
    Theorem proving
    Abstract: In this paper, we solve the maximum agreement subtree problem for a set T of k rooted, leaf-labelled evolutionary trees on n leaves where T contains a binary tree. We show that the O(kn3)-time dynamic programming algorithm proposed by Farach et al. and Bryant [7] can be implemented in O(n2logk-1n) and O(k · n3-1/k-1) using the k-dimensional binary search tree and the k-dimensional range search tree, respectively.
    Relation Link: Bioinformatics and Bioengineering, 2004. BIBE 2004. Proceedings. Fourth IEEE Symposium on 19-21 May 2004 Page(s):533 - 536
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13922
    Appears in Collections:[資訊工程學系] 會議論文
    [資訊系統與應用研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文
    [腦科學研究中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030209030005.pdf278KbAdobe PDF1098View/Open


    SFX Query


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