Source:http://linkedlifedata.com/resource/pubmed/id/17048404
Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
2
|
| pubmed:dateCreated |
2006-10-19
|
| 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.
|
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:citationSubset |
IM
|
| pubmed:status |
MEDLINE
|
| pubmed:issn |
1545-5963
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
3
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
186-91
|
| pubmed:meshHeading |
pubmed-meshheading:17048404-Algorithms,
pubmed-meshheading:17048404-Computational Biology,
pubmed-meshheading:17048404-Evolution, Molecular,
pubmed-meshheading:17048404-Meiosis,
pubmed-meshheading:17048404-Models, Genetic,
pubmed-meshheading:17048404-Phylogeny,
pubmed-meshheading:17048404-Recombination, Genetic
|
| pubmed:articleTitle |
A concise necessary and sufficient condition for the existence of a galled-tree.
|
| pubmed:affiliation |
Department of Computer Science, University of California at Davis, Davis, CA 95616, USA. yssong@cs.ucdavis.edu
|
| pubmed:publicationType |
Journal Article,
Research Support, U.S. Gov't, Non-P.H.S.
|