Summary
Bioinformatics studies the acquisition, process, store, distribution, analysis, etc of biological information so as to understand the meanings of biological data by means of mathematics, computer science and biological techniques. Some researches on Bioinformatics, such as the properties of DNA and the Watson-Crick’s law, provide a probability of computing with DNA molecules. DNA computing is a new computational paradigm that executes parallel computation with DNA molecules based on the Watson-Crick’s law. The procedure of DNA computing can be divided into three stages: encoding information, computation (molecular operations) and extraction of solution. The stage of encoding information is the first and most important step, which directly affects the formation of optimal solution. The methods of encoding information can be divided into two classes: the methods of encoding information in graphs without weights and the methods of encoding information in graphs with weights. The previous researches, which belong to the first class, such as Adleman’s encoding method [1] for the directed Hamiltonian path problem, Lipton’s encoding method [2] for the SAT problem, and Ouyang’s encoding method [3] for the maximal clique problem, do not require the consideration of weight representation in DNA strands. However, there are many practical applications related to weights. Therefore, weight representation in DNA strand is an important issue toward expanding the capability of DNA computing to solve optimization problems. Narayanan et al [6] presented a method of encoding weights by the lengths of DNA strands. Shin et al [6] proposed a method of encoding weights by the number of hydrogen bonds in fixed-length DNA strand. Yamamoto et al [7] proposed a method of encoding weights by the concentrations of DNA strands. Lee et al [9] proposed a method of encoding weights by the melting temperatures of fixed-length DNA strands. Han et al [10, 11] proposed a method of encoding weights by means of the general line graph. They also gave a method of encoding weights [12] by means of the relative length graph and several improved DNA encoding methods [13–16] for the maximal weight clique problem, the traveling salesman problem, the minimum spanning tree problem and the 0/1 knapsack problem. In this chapter, I collect and classify the present methods of encoding information in DNA strands, which will benefit the further research on DNA computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman L M (1994) Molecular Computation of Solutions to Combinatorial problems. Science 266:1021–1024
Lipton R J (1995) DNA solution of hard computational problems. Science 268:542–545
Ouyang Q, Kaplan P D, Liu S, et al (1997) DNA solution of the maximal clique problem. Science 278:446–449
Head T, Rozenberg G, Bladergroen R S, et al (2000) Computing with DNA by operating on plasmids. Biosystems 57:87–93
Sakamoto K, Gouzu H, Komiya K, et al (2000) Molecular computation by DNA hairpin formation. Science 288:1223–1226
Narayanan A, Zorbalas S, et al (1998) DNA algorithms for computing shortest paths. In: Proceedings of the Genetic Programming, Morgan Kaufmann 718–723
Shin S Y, Zhang B T, Jun S S, et al (1999) Solving traveling salesman problems using molecular programming. In: Proceedings of the Congress on Evolutionary Computation. IEEE Press 994–1000
Yamamoto M, Matsuura N, Shiba T, et al (2002) Solutions of shortest path problems by concentration control. Lecture Notes in Computer Science 2340:203–212
Lee J Y, Shin S Y, Park T H, et al (2004) Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78:39–47
Han A, Zhu D (2006) DNA Encoding Method of Weight for Chinese Postman Problem. In: Proceedings of 2006 IEEE Congress on Evolutionary Computation. IEEE Press 2696–2701
Han A, Zhu D (2007) DNA Computing Model Based on a New Scheme of Encoding Weight for Chinese Postman Problem. Computer Research and Development 44:1053–1062
Han A (2006) RLM: A New Method of Encoding Weights in DNA Strands. In: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems. IEEE Press 118–121
Han A, Zhu D (2006) A New DNA-Based Approach to Solve the Maximum Weight Clique Problem. Lecture Notes in Computer Science 4115:320–327
Han A, Zhu D (2006) A New DNA Encoding Method for Traveling Salesman Problem. Lecture Notes in Computer Science 4115:328–335
Han A, Zhu D (2006) DNA Computing Model for the Minimum Spanning Tree Problem. In: Proceedings of the 8th International Symposium of Symbolic and Numeric Algorithms for Scientific Computing. IEEE Press 372–377
Han A (2006) DNA Computing Model for the 0/1 Knapsack Problem. In: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems. IEEE Press 122–125
Paun G, Rozenberg G, Salomaa A (1998) DNA Computing: New Computing Paradigms. Springer, Berlin. Translated by Xu Jin, Wang Shudong, Pan Linqiang (2004) Tsinghua University Press, Beijing
Setubal J, Meidanis J (1997) Introduction to Computational Molecular Biology. Cole Publishing Company, Thomson. translated by Zhu H, et al (2003) Science Press, Beijing
Zhang B T, Shin S Y (1998) Molecular algorithms for efficient and reliable DNA computing. In: Genetic Programming, Morgan Kaufmann 735–742
Xu J, Zhang L (2003) DNA Computer Principle, Advances and Difficulties (I): Biological Computing System and Its Applications to Graph Theory. Journal of Computer Science and Technology 26: 1–10
Yin Z (2004) DNA Computing in Graph and Combination Optimization. Science Press, Beijing
Wang L, Lin Y, Li Z (2005) DNA Computation for a Category of Special Integer Planning Problem. Computer Research and Development 42:1431–1437
Chen Z, Li X, Wang L, et al (2005) A Surface-Based DNA Algorithm for the Perfect Matching Problem. Computer Research and Development 42:1241–1246
Braich R S, Chelyapov N, Johnson C, et al (2002) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499–502
Lancia G (2004) Integer Programming Models for Computional Biology Problems. Journal of Computer Science and Technology 19:60–77
Ibrahim Z, Tsuboi Y, Muhammad M S, et al (2005) DNA implementation of k-shortest paths computation. In: Proceedings of IEEE Congress on Evolutionary Computation. IEEE press 707–713
Jonoska N, Kari S A, Saito M (1998) Graph structures in DNA computing. In: Computing with Bio-Molecules–Theory and Experiments. Penn State 93–110
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Han, A., Zhu, D. (2008). DNA Encoding Methods in the Field of DNA Computing. In: Kelemen, A., Abraham, A., Chen, Y. (eds) Computational Intelligence in Bioinformatics. Studies in Computational Intelligence, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76803-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-76803-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76802-9
Online ISBN: 978-3-540-76803-6
eBook Packages: EngineeringEngineering (R0)