English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Deterministic Polynomial-time Algorithms for Designing short DNA Words

MPS-Authors
/persons/resource/persons45576

Sun,  He
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Kao, M.-Y., Leung, H. C. M., Sun, H., & Zhang, Y. (2013). Deterministic Polynomial-time Algorithms for Designing short DNA Words. Theoretical Computer Science, 494, 144-160. doi:10.1016/j.tcs.2012.12.030.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-48F4-3
Abstract
There is no abstract available