Designing DNA Sequences Satisfing Combinational Constraints
DNA computing is a new computational model which is different from the traditional computational model and it uses the DNA sequences as the materials of information storage and hybridization reaction as computational principle. The accuracy of hybridization reaction immediately affects the reliability and the accuracy of DNA computing. Because of the limit of biologic technology, the emergence of false hybridization reaction is impossible to avoid. To decrease the emergence of false hybridization, many researchers design DNA sequences which satisfy constraints. In this paper, we use improved dynamic genetic algorithm to design DNA sequences which satisfy Hamming distance and h-distance combinational constraints. According to the known theoretical value, our experimental results improve the lower bounds which satisfy both constraints and further shorten the range. More importantly, using our results can decrease the emergence of false hybridization reaction, and improve the reliability and the scale of DNA computing.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
Document Type: Research Article
Publication date: 2010-06-01
More about this publication?
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites