Perfect phylogenetic networks with recombination. [J Comput Biol. 2001]

SearchDatabase nameforSearch term

Advanced Search

Your browser version may not work well with NCBI's Web applications. More information here...

Display Show

All: 1

Review: 0

Click to change filter selection through MyNCBI.

1: J Comput Biol. 2001;8(1):69-78. Links

Perfect phylogenetic networks with recombination.

Wang L, Zhang K, Zhang L.

Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong. lwang@cs.cityu.edu.hk

The perfect phylogeny problem is a classical problem in evolutionary tree construction. In this paper, we propose a new model called phylogenetic network with recombination that takes recombination events into account. We show that the problem of finding a perfect phylogenetic network with the minimum number of recombination events is NP-hard; we also present an efficient polynomial time algorithm for an interesting restricted version of the problem.

PMID: 11339907 [PubMed - indexed for MEDLINE]

Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. [J Bioinform Comput Biol. 2004]
A decomposition theory for phylogenetic networks and incompatible characters. [J Comput Biol. 2007]
Reconstructing recombination network from sequence data: the small parsimony problem. [IEEE/ACM Trans Comput Biol Bioinform. 2007]
ReviewFixed-parameter algorithms in phylogenetics. [Methods Mol Biol. 2008]
ReviewAre you my mother? Bayesian phylogenetic inference of recombination among putative parental strains. [Appl Bioinformatics. 2003]

Display Show

Perfect phylogenetic networks with recombination.

Related Articles