Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies

Bull Math Biol. 2013 Oct;75(10):1879-90. doi: 10.1007/s11538-013-9874-x. Epub 2013 Aug 8.

Abstract

Recently, we have shown that calculating the minimum-temporal-hybridization number for a set [Formula: see text] of rooted binary phylogenetic trees is NP-hard and have characterized this minimum number when [Formula: see text] consists of exactly two trees. In this paper, we give the first characterization of the problem for [Formula: see text] 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.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Computational Biology
  • Hybridization, Genetic
  • Mathematical Concepts
  • Models, Genetic*
  • Phylogeny*