Improved lower bounds for constant GC-content DNA codes

• Main Authors: Chee, Yeow Meng, Ling, San
• Other Authors: School of Physical and Mathematical Sciences
• Format: 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
• Institution: Nanyang Technological University

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. Various techniques have been studied for the construction of such oligonucleotide libraries, ranging from algorithmic constructions via stochastic local search to theoretical constructions via coding theory. A new stochastic local search method is introduced, which yields improvements for more than one third of the benchmark lower bounds of Gaborit and King (2005) for n-mer oligonucleotide libraries when n ≤14. Several optimal libraries are also found by computing maximum cliques on certain graphs.