A DNA Algorithm for the Hamiltonian Path Problem Using Microfluidic Systems
This paper describes the design of a linear time DNA algorithm for the Hamiltonian Path Problem (HPP) suited for parallel implementation using a microfluidic system. This bioalgorithm was inspired by the algorithm contained in  within the tissue P systems model. The algorithm is not based on the usual brute force generate/test technique, but builds the space solution gradually. The possible solutions/paths are built step by step by exploring the graph according to a breadth-first search so that only the paths that represent permutations of the set of vertices, and which, therefore, do not have repeated vertices (a vertex is only added to a path if this vertex is not already present) are extended. This simple distributed DNA algorithm has only two operations: concatenation (append) and sequence separation (filter). The HPP is resolved autonomously by the system, without the need for external control or manipulation. In this paper, we also note other possible bioalgorithms and the relationship of the implicit model used to solve the HPP to other abstract theoretical distributed DNA computing models (test tube distributed systems, grammar systems, parallel automata).
KeywordsHamiltonian Path Hamiltonian Path Problem Grammar System Biomolecular Computation Append Operation
Unable to display preview. Download preview PDF.
- 2.Amos, M., Gibbons, A., Hodgson, D.: Error-resistant implementation of DNA computation. In: Proceedings of the Second Annual Meeting on DNA Based Computers, held at Princeton University, June 10-12 (1996)Google Scholar
- 4.Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Solving NP-complete problems with networks of evolutionary processors. In: Proc. of the 6th International Work-Conference on Artificial and Natural Neural Networks, IWANN. LNCS, vol. 2048, pp. 621–628 (2001)Google Scholar
- 8.Csuhaj-Varju, E., Freund, R., Kari, L., Păun, G.: DNA computing based on splicing: universality results. In: Proc. First Annual Pacific Symp. on Biocomputing, Hawaii, pp. 179–190 (1996)Google Scholar
- 12.Gloor, G., Kari, L., Gaasenbeek, M., Yu, S.: Towards a DNA solution to the shortest common superstring problem. In: 4th Int. Meeting on DNA-Based Computing, Baltimore, Penns (June 1998)Google Scholar
- 14.Head, T.: Hamiltonian Paths and Double Stranded DNA. In: Păun, G. (ed.) Computing with Bio- Molecules. Theory and Experiments, pp. 80–92. World Scientific, Singapore (1998)Google Scholar
- 15.Manz, A., Harrison, D.J., Verpoorte, E.M.J., Fettinger, J.C., Paulus, A., Ludi, H., Widmer, H.M.: Planar chips technology for miniaturization and integration of separation techniques into monitoring systems: “Capillary electrophoresis on a chip. J. Chromatogr. 593, 253–258 (1992)CrossRefGoogle Scholar
- 18.Morimoto, N., Arita, M., Suyama, A.: Solid phase DNA solution to the Hamiltonian path problem. In: Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, The University of Pennsylvania pp. 83–92 (June 1997)Google Scholar