A concise necessary and sufficient condition for the existence of a galled-tree.
Galled-trees are a special class of graphical representation of evolutionary history that has proven amenable to efficient, polynomial-time algorithms. The goal of this paper is to construct a concise necessary and sufficient condition for the existence of a galled-tree for M, a set of binary sequences that purportedly have evolved in the presence of recombination. Both root-known and root-unknown cases are considered here.
Song
Yun S
YS
Department of Computer Science, University of California at Davis, Davis, CA 95616, USA. yssong@cs.ucdavis.edu
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D008540:Meiosis / Q000235:genetics; D008957:Models, Genetic; D010802:Phylogeny; D011995:Recombination, Genetic / Q000235:genetics*