Journal
BULLETIN OF MATHEMATICAL BIOLOGY
Volume 75, Issue 10, Pages 1879-1890Publisher
SPRINGER
DOI: 10.1007/s11538-013-9874-x
Keywords
Cherry; Fixed-parameter tractability; Phylogenetic network; Phylogenetic tree; Temporal network
Categories
Funding
- Marie Curie International Outgoing Fellowship within the 7th European Community Framework Programme
- New Zealand Marsden Fund
- Allan Wilson Centre for Molecular Ecology and Evolution
Ask authors/readers for more resources
Recently, we have shown that calculating the minimum-temporal-hybridization number for a set of rooted binary phylogenetic trees is NP-hard and have characterized this minimum number when consists of exactly two trees. In this paper, we give the first characterization of the problem for being arbitrarily large. The characterization is in terms of cherries and the existence of a particular type of sequence. Furthermore, in an online appendix to the paper, we show that this new characterization can be used to show that computing the minimum-temporal hybridization number for two trees is fixed-parameter tractable.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
