Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees

@inproceedings{Vu2013ReconstructingKP,
  title={Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees},
  author={Hoa Vu and Francis Y. L. Chin and Wing-Kai Hon and Henry C. M. Leung and Kunihiko Sadakane and Wing-Kin Sung and Siu-Ming Yiu},
  booktitle={ISBRA},
  year={2013}
}
The time complexity of existing algorithms for reconstructing a level-x phylogenetic network increases exponentially in x. In this paper, we propose a new classification of phylogenetic networks called k-reticulated network. A k-reticulated network can model all level-k networks and some level-x networks with x > k. We design algorithms for reconstructing kreticulated network (k = 1 or 2) with minimum number of hybrid nodes from a set of m binary trees, each with n leaves in O(mn) time. The… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.