%0 Journal Article %1 Ouyang446 %A Ouyang, Qi %A Kaplan, Peter D. %A Liu, Shumao %A Libchaber, Albert %D 1997 %I American Association for the Advancement of Science %J Science %K clique concepts fca graph heuristic %N 5337 %P 446--449 %R 10.1126/science.278.5337.446 %T DNA Solution of the Maximal Clique Problem %U http://science.sciencemag.org/content/278/5337/446 %V 278 %X 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.

@article{Ouyang446, 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.}, added-at = {2018-08-12T23:02:45.000+0200}, author = {Ouyang, Qi and Kaplan, Peter D. and Liu, Shumao and Libchaber, Albert}, biburl = {https://www.bibsonomy.org/bibtex/2d05ebeeae1c779281a41bf0b07df6754/tomhanika}, doi = {10.1126/science.278.5337.446}, eprint = {http://science.sciencemag.org/content/278/5337/446.full.pdf}, interhash = {57de14ca06832636ce924e49a14b68a2}, intrahash = {d05ebeeae1c779281a41bf0b07df6754}, issn = {0036-8075}, journal = {Science}, keywords = {clique concepts fca graph heuristic}, number = 5337, pages = {446--449}, publisher = {American Association for the Advancement of Science}, timestamp = {2018-08-12T23:02:45.000+0200}, title = {DNA Solution of the Maximal Clique Problem}, url = {http://science.sciencemag.org/content/278/5337/446}, volume = 278, year = 1997 }