Computer Science – Information Theory
Scientific paper
2008-03-26
IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 391-394, 2008
Computer Science
Information Theory
4 pages
Scientific paper
10.1109/TIT.2007.911167
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. We introduce a new stochastic local search method which yields improvements up to more than one third of the benchmark lower bounds of Gaborit and King (2005) for n-mer oligonucleotide libraries when n <= 14. We also found several optimal libraries by computing maximum cliques on certain graphs.
Chee Yeow Meng
Ling San
No associations
LandOfFree
Improved Lower Bounds for Constant GC-Content DNA Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved Lower Bounds for Constant GC-Content DNA Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Lower Bounds for Constant GC-Content DNA Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-49509