From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

被引：0
|
作者：
V. Berry
Z. S. Peng
H. F. Ting
机构：
[1] Université de Montpellier II–C.N.R.S.,Departement Informatique, L.I.R.M.M.
[2] The University of Hong Kong,Department of Computer Science
来源：
Algorithmica | 2008年 / 50卷
关键词：
Maximum agreement subtrees; Constrained maximum agreement subtrees; Consensus; Reduction; Bioinformatics; Evolutionary trees;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem in linear time and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST.
引用
收藏
页码：369 / 385
页数：16
相关论文
共 50 条
  • [1] From constrained to unconstrained maximum agreement subtree in linear time
    Berry, V.
    Peng, Z. S.
    Ting, H. F.
    ALGORITHMICA, 2008, 50 (03) : 369 - 385
  • [2] An efficient reduction from constrained to unconstrained maximum agreement subtree
    Peng, ZS
    Ting, HF
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2005, 3692 : 104 - 115
  • [3] The maximum agreement subtree problem
    Martin, Daniel M.
    Thatte, Bhalchandra D.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 1805 - 1817
  • [4] 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
  • [5] 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
  • [6] On the extremal maximum agreement subtree problem
    Markin, Alexey
    Discrete Applied Mathematics, 2021, 285 : 612 - 620
  • [7] On the extremal maximum agreement subtree problem
    Markin, Alexey
    DISCRETE APPLIED MATHEMATICS, 2020, 285 : 612 - 620
  • [8] Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
    Anders Dessmark
    Jesper Jansson
    Andrzej Lingas
    Eva-Marta Lundell
    Algorithmica, 2007, 48 : 233 - 248
  • [9] Polynomial-time algorithms for the ordered maximum agreement subtree problem
    Dessmark, A
    Jansson, J
    Lingas, A
    Lundell, EM
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 220 - 229
  • [10] Polynomial-time algorithms for the ordered maximum agreement subtree problem
    Dessmark, Anders
    Jansson, Jesper
    Lingas, Andrzej
    Lundell, Eva-Marta
    ALGORITHMICA, 2007, 48 (03) : 233 - 248
12345