Improved lower bounds for constant GC-content DNA codes

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

Improved lower bounds for constant GC-content DNA codes

Show simple item record

dc.contributor.author Chee, Yeow Meng
dc.contributor.author Ling, San
dc.date.accessioned 2009-08-11T06:13:51Z
dc.date.available 2009-08-11T06:13:51Z
dc.date.copyright 2008
dc.date.issued 2009-08-11T06:13:51Z
dc.identifier.citation Chee, Y. M., & Ling, S. (2008). Improved lower bounds for constant GC-content DNA codes. IEEE Transactions on Information Theory, 54(1), 391-394.
dc.identifier.issn 0018-9448
dc.identifier.uri http://hdl.handle.net/10220/6033
dc.description.abstract 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.
dc.format.extent 4 p.
dc.language.iso en
dc.relation.ispartofseries IEEE transactions on information theory
dc.rights IEEE Transactions on Information Theory © copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site.
dc.subject DRNTU::Science::Mathematics::Applied mathematics
dc.title Improved lower bounds for constant GC-content DNA codes
dc.type Journal Article
dc.contributor.school School of Physical and Mathematical Sciences
dc.identifier.openurl 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
dc.identifier.doi http://dx.doi.org/10.1109/TIT.2007.911167
dc.description.version Published version

Files in this item

Files Size Format View Description
dna.pdf 206.6Kb PDF View/Open Published version

This item appears in the following Collection(s)

Show simple item record


Total views

All Items Views
Improved lower bounds for constant GC-content DNA codes 399

Total downloads

All Bitstreams Views
dna.pdf 167

Top country downloads

Country Code Views
United States of America 74
China 33
Singapore 17
Russian Federation 8
France 7

Top city downloads

city Views
Mountain View 50
Singapore 17
Beijing 4
Chicago 2
Shenzhen 2