In:
Science, American Association for the Advancement of Science (AAAS), Vol. 278, No. 5337 ( 1997-10-17), p. 446-449
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.
Type of Medium:
Online Resource
ISSN:
0036-8075
,
1095-9203
DOI:
10.1126/science.278.5337.446
Language:
English
Publisher:
American Association for the Advancement of Science (AAAS)
Publication Date:
1997
detail.hit.zdb_id:
128410-1
detail.hit.zdb_id:
2066996-3
SSG:
11
Permalink