English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. Item Summary / 
  2. View item

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Deterministic Polynomial-time Algorithms for Designing short DNA Words

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-48F4-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-48F5-1
Genre: Journal Article
Latex : Deterministic Polynomial-time Algorithms for Designing short {DNA} Words

Files

show Files

Locators

show
hide
Locator:
Link (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Kao, Ming-Yang1, Author
Leung, Henry C. M.1, Author
Sun, He2, Author           
Zhang, Yong1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1016/j.tcs.2012.12.030
BibTex Citekey: DBLP:journals/tcs/KaoL0Z13
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 494 Sequence Number: - Start / End Page: 144 - 160 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450