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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Progress in natural science Ročník 17; číslo 6; s. 745 - 749
Hlavní autoři: Kai, Zhang, Linqiang, Pan, Jin, Xu
Médium: Journal Article
Jazyk:angličtina
Vydáno: 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
Témata:
DNA编码
DNA计算
全局启发式搜索算法
热力学设计
encoding
heuristic optimizing search
DNA computing
ISSN:1002-0071
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:DNA computing, encoding, heuristic optimizing search
TP384
11-3853/N
ISSN:1002-0071
DOI:10.1080/10002007088537469