A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree
Yun S. Song · IEEE Transactions on Computational Biology and Bioinformatics · 2006
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.