DNA Tag-Antitags (TAT) Codes
Abstract
This research addresses the initial stages of the development of an enabling technology for DNA computing and other biological assay applications. This work combines mathematics, computer science and chemistry. It is focused on the construction of a biomolecular architecture designed to employ new algorithmic paradigms based on the massively parallel computational power of DNA hybridization. The ultimate intent is to develop a computing basis to eventually overcome the exponential time complexity of many discrete math problems so that they can be solved in linear real time. Many of these computationally hard (NP) problems are critical to logistics, scheduling and security. In particular, we made an initial application of biomolecular computing methods to data mining. Data mining has important applications to information security, assurance and superiority. In this research, we developed methods of generating large collections of single stranded DNA sequences called a DNA (n,d)code. DNA(n,d) codes serve as universal components for biomolecular computing. DNA(n,d) codes are closed under reverse-complementation. The strands in a DNA(n,d) code have such binding specificity that a code strand will only hybridize with its reverse-complement and will not cross hybridize with any other code strand in the DNA(n,d) code. Such collections of strands are crucial to the success of DNA computing.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 2003
- Accession Number
- ADA412974
Entities
People
- Anthony J. Macula
Organizations
- State University of New York at Geneseo