Working operation problem based on DNA computing

ZhiXiang Yin; Shuangqing Tang; Yafei Dong; Yuming Zhang

doi:10.1117/12.522321

2 September 2003 Working operation problem based on DNA computing

ZhiXiang Yin, Shuangqing Tang, Yafei Dong, Yuming Zhang

Proceedings Volume 5253, Fifth International Symposium on Instrumentation and Control Technology; (2003) https://doi.org/10.1117/12.522321
Event: Fifth International Symposium on Instrumentation and Control Technology, 2003, Beijing, China

Abstract

Over the past few years, a handful of insightful researchers have get a new method of computing-DNA computing. DNA computing is a novel method based on bio-chemistry. Since Adelman solved Directed Hamilton Path by encoding and molecular-biological manipulations in 1994, DNA computing have become an attractive field. In the paper, we solve a famous problem (working operation problem) of operation research based on Adelman'S approach. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.

Citation Download Citation

ZhiXiang Yin, Shuangqing Tang, Yafei Dong, and Yuming Zhang "Working operation problem based on DNA computing", Proc. SPIE 5253, Fifth International Symposium on Instrumentation and Control Technology, (2 September 2003); https://doi.org/10.1117/12.522321

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available