10636040

Source:http://linkedlifedata.com/resource/pubmed/id/10636040

Download in:

Switch to

Custom View

Named Graph Language Inference

Statements in which the resource exists as a subject.
Predicate	Object
rdf:type	pubmed:Citation
lifeskim:mentions	umls-concept:C1145667, umls-concept:C1167622, umls-concept:C1444754, umls-concept:C1521991, umls-concept:C1880157, umls-concept:C2349209, umls-concept:C2825311
pubmed:issue	1-3
pubmed:dateCreated	2000-2-25
pubmed:abstractText	The length of DNA strands is an important resource in DNA computing. We show how to decrease strand lengths in known molecular algorithms for some NP-complete problems, such as like 3-SAT and Independent Set, without substantially increasing their running time or volume.
pubmed:language	eng
pubmed:journal	http://linkedlifedata.com/resource/pubmed/journal/0430773
pubmed:citationSubset	IM
pubmed:chemical	http://linkedlifedata.com/resource/pubmed/chemical/DNA
pubmed:status	MEDLINE
pubmed:month	Oct
pubmed:issn	0303-2647
pubmed:author	pubmed-author:BeigelRR, pubmed-author:GOEE
pubmed:issnType	Print
pubmed:volume	52
pubmed:owner	NLM
pubmed:authorsComplete	Y
pubmed:pagination	155-63
pubmed:dateRevised	2006-11-15
pubmed:meshHeading	pubmed-meshheading:10636040-Algorithms, pubmed-meshheading:10636040-Animals, pubmed-meshheading:10636040-Computational Biology, pubmed-meshheading:10636040-Computer Simulation, pubmed-meshheading:10636040-DNA, pubmed-meshheading:10636040-Humans, pubmed-meshheading:10636040-Models, Molecular
pubmed:year	1999
pubmed:articleTitle	Length bounded molecular computing.
pubmed:affiliation	Epson Palo Alto Laboratory, Epson Research and Development, Inc., Palo Alto, CA 94304, USA. fu.bin@erd.epson.com
pubmed:publicationType	Journal Article, Research Support, U.S. Gov't, Non-P.H.S.