Journal of Computational Biology · 2001 · 216 citations · 9 references
Life SciencesBiologyEvolutionary BiologyEvolutionary TheoryPhylogeneticsRecombinationEvolutionary RelationshipsPhylogenetic AnalysisPhylogenetic Network AnalysisPhylogenetic TheoryPhylogenetic Tree ReconstructionNetwork PhylogeneticsPerfect Phylogenetic NetworksPolynomial Time ComplexityPolynomial-time Algorithms
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.
9
Efficient algorithms for inferring evolutionary trees
Dan Gusfield · Networks · 1991 · 424 citations
Life Sciences, Evolutionary Biology, Evolutionary Theory +10
On the complexity of comparing evolutionary trees
Jotun Hein, Tao Jiang, Lusheng Wang et al. · Discrete Applied Mathematics · 1996 · 239 citations
Franklin W. Stahl · Scientific American · 1987 · 199 citations