DNA Solution of the Maximal Clique Problem
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
The maximal clique problem has been solved by means of molecular biology techniques. A pool of DNA molecules corresponding to the total ensemble of six-vertex cliques was built, followed by a series of selection processes. The algorithm is highly parallel and has satisfactory fidelity. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Site-directed mutagenesis by overlap extension using the polymerase chain reaction
Ho, S. N., Hunt, H. D., Horton, R. M., Pullen, J. K., & Pease, L. R. (1989) · Gene · doi:10.1016/0378-1119(89)90358-2 · Cited by 7,399
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
Accessing Genetic Information with High-Density DNA Arrays
Chee, M., Yang, R., Hubbell, E., Berno, A., Huang, X. C., Stern, D., Winkler, J., Lockhart, D. J., Morris, M. S., & Fodor, S. P. A. (1996) · Science · doi:10.1126/science.274.5287.610 · Cited by 1,489
Stemmer, W. P. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.22.10747 · Cited by 1,284
Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides
Stemmer, W. P. C., Crameri, A., Ha, K. D., Brennan, T. M., & Heyneker, H. L. (1995) · Gene · doi:10.1016/0378-1119(95)00511-4 · Cited by 728
DNA polymerase fidelity and the polymerase chain reaction.
Eckert, K. A., & Kunkel, T. A. (1991) · Genome Research · doi:10.1101/gr.1.1.17 · Cited by 448
Guarnieri, F., Fliss, M., & Bancroft, C. (1996) · Science · doi:10.1126/science.273.5272.220 · Cited by 189
DeSalle, R., Barcia, M., & Wray, C. G. (1993) · Cellular and Molecular Life Sciences · doi:10.1007/bf01952607 · Cited by 74
Jayaraman, K., Fingar, S. A., Shah, J., & Fyles, J. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.10.4084 · Cited by 55
Cited by
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Digital Information Processing in Molecular Systems
Szaciłowski, K. (2008) · Chemical Reviews · doi:10.1021/cr068403q · Cited by 827
An autonomous molecular computer for logical control of gene expression
Benenson, Y., Gil, B., Ben-Dor, U., Adar, R., & Shapiro, E. (2004) · Nature · doi:10.1038/nature02551 · Cited by 821
Thermodynamic basis of the enhanced specificity of structured DNA probes
Bonnet, G., Tyagi, S., Libchaber, A., & Kramer, F. R. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.11.6171 · Cited by 658
Self-citationProgrammable and autonomous computing machine made of biomolecules
Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., & Shapiro, E. (2001) · Nature · doi:10.1038/35106533 · Cited by 645
Nucleic Acid Based Molecular Devices
Krishnan, Y., & Simmel, F. C. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.200907223 · Cited by 572
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L. (2002) · Science · doi:10.1126/science.1069528 · Cited by 568
Liu, Q., Wang, L., Frutos, A. G., Condon, A. E., Corn, R. M., & Smith, L. M. (2000) · Nature · doi:10.1038/35003155 · Cited by 529
Algorithmic Self-Assembly of DNA
Winfree, E. (2006) · 2006 International Conference on Microtechnologies in Medicine and Biology · doi:10.1109/mmb.2006.251471 · Cited by 487
Molecular Computation by DNA Hairpin Formation
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M. (2000) · Science · doi:10.1126/science.288.5469.1223 · Cited by 388
Li, J., Green, A. A., Yan, H., & Fan, C. (2017) · Nature Chemistry · doi:10.1038/nchem.2852 · Cited by 353
Molecular computation: RNA solutions to chess problems
Faulhammer, D., Cukras, A. R., Lipton, R. J., & Landweber, L. F. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.4.1385 · Cited by 338
Fundamentals of natural computing: an overview
DECASTRO, L. (2007) · Physics of Life Reviews · doi:10.1016/j.plrev.2006.10.002 · Cited by 297
Cryptography with DNA binary strands
Leier, A., Richter, C., Banzhaf, W., & Rauhe, H. (2000) · Biosystems · doi:10.1016/s0303-2647(00)00083-6 · Cited by 285
DNA molecule provides a computing machine with both data and fuel
Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., & Shapiro, E. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0535624100 · Cited by 255
Binary DNA Nanostructures for Data Encryption
Halvorsen, K., & Wong, W. P. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044212 · Cited by 45
Metadata
- Authors
- Ouyang, Q., Kaplan, P. D., Liu, S., & Libchaber, A.
- Venue
- Science
- Published
- 1997-10-17
- Volume
- 278
- Issue
- 5337
- Pages
- 446-449
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2022943108
- Cited by
- 624
- References
- 9
- FWCI
- 5.06
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.