Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Improved lower bounds for cons...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Improved lower bounds for constant GC-content DNA codes

Improved lower bounds for constant GC-content DNA codes

The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming distance constraints between oligonucleotides and their Watson-Crick complements is important in reducing hybridization errors in DNA computing, DNA microarray technologies, and molecular bar coding....

Full description

Bibliographic Details
Main Authors: Chee, Yeow Meng, Ling, San
Other Authors: School of Physical and Mathematical Sciences
Format: Journal Article
Language:English
Published: 2009
Subjects:
DRNTU::Science::Mathematics::Applied mathematics
Online Access:https://hdl.handle.net/10356/91610
http://hdl.handle.net/10220/6033
http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EBSCO_APH&id=doi:&genre=&isbn=&issn=00189448&date=2008&volume=54&issue=1&spage=391&epage=394&aulast=Yeow&aufirst=Meng%20Chee&auinit=&title=IEEE%20Transactions%20on%20Information%20Theory&atitle=Improved%20Lower%20Bounds%20for%20Constant%20GC%2DContent%20DNA%20Codes%2E
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://hdl.handle.net/10356/91610
http://hdl.handle.net/10220/6033
http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EBSCO_APH&id=doi:&genre=&isbn=&issn=00189448&date=2008&volume=54&issue=1&spage=391&epage=394&aulast=Yeow&aufirst=Meng%20Chee&auinit=&title=IEEE%20Transactions%20on%20Information%20Theory&atitle=Improved%20Lower%20Bounds%20for%20Constant%20GC%2DContent%20DNA%20Codes%2E

Similar Items

  • On the constructions of constant-composition codes from perfect nonlinear functions
    by: Li, Chao, et al.
    Published: (2013)
  • The sizes of optimal q-ary codes of weight three and distance four : a complete solution
    by: Ling, Alan C. H., et al.
    Published: (2009)
  • Constructions for q-ary constant-weight codes
    by: Chee, Yeow Meng, et al.
    Published: (2009)
  • The PBD-closure of constant-composition codes
    by: Ling, Alan C. H., et al.
    Published: (2009)
  • Linear size optimal q-ary constant-weight codes and constant-composition codes
    by: Ling, Alan C. H., et al.
    Published: (2012)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs