A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees

被引：0
|
作者：
Feng SHI [1 ]
Jianxin WANG [1 ]
Yufei YANG [1 ]
Qilong FENG [1 ]
Weilong LI [1 ]
Jianer CHEN [1 ,2 ]
机构：
[1] School of Information Science and Engineering, Central South University
[2] Department of Computer Science and Engineering, Texas A&M University, College Station
来源：
Science China(Information Sciences) | 2016年 / 59卷 / 01期
基金：
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词：
computational biology; multifurcating phylogenetic tree; maximum agreement forest; TBR distance; fixed-parameter algorithm;
D O I：
暂无
中图分类号：
TP301.6 [算法理论];
学科分类号：
081202 ;
摘要：
The Maximum Agreement Forest(MAF) problem on two given phylogenetic trees is an important NP-hard problem in the field of computational biology. In this paper, we study the parameterized version of the MAF problem: given two unrooted(multifurcating) phylogenetic trees Tand Twith the same leaf-label set L, and a parameter k, either construct an agreement forest of at most k trees for Tand T, or report that no such a forest exists. Whether there is a fixed-parameter tractable algorithm for this problem was posed as an open problem several times in the literature. In this paper, we resolve this open problem by presenting a parameterized algorithm of running time O(4~kn~5) for the problem.
引用
收藏
页码：66 / 79
页数：14
相关论文
共 50 条
  • [1] A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees
    Shi, Feng
    Wang, Jianxin
    Yang, Yufei
    Feng, Qilong
    Li, Weilong
    Chen, Jianer
    SCIENCE CHINA-INFORMATION SCIENCES, 2016, 59 (01) : 1 - 14
  • [2] Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees
    Whidden, Chris
    Beiko, Robert G.
    Zeh, Norbert
    ALGORITHMICA, 2016, 74 (03) : 1019 - 1054
  • [3] Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees
    Chris Whidden
    Robert G. Beiko
    Norbert Zeh
    Algorithmica, 2016, 74 : 1019 - 1054
  • [4] A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees
    Shi, Feng
    Chen, Jianer
    Feng, Qilong
    Wang, Jianxin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018, 97 : 28 - 44
  • [5] A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees多叉树最大一致森林问题参数算法研究
    Feng Shi
    Jianxin Wang
    Yufei Yang
    Qilong Feng
    Weilong Li
    Jianer Chen
    Science China Information Sciences, 2016, 59 : 1 - 14
  • [6] Fixed-parameter tractability of the Maximum Agreement Supertree problem
    Guillemot, Sylvain
    Berry, Vincent
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 274 - +
  • [7] Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
    Guillemot, Sylvain
    Berry, Vincent
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2010, 7 (02) : 342 - 353
  • [8] Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
    Chen, Jianer
    Fan, Jia-Hao
    Sze, Sing-Hoi
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 496 - 512
  • [9] FIXED-PARAMETER ALGORITHMS FOR MAXIMUM AGREEMENT FORESTS
    Whidden, Chris
    Beiko, Robert G.
    Zeh, Norbert
    SIAM JOURNAL ON COMPUTING, 2013, 42 (04) : 1431 - 1466
  • [10] 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
12345