FIXED-PARAMETER ALGORITHMS FOR MAXIMUM AGREEMENT FORESTS

被引：59
|
作者：
Whidden, Chris [1 ]
Beiko, Robert G. [1 ]
Zeh, Norbert [1 ]
机构：
[1] Dalhousie Univ, Fac Comp Sci, Halifax, NS, Canada
来源：
SIAM JOURNAL ON COMPUTING | 2013年 / 42卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
fixed-parameter tractability; phylogenetics; subtree prune-and-regraft distance; lateral gene transfer; hybridization; agreement forest; HYBRIDIZATION NUMBER; PHYLOGENETIC TREES; COMPUTATION; EVENTS; FPT; APPROXIMATION; COMPLEXITY; DISTANCE;
D O I：
10.1137/110845045
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft distance and, if the agreement forest is acyclic, to their hybridization number. These distance measures are essential tools for understanding reticulate evolution. Our algorithm for computing maximum acyclic agreement forests is the first depth-bounded search algorithm for this problem. Our algorithms substantially outperform the best previous algorithms for these problems.
引用
收藏
页码：1431 / 1466
页数：36
相关论文
共 50 条
  • [41] Fixed-parameter tractable algorithms for Tracking Shortest Paths
    Banik, Aritra
    Choudhary, Pratibha
    Raman, Venkatesh
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2020, 846 : 1 - 13
  • [42] Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
    Brand, Cornelius
    Ganian, Robert
    Roeder, Sebastian
    Schager, Florian
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT II, 2023, 14466 : 66 - 81
  • [43] On efficient fixed-parameter algorithms for weighted vertex cover
    Niedermeier, R
    Rossmanith, P
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 47 (02): : 63 - 77
  • [44] Improved kernelization and fixed-parameter algorithms for bicluster editing
    Lafond, Manuel
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (05)
  • [45] Randomized Fixed-Parameter Algorithms for the Closest String Problem
    Zhi-Zhong Chen
    Bin Ma
    Lusheng Wang
    Algorithmica, 2016, 74 : 466 - 484
  • [46] Fixed-parameter algorithms for Fair Hitting Set problems
    Inamdar, Tanmay
    Kanesh, Lawqueen
    Kundu, Madhumita
    Purohit, Nidhi
    Saurabh, Saket
    INFORMATION AND COMPUTATION, 2025, 302
  • [47] Fixed-Parameter Tractable Algorithms for Tracking Set Problems
    Banik, Aritra
    Choudhary, Pratibha
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018, 2018, 10743 : 93 - 104
  • [48] Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
    Kratsch, Stefan
    Neumann, Frank
    ALGORITHMICA, 2013, 65 (04) : 754 - 771
  • [49] Randomized Fixed-Parameter Algorithms for the Closest String Problem
    Chen, Zhi-Zhong
    Ma, Bin
    Wang, Lusheng
    ALGORITHMICA, 2016, 74 (01) : 466 - 484
  • [50] Two fixed-parameter tractable algorithms for testing upward planarity
    Healy, Patrick
    Lynch, Karol
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (05) : 1095 - 1114
12345