On Determining if Tree-based Networks Contain Fixed Trees
Populations and Evolution
2016-02-09 v1 Data Structures and Algorithms
Abstract
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 NP-hard to decide, by reduction from 3-Dimensional Matching (3DM), and further, that the problem is fixed parameter tractable.
Keywords
Cite
@article{arxiv.1602.02739,
title = {On Determining if Tree-based Networks Contain Fixed Trees},
author = {Maria Anaya and Olga Anipchenko-Ulaj and Aisha Ashfaq and Joyce Chiu and Mahedi Kaiser and Max Shoji Ohsawa and Megan Owen and Ella Pavlechko and Katherine St. John and Shivam Suleria and Keith Thompson and Corrine Yap},
journal= {arXiv preprint arXiv:1602.02739},
year = {2016}
}
Comments
7 pages, 4 figures