de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Deterministic Polynomial-time Algorithms for Designing Short DNA Words

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45576

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Kao, M.-Y., Leung, H. C. M., Sun, H., & Zhang, Y. (2010). Deterministic Polynomial-time Algorithms for Designing Short DNA Words. In J. Kratchovil, A. Li, J. Fiala, & P. Kolman (Eds.), Theory and Applications of Models of Computation (pp. 308-319). Berlin: Springer. doi:10.1007/978-3-642-13562-0_28.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1640-B
Abstract
There is no abstract available