A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees

作者：

Highlights：

• The first study of the MAF problem on multiple rooted multifurcating trees.

• Introduction of a new branch-and-bound strategy that can branch on different trees.

• An algorithm even faster than known algorithms for restricted versions of the problem.

摘要

•The first study of the MAF problem on multiple rooted multifurcating trees.•Introduction of a new branch-and-bound strategy that can branch on different trees.•An algorithm even faster than known algorithms for restricted versions of the problem.

论文关键词：Maximum agreement forest,Phylogenetic tree,Algorithm

论文评审过程：Received 11 October 2015, Revised 4 September 2016, Accepted 15 March 2018, Available online 25 April 2018, Version of Record 13 August 2018.

论文官网地址：https://doi.org/10.1016/j.jcss.2018.03.002