Bio-inspired evolutionary method for cable trench problem

International Journal of Innovative Computing, Information and Control

Volumn 3, Issue 1, 2007, Pages 111-118

  Jeng, Don Jyh Fu ^a   Kim, Ikno ^a   Watada, Junzo ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

Bio inspired computing; Cable trench problem; Com binatorial optimization; DNA computing; Evolutionary computation

Indexed keywords

EID: 38049113913     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Adleman, L. M., Molecular computation of solutions to combinatorial problems, Science, vol.266, pp.1021-1024, 1994.
2. Booth, H. and J. Westbrook, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Algorithmica, vol.11, pp.341-352, 1994.
3. Eppstein, D., Shortest path along an MST, Computational Theory, 1999.
4. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- completeness, W. H. Freeman and Company, New York, 1979.
5. Jeng, D. J.-F., J. Watada and I. Kim, Solving a real time scheduling problem based on DNA computing, Proc. of the International Conference on Intelligent Technologies and Applied Statistics, Taipei, Taiwan, pp.317-322, 2005.
6. Jeng, D. J.-F. and J.-Y. Wu, Recent development of DNA computing, Proc. of the International Conference on Recent Trends in Information Systems, Tamil Nadu, India, pp.579-584, 2006.
7. Khuller, S., B. Raghavachari and N. Young, Balancing minimum spanning trees and shortest-path trees, Algorithmica, vol.14, pp.305-321, 1995.
8. Lee, J. Y., S.-Y. Shin, T. H. Park and B.-T. Zhang, Solving traveling salesman problems with DNA molecules encoding numerical values, BioSystems, vol.78, pp.39-47, 2004.
9. Lee, J. Y., B.-T. Zhang and T. H. Park, Effectiveness of denaturation temperature gradient- polymerase chain reaction for biased DNA algorithms, Pre-Proc. of the 9th International Meeting on DNA Based Computers, Madison, USA, p.208, 2003.
10. Liu, Q., L. Wang, A. G. Frutos, A. E. Condon, R. M. Corn and L. M. Smith, DNA computing on surface, Nature, vol.403, pp.175-179, 2000.
11. Maley, C. C, DNA computation: Theory, practice, and prospects, Evolutionary Computation, vol.6, no.3, pp.201-229, 1998.
12. Marmur, J. and P. Doty, Determination of the base composition of deoxyribonucleic acid from its thermal denaturation temperature, J. of Molecular Biology, vol.5, pp.109-118, 1962.
13. Narayanan, A. and S. Zorbalas, DNA algorithms for computing shortest paths, Proc. of the Genetic Programming 1998, pp.718-723, 1998.
14. Ouyang, Q., P. D. Kaplan, S. Liu and A. Libchaber, DNA solution of the maximal clique problem, Science, vol.278, pp.446-449, 1997.
15. Owenson, G. G., M. Amos, D. A. Hodgson and A. Gibbsons, DNA-based logic, Soft Computing, vol.5, no.2, pp.102-105, 2001.
16. Ralphs, T. K., M. Saltzman and M. Wiecek, An Improved Algorithm for Biobjective Integer Programming, Annals of Operations Research, to appear.
17. Reif, J. H., T. H. LaBean, M. Pirrug, V. S. Rana, B. Guo, C. Kingsford and G. S. Wickham, Experimental construction of a very large scale DNA database with associatice search capability, Proc. of the 7th International Workshop on DNA-Based Computers, Tampa, USA, pp.241-250, 2001.
18. Saltzman, M. J., Counterexample to minimum spanning tree = shortest path tree?, Usenet News Group Science op-research, 31 May 1995.
19. SantaLucia Jr., J., A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics, Proc. of the National Academy of Sciences of the U.S.A., vol.95, pp.1460-1465, 1998.
20. Vasko, F. J., R. S. Barbieri, B. Q. Rieksts, K. L. Reitmeyer and K. L. Stott Jr., The cable trench problem: combining the shortest path and minimum spanning tree problems, Computer & Operations Research, vol.29, pp.441-458, 2002.
21. Wetmur, J. G., DNA probes: Applications of the principles of nucleic acid hybridization, Critical Reviews in Biochemistry and Molecular Biology, vol.26, no.3, pp.227-259, 1991.
22. Wikipedia, GC-content, http://en.wikipedia.org/wiki/GC-content, retrieved December 27, 2005,
23. Winfree, E., F. Lin, L. A. Wenzler and N. C. Seeman, Design and self-assembly of two-dimensional DNA crystals, Nature, vol.394, no.6693, pp.539-545, 1998.
24. Yamamura, M., Y. Hiroto and T. Matoba, Solutions of shortest path problems by concentration control. Proc. of the 7th International Workshop on DNABased Computers, pp.231-240, 2001.