1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 1 cited
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees
Feng Shi, Jianer Chen, Qilong Feng +1
The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized ve…
cs.DS2014★ 1 cited
A -Vertex Kernel for Maximum Internal Spanning Tree
Wenjun Li, Jianxin Wang, Jianer Chen +1
We consider the parameterized version of the maximum internal spanning tree problem, which, given an -vertex graph and a parameter , asks for a spanning tree with at least $k…
cs.DS2014
Algorithms for Maximum Agreement Forest of Multiple General Trees
Feng Shi, Jianer Chen, Qilong Feng +2
The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees…