1.
Bull Math Biol
; 78(5): 961-9, 2016 05.
Artigo
em Inglês
| MEDLINE
| ID: mdl-27125655
RESUMO
We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.