DocumentCode
2680810
Title
DNA Algorithm Employing Temperature Gradient for Chinese Postman Problem
Author
Zoraida, B.S.E.
Author_Institution
Dept. of Comput. Sci. & Eng., Bharathidasan Univ., Trichirappallijndia, India
fYear
2011
fDate
20-22 July 2011
Firstpage
1
Lastpage
4
Abstract
The biological Deoxyribo Nucleic Acid (DNA) strand is found to be a promising computing unit. An attempt has been made in this paper to solve Chinese postman problem (CPP). In this paper, the thermodynamic properties of DNA have been utilised, along with other biochemical operations to obtain the optimal solution. Thermodynamics properties of DNA strand helps to use actual numerical values for distance. Moreover, the proposed approach can be adopted to solve more real-life applications like Garbage collection, street sweeping with necessary modifications. In this work, a case study of a CPP having seven vertex has been solved to validate the proposed approach. This method exhibits the ability to solve complex combinatorial problems using molecular computing.
Keywords
biocomputing; travelling salesman problems; Chinese postman problem; DNA algorithm; DNA thermodynamic property; combinatorial problem; deoxyribo nucleic acid strand; molecular computing; traveling salesman problem; Biochemistry; Chemicals; DNA; DNA computing; Encoding; Temperature; Thermodynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
Process Automation, Control and Computing (PACC), 2011 International Conference on
Conference_Location
Coimbatore
Print_ISBN
978-1-61284-765-8
Type
conf
DOI
10.1109/PACC.2011.5979046
Filename
5979046
Link To Document