Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

@article{Gusfield2005OptimalER,
  title={Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination},
  author={Dan Gusfield},
  journal={J. Comput. Syst. Sci.},
  year={2005},
  volume={70},
  pages={381-398}
}
Phylogenetic networks are models of sequence evolution that go beyond trees, allowing biological operations that are not consistent with tree-like evolution. One of the most important of these biological operations is (single-crossover) recombination between two sequences. is to find a phylogenetic network that derives an input set of sequences, minimizing the number of recombinations used. No efficient, general algorithm is known for that problem. An efficient algorithm does exist for the… CONTINUE READING