Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms

被引：0
|
作者：
College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, United States [1 ]
机构：
来源：
SIAM J Comput | / 6卷 / 1656-1669期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] An improved bound on the maximum agreement subtree problem
    Steel, Mike
    Szekely, Laszlo A.
    APPLIED MATHEMATICS LETTERS, 2009, 22 (11) : 1778 - 1780
  • [22] An improved algorithm for the maximum agreement subtree problem
    Lee, CM
    Hung, LJ
    Chang, MS
    Shen, CB
    Tang, CY
    INFORMATION PROCESSING LETTERS, 2005, 94 (05) : 211 - 216
  • [23] An improved algorithm for the maximum agreement subtree problem
    Lee, CM
    Hung, LJ
    Chang, MS
    Tang, CY
    BIBE 2004: FOURTH IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, PROCEEDINGS, 2004, : 533 - 536
  • [24] On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
    Guillemot, Sylvain
    Nicolas, Francois
    Berry, Vincent
    Paul, Christophe
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1555 - 1570
  • [25] Algorithms for parameterized maximum agreement forest problem on multiple trees
    Shi, Feng
    Wang, Jianxin
    Chen, Jianer
    Feng, Qilong
    Guo, Jiong
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 207 - 216
  • [26] Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
    Chen, Jianer
    Fan, Jia-Hao
    Sze, Sing-Hoi
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 496 - 512
  • [27] KAIKOURA TREE THEOREMS - COMPUTING THE MAXIMUM AGREEMENT SUBTREE
    STEEL, M
    WARNOW, T
    INFORMATION PROCESSING LETTERS, 1993, 48 (02) : 77 - 82
  • [28] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    Peng, ZS
    Ting, HF
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 754 - 765
  • [29] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    Peng, Z. S.
    Ting, H. F.
    INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 137 - 144
  • [30] Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems
    Berry, Vincent
    Nicolas, Francois
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 3 (03) : 289 - 302
12345