A global heuristically search algorithm for DNA encoding

A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic...

Full description

Saved in:
Bibliographic Details
Published in:Progress in natural science Vol. 17; no. 6; pp. 745 - 749
Main Authors: Kai, Zhang, Linqiang, Pan, Jin, Xu
Format: Journal Article
Language:English
Published: The Key Laboratory of Image Processing and Intelligent Control, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China 01.06.2007
Subjects:
ISSN:1002-0071
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.
Bibliography:DNA computing, encoding, heuristic optimizing search
TP384
11-3853/N
ISSN:1002-0071
DOI:10.1080/10002007088537469