The maximal clique problem has been solved by means of molecular biolo
gy techniques. A pool of DNA molecules corresponding to the total ense
mble of six-vertex cliques was built, followed by a series of selectio
n processes. The algorithm is highly parallel and has satisfactory fid
elity. This work represents further evidence for the ability of DNA co
mputing to solve NP-complete search problems.