Error-resilient DNA computation (Preliminary version)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 458-467

  Karp, Richard M ^a   Kenyon, Claire ^b   Waarts, Orli ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIV LYON   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; DNA SEQUENCES; ERRORS;

BOOLEAN FORMULAE; CONSTANT FACTORS; DNA COMPUTATION; ERROR FREE OPERATIONS; ERROR-RESILIENT; FOLLOWING PROBLEM; HIGH PROBABILITY; SATISFIABILITY;

BOOLEAN ALGEBRA;

EID: 0347633302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. In Science 266:1021 1994.
2. D. Beaver. Nanocomputing: The DNA solution. To appear in Journal of computational Biology. Preliminary abstract appeared as 'Factoring: The DNA solution', in Advances in Cryptography - Asiacrypt '94 Proceedings, Springer Verlag LNCS, 1994.
3. D. Beaver. A universal molecular computer. Technical Report CSE-95-001, Penn State University, 1995.
4. D. Beaver. Computing with DNA. Manuscript 1995.
5. D. Boneh, C. Dunworth, and R. J. Lipton. Breaking DES using a molecular computer. Technical Report CS-TR-489-95, Princeton University, 1995.
6. D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall. On the computational power of DNA. Manuscript 1995.
7. D. Boneh and R. J. Lipton. Making DNA computers error resistant. Technical Report CS-TR-491-95, Princeton University, 1995.
8. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Computing with unreliable information. In Proceedings of the 22nd ACM Symposium on Theory of Computing, pages 128-137, 1990.
9. A. Gal. Lower bounds for the complexity for reliable boolean circuits with noisy gates. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 594-601, October 1991.
10. C. Kenyon and V. King. On boolean decision trees with faulty nodes. In Random Structures and Algorithms, pages 453-464, Vol. 5, No. 3, 1994.
11. C. Kenyon and A. C. Yao. On evaluating Boolean functions with unreliable tests. In International Journal on Foundations of Computer Science, 1(1), pages 1-10, 1990.
12. R. J. Lipton. Using DNA to solve NP-Complete problems. In Science: 268:542-545, April 28, 1995.
13. National Bureau of Standards. Data Encryption Standard. U.S. Department of Commerce, FIPS, pub. 46, January 1977.
14. N. Nisan. CREW PRAMs and decision trees. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 327-335, 1989.
15. N. Pippenger. On networks of noisy gates. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 30-38, 1985.
16. J. H. Reif. Parallel molecular computation: Models and simulations. In Proceedings of the. 7th ACM Symposium on Parallel Algorithms and Architectures, 1995.
17. R. Reischuk and B. Schmeltz. Reliable computation with noisy circuits and decisions trees-A general n log n lower bound. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 602-611, 1991.
18. R. L. Rivest, A. R. Meyer, D. J. Kleitman, K. Winklmann, and J. Spencer. Coping with errors in binary search procedures. In Journal of Computing and Systems Sciences, Vol. 20, pages 396-404, 1980.
19. D. Rooß and K. W. Wagner. On the power of BioComputers. Manuscript 1995.