The Community for Technology Leaders
Green Image
Issue No. 02 - April-June (2006 vol. 3)
ISSN: 1545-5963
pp: 186-191
Y.S. Song , Dept. of Comput. Sci., California Univ., Davis, CA
ABSTRACT
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
Sufficient conditions, Polynomials, Genetic mutations, Binary sequences, History, Biological processes, Qualifications, Evolution (biology), Tree graphs, Testing
CITATION

Y. Song, "A concise necessary and sufficient condition for the existence of a galled-tree," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 2, pp. 186-191, 2008.
doi:10.1109/TCBB.2006.15
89 ms
(Ver 3.3 (11022016))