A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes

  • Authors:

  • Arkadii G. D'yachkov;Anthony J. Macula;Wendy K. Pogozelski;Thomas E. Renz;Vyacheslav V. Rykov;David C. Torney

  • Affiliations:

  • Dept. of Probability Theory, Moscow State Univ., Moscow, Russia;Air Force Research Lab, IFTC, Rome Research Site, Rome, NY;Department of Chemistry, SUNY Geneseo, Geneseo, NY;Air Force Research Lab, IFTC, Rome Research Site, Rome, NY;Dept. of Mathematics, University of Nebraska-Omaha, Omaha, NE;Theoretical Biology and Biophys, Los Alamos Natl. Lab, Los Alamos, NM

  • Venue:
  • DNA'04 Proceedings of the 10th international conference on DNA computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Thermodynamic distance functions are important components in the construction of DNA codes and DNA codewords are structural and information building blocks in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. We introduce new metrics for DNA code design that capture key aspects of the nearest neighbor thermodynamic model for hybridized DNA duplexes. One version of our metric gives the maximum number of stacked pairs of hydrogen bonded nucleotide base pairs that can be present in any secondary structure in a hybridized DNA duplex without pseudoknots. We introduce the concept of (t-gap) block isomorphic subsequences to describe new string metrics that are similar to the weighted Levenshtein insertion-deletion metric. We show how our new distances can be calculated by a generalization of the folklore longest common subsequence dynamic programming algorithm. We give a Varshamov-Gilbert like lower bound on the size of some of codes using our distance functions as constraints. We also discuss software implementation of our DNA code design methods.