摘要

Due to the high parallelism and recognition ability of the biomolecules in biochemical reactions, biomolecular computing behaves great advantage in solving combinatorial optimization problems. Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc. This paper presents a review of fundamental ideas, computing methods, applications and advances in biomolecular computing. Furthermore, the developmental trend of biomolecular computing is described.