FIXED-PARAMETER ALGORITHMS FOR MAXIMUM AGREEMENT FORESTS

被引：56
|
作者：
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 条
  • [21] Fixed-Parameter Algorithms for Unsplittable Flow Cover
    Andrés Cristi
    Mathieu Mari
    Andreas Wiese
    Theory of Computing Systems, 2023, 67 : 89 - 124
  • [22] Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
    Hoang, Viet Tung
    Sung, Wing-Kin
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 361 - 372
  • [23] Two Fixed-Parameter Algorithms for the Cocoloring Problem
    Campos, Victor
    Klein, Sulamita
    Sampaio, Rudini
    Silva, Ana
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 634 - +
  • [24] Fixed-Parameter Algorithms for Cluster Vertex Deletion
    Hueffner, Falk
    Komusiewicz, Christian
    Moser, Hannes
    Niedermeier, Rolf
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (01) : 196 - 217
  • [25] Ubiquitous parameterization - Invitation to fixed-parameter algorithms
    Niedermeier, R
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 84 - 103
  • [26] Fixed-parameter algorithms for cluster vertex deletion
    Hueffner, Falk
    Komusiewicz, Christian
    Moser, Hannes
    Niedermeier, Rolf
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 711 - 722
  • [27] Fixed-Parameter Algorithms for Unsplittable Flow Cover
    Cristi, Andres
    Mari, Mathieu
    Wiese, Andreas
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [28] Fixed-Parameter and Approximation Algorithms for PCA with Outliers
    Dahiya, Yogesh
    Fomin, Fedor
    Panolan, Fahad
    Simonov, Kirill
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [29] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Federico Corò
    Gianlorenzo D’Angelo
    Vahan Mkrtchyan
    Theory of Computing Systems, 2020, 64 : 1094 - 1109
  • [30] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Coro, Federico
    D'Angelo, Gianlorenzo
    Mkrtchyan, Vahan
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (06) : 1094 - 1109
12345