A clause string DNA algorithm for SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2340, Issue , 2002, Pages 172-181

  Manca, Vincenzo ^a   Zandron, Claudio ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

DNA ALGORITHMS; EXTRACTION MODEL; LITERALS;

BIOINFORMATICS;

EID: 84944876583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48017-x_16     Document Type: Conference Paper

References (26)

1. L. M. Adleman, Molecular Computation of solutions to combinatorial problems, Science, Vol. 266, pp. 1021–1024, November 11, 1994.
2. D. Boneh, C. Dunworth, R. J. Lipton, J. Sgall, Making DNA computers error resistant, in [18] pp. 163–170, 1999.
3. R. S. Brainch, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, L. M. Adleman, Solutions of a SatisfiabilityProb lem on a Gel-Based DNA Computer, Sixth International Meeting on DNA Based Computers, Leiden Center for Natural Computing, A. Condon G. Rozenberg (eds.), Leiden, 2000.
4. C. Calude, Gh Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.
5. K. Chen, E. Winfree, Error Correction in DNA Computing: Misclassification and Strand Loss, in [26] pp. 49–63, 2000.
6. M. R. Garey, D. S. Johnson, Computers and Intractability,Freeman, San Francisco, 1979.
7. C. P. Gomes, B. Selman, N. Crator, H. Kautz, Heavy-tailed phenomena in satisfiabilityan d constraint satisfaction problems, J. of Automated Reasoning, Vol. 24 (1/2), pp. 67–100, 1999.
8. T. Head, X. Chen, M. J. Nichols, M. Yamamura, and S. Gal, Aqueous Solutions of Algorithmic Problems: emphasizing knights on a 3 × 3, in [10] pp. 219–230, 2001.
9. N. Jonoska, S. A. Karl, M. Saito, Three Dimensional DNA Structures in Computing, Biosystems, Vol. 52, 242–245, 1999.
10. N. Jonoska, N. Seeman (eds.), 7th International Meeting on DNA Based Computers, PreliminaryPro ceedings, Tampa, FL (U.S.A.), 2001.
11. L. Landweber, E. Baum, DNA Based Computers II, DIMACS Series 44, American Math. Society, Providence, RI, 1999.
12. R. Lipton, DNA Solutions of hard computational problems, Science, Vol. 268, 242–245, 1995.
13. V. Manca, Monoidal systems and membrane systems, in Pre-proc. Workshop on Multiset Processing, Curtea de Arges, Romania, TR 140, CDMTCS, Univ. Auckland (New Zealand), pp. 176–190, 2000.
14. V. Manca, and Di Gregorio S., Lizzari D., Vallini G., Zandron C., A DNA Algorithm for 3-SAT(11,20), in [10], pp. 167–178, 2001.
15. V. Manca, Membrane Algorithms for Propositional Satisfiability, in Pre-proc. Workshop on Membrane Computing, Curtea de Arges, Romania, TR 17, GRLMC, Univ. Rovira i Virgili, Tarragona (Spain), pp. 181–192, 2001.
16. Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing: New Computing Paradigms, Springer-Verlag, Berlin, 1998.
17. Gh. Păun, P Systems with Active Membranes: Attacking NP Complete Problems, J. Automata Languages and Combinatorics, 6, 1, 2001.
18. H. Rubin, D. Wood, DNA Based Computers III, DIMACS Series 48, American Math. Society, Providence, RI, 1999.
19. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.
20. K. Sakamoto, H. Gounzu, D. Kiga, K. Komiya, H. Gouzu, S. Yokoyama, T. Yokomori, S. Ikeda, H. Sugiyama, M. Hagiya, State transitions by molecules, Biosystems, Vol. 52, pp. 81–91, 1999.
21. K. Sakamoto, H. Gounzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, M. Hagiya, Molecular Computation by DNA Hairpin Formation, Science, Vol. 288, pp. 1223–1226, May19, 2000.
22. K. Selman, H. Kautz, B. Cohen, Local Search Strategies for SatisfiabilityT esting, in: Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D. S. Johnson, M. A. Trick, eds., vol. 26, AMS, 1996.
23. Y. Takenaka, A. Hashimoto, A proposal of DNA computing on beads and its application to SAT problems, in [10], pp. 331–339, 2001.
24. H. Yoshida and A. Suyama, Solutions to 3-SAT by breadth first search, in [26] pp. 9–22, 2000.
25. M. Yamamoto, J. Yamashita, T. Shiba, T. Hirayama, S. Takiya, K. Suzuki, M Munekata, and A. Ohuchi, A studyo f hybridization process in DNA computing, in [26], pp. 101–110, 2000.
26. E. Winfree E., D. K. Gifford, DNA Based Computers V, DIMACS Series 54, American Math. Society, Providence, RI, 2000.