Transforming rooted agreement into unrooted agreement

被引：1
|
作者：
Przytycka, TM [1 ]
机构：
[1] Johns Hopkins Univ, Sch Med, Dept Biophys, Baltimore, MD 21205 USA
来源：
JOURNAL OF COMPUTATIONAL BIOLOGY | 1998年 / 5卷 / 02期
关键词：
maximum agreement subtree; phylogenic tree; tree comparison;
D O I：
10.1089/cmb.1998.5.335
中图分类号：
Q5 [生物化学];
学科分类号：
071010 ; 081704 ;
摘要：
We give a simple technique that allows to transform dynamic programming type algorithms for the Maximum Agreement Subtree problem (MAST) for rooted trees into algorithms for the Maximum Agreement Subtree problem for unrooted trees (UMAST). Using this: technique we obtain an O(n log n)-time algorithm for the UMAST problem for binary trees. This matches the complexity of the best known algorithm for the rooted case.
引用
收藏
页码：335 / 349
页数：15
相关论文
共 50 条
  • [1] The agreement distance of unrooted phylogenetic networks
    Klawitter, Jonathan
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (01):
  • [2] The agreement distance of unrooted phylogenetic networks
    Klawitter, Jonathan, 1600, Discrete Mathematics and Theoretical Computer Science (22):
  • [3] The agreement problem for unrooted phylogenetic trees is FPT
    1600, Brown University (18):
  • [4] Reflections on kernelizing and computing unrooted agreement forests
    van Wersch, Rim
    Kelk, Steven
    Linz, Simone
    Stamoulis, Georgios
    ANNALS OF OPERATIONS RESEARCH, 2022, 309 (01) : 425 - 451
  • [5] Reflections on kernelizing and computing unrooted agreement forests
    Rim van Wersch
    Steven Kelk
    Simone Linz
    Georgios Stamoulis
    Annals of Operations Research, 2022, 309 : 425 - 451
  • [6] Rooted Maximum Agreement Supertrees
    Jesper Jansson
    Joseph H.-K. Ng
    Kunihiko Sadakane
    Wing-Kin Sung
    Algorithmica, 2005, 43 : 293 - 307
  • [7] Rooted maximum agreement supertrees
    Jansson, J
    Ng, JHK
    Sadakane, K
    Sung, WK
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 499 - 508
  • [8] Rooted maximum agreement supertrees
    Jansson, J
    Ng, JHK
    Sadakane, K
    Sung, WK
    ALGORITHMICA, 2005, 43 (04) : 293 - 307
  • [9] The agreement distance of rooted phylogenetic networks
    Klawitter, Jonathan
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (03):
  • [10] Characterizing compatibility and agreement of unrooted trees via cuts in graphs
    Vakati, Sudheer
    Fernandez-Baca, David
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2014, 9
12345