DNA Solution of the Maximal Clique Problem-Reference-Cited by-同舟云学术

DNA Solution of the Maximal Clique Problem

Published:1997-10-17 Issue:5337 Volume:278 Page:446-449
ISSN:0036-8075
Container-title:Science
language:en
Short-container-title:Science

Author:

Ouyang Qi¹²,Kaplan Peter D.¹²,Liu Shumao¹²,Libchaber Albert¹²

Affiliation:

1. Q. Ouyang and P. D. Kaplan, NEC Research Institute, 4 Independence Way, Princeton, NJ 08540, USA.

2. S. Liu and A. Libchaber, NEC Research Institute, 4 Independence Way, Princeton, NJ 08540, USA, and Center for Studies in Physics and Biology, Rockefeller University, New York, NY 10021, USA.

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.

Publisher

American Association for the Advancement of Science (AAAS)

Subject

Multidisciplinary

Reference22 articles.

1. For a general discussion see J. Casti New Sci. 2082 30 (1997).

2. Molecular Computation of Solutions to Combinatorial Problems

3. Lipton R. J., ibid. 268, 542 (1995).

4. G. Paun J. Autom. Lang. Comb. 1 27 (1996).

5. Making DNA Add

Cited by 411 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Building DNA Computing System for Smart Biosensing and Clinical Diagnosis;DNA Nanotechnology for Cell Research;2024-05-03

2. Enhanced DNA sequence design with learning PSO;Evolutionary Intelligence;2024-03-21

3. Lipid vesicle-based molecular robots;Lab on a Chip;2024

4. A DNA Algorithm for Calculating the Maximum Flow of a Network;Foundations of Computing and Decision Sciences;2023-12-01

5. Programmable Biomolecule-Mediated Processors;Journal of the American Chemical Society;2023-10-21