Welcome to the InfoSci Platform
Reference Hub1
Geometric Approaches to Gibbs Energy Landscapes and DNA Oligonucleotide Design

Geometric Approaches to Gibbs Energy Landscapes and DNA Oligonucleotide Design

Max H. Garzon, Kiran C. Bobba
Copyright: © 2011 |Volume: 3 |Issue: 3 |Pages: 15
ISSN: 1941-6318|EISSN: 1941-6326|EISBN13: 9781613508572|DOI: 10.4018/ijnmc.2011070104
Cite Article Cite Article

MLA

Garzon, Max H., and Kiran C. Bobba. "Geometric Approaches to Gibbs Energy Landscapes and DNA Oligonucleotide Design." IJNMC vol.3, no.3 2011: pp.42-56. http://doi.org/10.4018/ijnmc.2011070104

APA

Garzon, M. H. & Bobba, K. C. (2011). Geometric Approaches to Gibbs Energy Landscapes and DNA Oligonucleotide Design. International Journal of Nanotechnology and Molecular Computation (IJNMC), 3(3), 42-56. http://doi.org/10.4018/ijnmc.2011070104

Chicago

Garzon, Max H., and Kiran C. Bobba. "Geometric Approaches to Gibbs Energy Landscapes and DNA Oligonucleotide Design," International Journal of Nanotechnology and Molecular Computation (IJNMC) 3, no.3: 42-56. http://doi.org/10.4018/ijnmc.2011070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

DNA codeword design has been a fundamental problem since the early days of DNA computing. The problem calls for finding large sets of single DNA strands that do not crosshybridize to themselves, to each other or to others' complements. Such strands represent so-called domains, particularly in the language of chemical reaction networks (CRNs). The problem has shown to be of interest in other areas as well, including DNA memories and phylogenetic analyses because of their error correction and prevention properties. In prior work, a theoretical framework to analyze this problem has been developed and natural and simple versions of Codeword Design have been shown to be NP-complete using any single reasonable metric that approximates the Gibbs energy, thus practically making it very difficult to find any general procedure for finding such maximal sets exactly and efficiently. In this framework, codeword design is partially reduced to finding large sets of strands maximally separated in DNA spaces and, therefore, the size of such sets depends on the geometry of these spaces. Here, the authors describe in detail a new general technique to embed them in Euclidean spaces in such a way that oligonucleotides with high (low, respectively) hybridization affinity are mapped to neighboring (remote, respectively) points in a geometric lattice. This embedding materializes long-held metaphors about codeword design in analogies with error-correcting code design in information theory in terms of sphere packing and leads to designs that are in some cases known to be provably nearly optimal for small oligonucleotide sizes, whenever the corresponding spherical codes in Euclidean spaces are known to be so. It also leads to upper and lower bounds on estimates of the size of optimal codes of size under 20-mers, as well as to a few infinite families of DNA strand lengths, based on estimates of the kissing (or contact) number for sphere codes in high-dimensional Euclidean spaces. Conversely, the authors show how solutions to DNA codeword design obtained by experimental or other means can also provide solutions to difficult spherical packing geometric problems via these approaches. Finally, the reduction suggests a tool to provide some insight into the approximate structure of the Gibbs energy landscapes, which play a primary role in the design and implementation of biomolecular programs.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.