CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2006 vol.3 Issue No.02 - April-June
Issue No.02 - April-June (2006 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2006.15
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.
Galled-trees, recombination, quadpartition, incompatibility.
Yun S. Song, "A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, no. 2, pp. 186-191, April-June 2006, doi:10.1109/TCBB.2006.15