Richard M. Karp, Claire Kenyon, Orli Waarts  Home/Search
Context Related
| lix.polytechnique.fr/~kenyo...DNA.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lix.polytechnique.fr/~kenyon/ (more) Homepages: C.Kenyon |
Rate this article:      (best)Comment on this article |
Abstract: The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives, Extract-A-Bit, which splits a test tube into two test tubes according to the value of a particular bit x, Merge-Two-Tubes and Detect-Emptiness. Perfect operations can test the satisfiability of any boolean formula in linear time. However, in reality the Extract operation is faulty; it misclassifies a certain proportion of the strands. We consider the following problem: given an... (Update)
Similar documents based on text: More All
0.7: Error-Resilient DNA Computation - Karp, Kenyon, Waarts (1997) (Correct)
0.2: The Minimum-Model DNA Computation on a Sequence of Probe Arrays - Ogihara, Ray (2002) (Correct)
0.2: Selection in the Presence of Noise: The Design of.. - Adler, Gemmell.. (1995) (Correct)
Related documents from co-citation: More All
15: Molecular computation of solutions to combinatorial problems - Adleman - 1994
12: On constructing a molecular computer - Adleman
11: Making DNA Computers Error Resistant - Boneh, Lipton - 1995
BibTeX entry: (Update)
R. M. Karp, C. Kenyon, and O. Waarts. Error-resilient dna computation. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458--467, 1997. http://citeseer.ist.psu.edu/karp97errorresilient.html More
@techreport{ karp95error,
author = "Richard M. Karp and Claire Kenyon and Orli Waarts",
title = "Error Resilient {DNA} Computation",
number = "95-20",
address = "46, All{\'{e}}e d'Italie 69364 LYON CEDEX 07 - FRANCE",
year = "1995",
url = "citeseer.ist.psu.edu/karp97errorresilient.html" }
Citations (may not include all citations):249 Molecular computation of solutions to combinatorial problems - Adleman - 1994
202 Data Encryption Standard (context) - of - 1977
53 Using DNA to solve NP-Complete problems - Lipton - 1995
50 the computational power of DNA - Boneh, Dunworth et al. - 1995
44 CREW PRAMs and decision trees (context) - Nisan - 1989
40 Breaking DES using a molecular computer - Boneh, Dunworth et al. - 1995
34 A universal molecular computer (context) - Beaver - 1995
32 On networks of noisy gates (context) - Pippenger - 1985
32 Coping with errors in binary search procedures (context) - Rivest, Meyer et al. - 1980
32 Making DNA computers error resistant - Boneh, Lipton - 1995
27 Parallel molecular computation: Models and simulations (context) - Reif - 1995
24 the power of BioComputers - Roo, Wagner - 1995
22 Computing with unreliable information (context) - Feige, Peleg et al. - 1990
21 Reliable computation with noisy circuits and decisions trees.. (context) - Reischuk, Schmeltz - 1991
19 Computing with DNA - Beaver - 1995
10 Lower bounds for the complexity for reliable boolean circuit.. - Gal - 1991
6 Factoring: The DNA solution - Beaver, The et al. - 1994
4 On evaluating Boolean functions with unreliable tests (context) - Kenyon, Yao - 1990
3 On boolean decision trees with faulty nodes - Kenyon, King - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lix.polytechnique.fr/~kenyon/): More
Sensitivity, Block Sensitivity, and l-Block Sensitivity of.. - Kenyon, Kutin (Correct)
Best-Fit Bin-Packing with Random Order - Kenyon (1997) (Correct)
Approximation Schemes for Metric Minimum Bisection and.. - Vega, Karpinski, Kenyon (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC