File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

TitleDeterministic Polynomial-Time Algorithms for Designing Short DNA Words
Authors
Issue Date2013
Citation
Theoretical Computer Science, 2013, v. 494, p. 144-160 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/185124
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorKao, MYen_US
dc.contributor.authorLeung, HCMen_US
dc.contributor.authorSun, Hen_US
dc.contributor.authorZhang, Yen_US
dc.date.accessioned2013-07-15T10:32:20Z-
dc.date.available2013-07-15T10:32:20Z-
dc.date.issued2013en_US
dc.identifier.citationTheoretical Computer Science, 2013, v. 494, p. 144-160en_US
dc.identifier.urihttp://hdl.handle.net/10722/185124-
dc.languageengen_US
dc.relation.ispartofTheoretical Computer Scienceen_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleDeterministic Polynomial-Time Algorithms for Designing Short DNA Wordsen_US
dc.typeArticleen_US
dc.identifier.emailLeung, HCM: cmleung2@cs.hku.hken_US
dc.identifier.emailZhang, Y: yongzh@hkucc.hku.hken_US
dc.identifier.authorityLeung, HCM=rp00144en_US
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.tcs.2012.12.030-
dc.identifier.hkuros215787en_US
dc.identifier.volume494en_US
dc.identifier.spage144en_US
dc.identifier.epage160en_US
dc.identifier.isiWOS:000321422500014-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats