Abstract
Ever since scientists discovered that conventional silicon-based computers have an upper limit in terms of speed, they have been searching for alternative media with which to solve computational problems. That search has led them, among other places, to DNA. In this paper, we briefly review the recent developments in bio-soft computing towards the management engineering problems. The challenge and future potential of DNA computing is also addressed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu Bakar, R., Watada, J., Pedrycz, W.: Proximity clustering analysis based on DNA computing. In: Proceedings of the 4th International Symposium on Management Engineering, R07 (2007)
Abu Bakar, R., Jeng, D.J.-F., Kim, I., Watada, J.: DNA computing method for determination of distribution center location. In: Proceedings of the International Conference of Man-Machine Systems (CD-ROM), p. 6 (2006)
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 226, 1021–1024 (1994)
Amos, M.: DNA computation. Ph.D. Thesis, Department of Computer Science, The University of Warwick (1997)
Arita, M., Suyama, A., Hagiya, M.: A heuristic approach for Hamiltonian path problem with molecules. In: Proceeding of the 2nd Genetic Programming, pp. 457–462 (1997)
Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and Autonomous Computing Machine made of Biomolecules. Nature 414, 430–434 (2004)
Deaton, R., Murphy, R.C., Garzon, M., Franceschetti, D.R., Stevens, J.S.E.: Good Encoding for DNA-Based Solutions to Combinatorial Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 44, 247–258 (1999)
El-Houssaine, A., Birger, R., Landeghem, H.V.: Modeling inventory routing problems supply chains of high consumption products. European Journal of Operational Research 69, 1048–1063 (2006)
Gao, M., Chang, W.-L., Ho, M., Lu, J., Cao, J.: Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. BioSystems 80, 71–82 (2005)
Jain, A.K., Law, M.H.C.: Data clustering: User’s dilemma. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol. 3776, pp. 1–10. Springer, Heidelberg (2005)
Jeng, D.J.-F., Kim, I., Watada, J.: Bio-soft computing with fixed-length DNA to a group control optimization problem. Soft Computing (forthcoming)
Jeng, D.J.-F., Kim, I., Watada, J.: Bio-inspired evolutionary method for cable trench problem. Information and Control 3(1), 111–118 (2007)
Jeng, D.J.-F., Watada, J., Wu, B., Wu, J.-Y.: Fuzzy forecasting with DNA computing. In: Mao, C., Yokomori, T. (eds.) DNA Computing. LNCS, vol. 4287, pp. 324–336. Springer, Heidelberg (2006)
Jeng, D.J.-F., Wu, J.-Y.: Recent Development of DNA Computing. In: Proceedings of the International Conference on Recent trends in Information Systems, pp. 579–584 (2006)
Kolen, J.F., Hutcheson, T.: Reducing the time complexity of the fuzzy c-means algorithms. IEEE Transactions on Fuzzy System 10(2), 263–267 (2002)
McCaskill, J.S.: Optically programming DNA computing in microflow. BioSystems 59(2), 125–138 (2001)
Morimoto, N., Arita, M., Suyama, A.: Solid phase DNA solution to the Hamiltonian path problem. Series in Discrete Mathematics and Theoretical Computer Science 48, 193–206 (1999)
Narayanan, A., Zorbalas, S.: DNA algorithms for computing shortest paths. In: Proceedings of the Genetics Programming, pp. 718–723 (1998)
Nozick, K.L., Turnquist, M.A.: Two-Echelon inventory allocation and distribution center location analysis. Journal of Transportation Research Part E 37, 425–441 (2001)
Ouyang, Q., Kaplan, P.D., Liu, S., Libchaber, A.: DNA solution of the maximal clique problem. Science 278, 446–449 (1997)
Ralphs, T.K., Saltzman, M.J., Wiecek, M.M.: An Improved Algorithm for Biobjective Integer Programs. Annals of Operations Research 147(1), 43–70 (2006)
Ruben, A.J., Landweber, L.F.: The Past, Present and Future of Molecular Computing. Molecular Cell Biology 1, 69–72 (2000)
Shin, S.-Y., Zhang, B.-T., Jun, S.-S.: Solving traveling salesman problems using molecular programming. In: Proceeding of the 1999 Congress on Evolutionary Computation, vol. 2, pp. 994–1000 (1999)
Vasko, F.J., Barbieri, R.S., Rieksts, B.Q., Reitmeyer, K.L., Stott, J.K.L.: The cable trench problem: combining the shortest path and minimum spanning tree problems. Computer & Operations Research 29, 441–458 (2002)
Wu, J.-Y.: DNA and Molecular Computation: From Bites to Bases. In: Proceeding of Taiwan-Japan Symposium on Intelligent Technologies & Innovational Computing, Taiwan, pp. 33–40 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeng, D.JF., Abu Bakar, R., Watada, J. (2007). DNA Computing Approach to Management Engineering. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74829-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-74829-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74828-1
Online ISBN: 978-3-540-74829-8
eBook Packages: Computer ScienceComputer Science (R0)