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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Progress in natural science Jg. 17; H. 6; S. 745 - 749
Hauptverfasser: Kai, Zhang, Linqiang, Pan, Jin, Xu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 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
Schlagworte:
ISSN:1002-0071
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:DNA computing, encoding, heuristic optimizing search
TP384
11-3853/N
ISSN:1002-0071
DOI:10.1080/10002007088537469