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 proved amenable to efcient, polynomial-time algorithms. The goal of this paper is to construct a concise necessary and sufcient 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..