Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

Parallel Computing

Volumn 30, Issue 9-10, 2004, Pages 1109-1125

  Guo, Minyi ^a   Ho, Michael ^b   Chang, Weng Long ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

DNA based parallel algorithms; DNA based computing; Dominating set problem; NP complete problem; Parallel biological computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DNA; MOLECULAR BIOLOGY; PROBLEM SOLVING;

DNA-BASED COMPUTING; DNA-BASED PARALLEL ALGORITHMS; DOMINATING-SET PROBLEMS; PARALLEL BIOLOGICAL COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 7444231624     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2004.07.014     Document Type: Article

References (29)

1. R.R. Sinden, DNA Structure and Function, Academic Press, New York, 1994.
2. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (November) (1994) 1021-1024.
3. R.J. Lipton, DNA solution of hard computational problems, Science 268 (1995) 542-545.
4. Q. Quyang, P.D. Kaplan, S. Liu, A. Libchaber, DNA solution of the maximal clique problem, Science 278 (1997) 446-449.
5. M. Arita, A. Suyama, M. Hagiya, A heuristic approach for Hamiltonian path problem with molecules, in: Proceedings of 2nd Genetic Programming (GP-97), 1997, pp. 457-462.
6. N. Morimoto, M. Arita, A. Suyama, Solid phase DNA solution to the Hamiltonian path problem, DIMACS (Series in Discrete Mathematics and Theoretical Computer Science) 48 (1999) 93-206.
7. A. Narayanan, S. Zorbala, DNA algorithms for computing shortest paths, in: J.R. Koza et al. (Eds.), Genetic Programming 1998: Proceedings of the Third Annual Conference, 1998, pp. 718-724.
8. S.-Y. Shin, B.-T. Zhang, S.-S. Jun, Solving traveling salesman problems using molecular programming, in: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), voL 2, 1999, pp. 994-1000.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest Introduction to algorithms, MIT Press, Cambridge, UK, ISBN 0-262-03141-8.
10. M.R. Garey, D.S. Johnson, Computer and intractability, Freeman, San Fransico, CA, 1979.
11. D. Boneh, C. Dunworth, R.J. Lipton, J. Sgall, On the computational power of DNA, in: Discrete Applied Mathematics, Special Issue on Computational Molecular Biology, vol. 71, 1996, pp. 79-94.
12. L.M. Adleman, On constructing a molecular computer, DNA Based Computers, in: R. Lipton, E. Baum (Eds.), DIMACS series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1996, pp. 1-21.
13. M. Amos, DNA Computation, Ph.D. Thesis, Department of Computer Science, The University of Warwick, 1997.
14. S. Roweis, E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W.K. Rothemund, L.M. Adleman, A sticker based model for DNA computation, in: L. Landweber, E. Baum (Eds.), 2nd Annual Workshop on DNA Computing, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Princeton University, 1999, pp. 1-29.
15. M.J. Perez-Jimenez, F. Sancho-Caparrini, Solving knapsack problems in a sticker based model, in: 7th Annual Workshop on DNA Computing, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 2001.
16. G. Paun, G. Rozenberg, A. Salomaa, DNA Computing: New Computing Paradigms, Springer-Verlag, New York, 1998, ISBN: 3-540-64196-3.
17. W.-L. Chang, M. Guo, Solving the dominating-set problem in Adleman-Lipton's Model, in: The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, 2002, pp. 167-172.
18. W.-L. Chang, M. Guo, Solving the clique problem and the vertex cover problem in Adleman-Lipton's model, in: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 431-436.
19. W.-L. Chang, M. Guo, Solving NP-complete problem in the Adleman-Lipton Model, in: The Proceedings of 2002 International Conference on Computer and Information Technology, Japan, 2002, pp. 157-162.
20. W.-L. Chang, M. Guo, Resolving the 3-dimensional matching problem and the set packing problem in Adleman-Lipton's model, in: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 455-460.
21. B. Fu, Volume Bounded Molecular Computation, Ph.D. Thesis, Department of Computer Science, Yale University, 1997.
22. R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, L.M. Adleman. Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the 6th International Conference on DNA Computation in the Springer-Verlag Lecture Notes in Computer Science series.
23. K. Mir, A restricted genetic alphabet for DNA computing, in: E.B. Baum, L.F. Landweber (Eds.), DNA Based Computers II: DIMACS Workshop, June 10-2, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI, 1998, pp. 243-246.
24. A.R. Cukras, D. Faulhammer, R.J. Lipton, L.F. Landweber, Chess games: a model for RNA-based computation, in: Proceedings of the 4th DIMACS Meeting on DNA Based Computers, Held at the University of Pennsylvania, June 16-19, 1998, pp. 27-37.
25. W.-L. Chang, M. Guo, Solving the set cover problem and the problem of exact cover by 3-sets in the AdlemanLipton model, Biosystems 72 (3) (2003) 263-275.
26. W.-L. Chang, M.(S.-H.) Ho, M. Guo, Molecular solutions for the subset-sum problem on DNA-based supercomputing, Biosystems 73 (2) (2004) 117-130.
27. M. Ho, W.-L. Chang, M. Guo, Is Cook's theorem correct for DNA-based computing - towards solving the NP-complete problems on a DNA-based supercomputer model, Journal of Parallel and Distributed Scientific and Engineering Computing, in press.
28. W.-L. Chang, M. Guo, M. Ho, Solving the set-splitting problem in sticker-based model and the Adleman-Lipton model. Future Generation Computer System, in press.
29. R.P. Feynman, in: D.H. Gilbert (Ed.), Minaturization, Reinhold Publishing Corporation, New York, 1961, pp. 282-296.