Length bounded molecular computing

BioSystems

Volumn 52, Issue 1-3, 1999, Pages 155-163

  Fu, Bin ^a   Beigel, Richard ^b  

^a Epson Palo Alto Laboratory   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Length complexity; Molecular algorithm; NP complete problem; Volume complexity

Indexed keywords

ALGORITHM; ARTICLE; DNA DETERMINATION; DNA STRUCTURE; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; MOLECULAR MODEL; STRUCTURE ANALYSIS;

EID: 0032705579     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(99)00042-8     Document Type: Article

References (20)

1. Adleman L. Molecular computation of solutions to combinatorial problems. Science. 266:1994;1021-1024.
2. Bach, E., Condon, A., Glaser, E., Tanguay, C., 1996. DNA models and algorithms for NP-complete problems. In: Proceedings of the 11th Annual Conference on Structure in Complexity Theory, IEEE Computer Society Press, pp. 290-299.
3. Baum, E., 1996. DNA sequences useful for computation. In: Proceedings of the Second Annual Meeting on DNA Based Computers, American Mathematical Society, Providence, pp. 122-127.
4. Beaver, D., 1995, Computer with DNA, J. Comput. Biol. 2(1) 1-7.
5. Beigel, R., Fu, B., 1997. Molecular computing, bounded nondeterminism, and efficient recursion. In: ICALP'97, LNCS 1256, Springer-Verlag, New York Inc., pp. 816-826.
6. Boneh, D., Dunworth, C., Lipton, R., 1995. Breaking DES using a molecular computer, In Proceedings of the 1st DIMACS Workshop on DNA Based Computers. American Mathematics Society, Providence, pp. 37-65.
7. Boneh D., Dunworth C., Lipton R., Sgall J. On the computational power of DNA. Disc. Appl. Math. 71:1996;79-94.
8. Fu, B., 1997, Volume bounded molecular computation. PhD thesis, Yale University.
9. Fu and Beigel, 1999. A Comparison of Resource-Bounded Molecular Computaion Models, Algorithmica, Springer-Verlag Inc., New York, Vol. 24, pp. 87-95.
10. n) volume molecular algorithm for Hamiltonian path. Manuscript, 1997.
11. Head T Formal languages and DNA: an analysis of the generative capacity of recombinant behaviors. Bull. Math. Biol. 49:1987;737-759.
12. Kari L. DNA computing: arrival of biological mathematics. Math. Intell. 19(2):1997;9-22.
13. Lipton R. Using DNA to solve NP-complete problems. Science. 268:1995;542-545.
14. Ogihara, M., 1996, Breadth first search 3SAT algorithms for DNA computers. Technical Report 629. University of Rochester.
15. Ogihara M., Ray A., Smith K. Biomolecular computing-a shape of computation to come. SIGACT News. 28(3):1997;2-11.
16. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund, P., Adleman, L., 1998. A sticker based model for DNA computation. J Comput Biol, 4(5), 615-629.
17. Sambrook J., Fritsch E., Maniatis T. 2nd edition Molecular Cloning: a Laboratory Manual. 1:1989;Cold Spring Harbor Press, New York.
18. Schnorr, C., 1976. Optimal algorithms for self-reducible problems. Proceedings of the 3rd International Colloqulum on Automata, Languages, and Programming. pp. 322-337.
19. Selman A. Natural self-reducible sets. SIAM J. Comput. 17:1988;989-996.
20. Tarjan, R., 1972. Finding a maximum clique. Technical report, Cornell University, pp. 72-123.