| pubmed-article:17048404 | rdf:type | pubmed:Citation | lld:pubmed |
| pubmed-article:17048404 | lifeskim:mentions | umls-concept:C0205410 | lld:lifeskim |
| pubmed-article:17048404 | lifeskim:mentions | umls-concept:C0348080 | lld:lifeskim |
| pubmed-article:17048404 | lifeskim:mentions | umls-concept:C0917735 | lld:lifeskim |
| pubmed-article:17048404 | pubmed:issue | 2 | lld:pubmed |
| pubmed-article:17048404 | pubmed:dateCreated | 2006-10-19 | lld:pubmed |
| pubmed-article:17048404 | pubmed:abstractText | 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. | lld:pubmed |
| pubmed-article:17048404 | pubmed:language | eng | lld:pubmed |
| pubmed-article:17048404 | pubmed:journal | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:17048404 | pubmed:citationSubset | IM | lld:pubmed |
| pubmed-article:17048404 | pubmed:status | MEDLINE | lld:pubmed |
| pubmed-article:17048404 | pubmed:issn | 1545-5963 | lld:pubmed |
| pubmed-article:17048404 | pubmed:author | pubmed-author:SongYun SYS | lld:pubmed |
| pubmed-article:17048404 | pubmed:issnType | Print | lld:pubmed |
| pubmed-article:17048404 | pubmed:volume | 3 | lld:pubmed |
| pubmed-article:17048404 | pubmed:owner | NLM | lld:pubmed |
| pubmed-article:17048404 | pubmed:authorsComplete | Y | lld:pubmed |
| pubmed-article:17048404 | pubmed:pagination | 186-91 | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:meshHeading | pubmed-meshheading:17048404... | lld:pubmed |
| pubmed-article:17048404 | pubmed:articleTitle | A concise necessary and sufficient condition for the existence of a galled-tree. | lld:pubmed |
| pubmed-article:17048404 | pubmed:affiliation | Department of Computer Science, University of California at Davis, Davis, CA 95616, USA. yssong@cs.ucdavis.edu | lld:pubmed |
| pubmed-article:17048404 | pubmed:publicationType | Journal Article | lld:pubmed |
| pubmed-article:17048404 | pubmed:publicationType | Research Support, U.S. Gov't, Non-P.H.S. | lld:pubmed |
| http://linkedlifedata.com/r... | pubmed:referesTo | pubmed-article:17048404 | lld:pubmed |
| http://linkedlifedata.com/r... | pubmed:referesTo | pubmed-article:17048404 | lld:pubmed |
