This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree
April-June 2006 (vol. 3 no. 2)
pp. 186-191
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.
Index Terms:
Galled-trees, recombination, quadpartition, incompatibility.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.