A Chinese Postman Problem based on DNA computing

Zhixiang Yin*, Fengyue Zhang, Jin Xu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)

Abstract

DNA computing is a novel method for solving a class of intractable computational problems, in which the computing can grow exponentially with the problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. A Chinese Postman Problem has been solved by means of molecular biology techniques in the paper. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.

Original languageEnglish
Pages (from-to)222-224
Number of pages3
JournalJournal of Chemical Information and Computer Sciences
Volume42
Issue number2
DOIs
Publication statusPublished - Mar 2002
Externally publishedYes

Fingerprint

Dive into the research topics of 'A Chinese Postman Problem based on DNA computing'. Together they form a unique fingerprint.

Cite this