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 条
  • [41] Fitting a reversible Markov chain by maximum likelihood: Converting an awkwardly constrained optimization problem to an unconstrained one
    MacDonald, Iain L.
    Pienaar, Etienne A. D.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 561
  • [42] The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
    Tınaz Ekim
    Mordechai Shalom
    Oylum Şeker
    Journal of Combinatorial Optimization, 2021, 41 : 710 - 735
  • [43] The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
    Ekim, Tinaz
    Shalom, Mordechai
    Seker, Oylum
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (03) : 710 - 735
  • [44] On the time to reach maximum for a variety of constrained Brownian motions
    Majumdar, Satya N.
    Randon-Furling, Julien
    Kearney, Michael J.
    Yor, Marc
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2008, 41 (36)
  • [45] Rate Constrained Discrete-time Maximum Principle
    Ganguly, Siddhartha
    Das, Souvik
    Chatterjee, Debasish
    Banavar, Ravi
    IFAC PAPERSONLINE, 2021, 54 (19): : 346 - 351
  • [46] The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
    Ekim, Tinaz
    Shalom, Mordechai
    Seker, Oylum
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 21 - 34
  • [47] Linear Antenna Array Synthesis for Unconstrained and Constrained Nulls Using Social Group Optimization Algorithm
    Sheik, A. R.
    Krishna, K. S. R.
    JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2019, 78 (09): : 601 - 603
  • [48] Unconstrained and constrained estimation of a linear EMG-to-force mapping during isometric force generation
    Borzelli, Daniele
    D'Avella, Andrea
    Gurgone, Sergio
    Gastaldi, Laura
    2022 IEEE INTERNATIONAL SYMPOSIUM ON MEDICAL MEASUREMENTS AND APPLICATIONS (MEMEA 2022), 2022,
  • [49] From unconstrained motion control to constrained case for holonomic mechanical systems
    Melhem, K.
    Saad, A.
    Abou, S. C.
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, VOLS 1-7, 2006, : 364 - +
  • [50] From an unconstrained model with quenched interactions to a constrained model with annealed interactions
    Fierro, A
    de Candia, A
    Coniglio, A
    JOURNAL OF PHYSICS-CONDENSED MATTER, 2002, 14 (07) : 1549 - 1556
12345