Design of DNA encoding sequences based on h-distance

doi:10.11772/j.issn.1001-9081.2014.05.1259

Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (5): 1259-1262.DOI: 10.11772/j.issn.1001-9081.2014.05.1259

Previous Articles Next Articles

Design of DNA encoding sequences based on h-distance

ZHENG Xuedong,WANG Bin,ZHOU Shihua,ZHOU Changjun

Key laboratory of Advanced Design and Intelligent Computing, Ministry of Education (Dalian University), Dalian Liaoning 116622, China

Received:2013-11-05 Revised:2013-12-17 Online:2014-05-30 Published:2014-05-01
Contact: ZHENG Xuedong

基于h-距离的DNA编码序列设计

郑学东,王宾,周士华,周昌军

大连大学先进设计与智能计算省部共建教育部重点实验室，辽宁大连 116622

通讯作者: 郑学东
作者简介:郑学东（1977-），男，黑龙江五常人，讲师，博士，主要研究方向：DNA计算；王宾(1983-)，男，辽宁大连人，博士研究生，主要研究方向：DNA计算；周士华(1982-)，女，辽宁大连人，讲师，博士，主要研究方向：DNA计算；周昌军(1977-)，男，江西上饶人，教授，博士，主要研究方向：DNA计算、模式识别。
基金资助:
国家自然科学基金资助项目;长江学者和创新团队发展计划项目;教育部科学技术研究重点项目;辽宁省教育厅资助科研项目

Abstract

Abstract:

Aiming at the problem of the design of Deoxyribonucleic Acid (DNA) encoding sequences which can be mathematically converted into a multi-objective optimization problem with some constraints, by introducing the h-distance in the set of DNA single strands, a sharing function between different DNA sequences was defined and a micro-genetic algorithm was applied to solve the DNA encoding sequence problem. Compared with the previous results, the algorithm can get better DNA sequences and improve the efficiency of computation. The algorithm can be used to design concrete DNA sequences in DNA computing.

摘要：

针对DNA编码序列设计问题，将其转换为带约束的多目标优化问题，在单链DNA集合中引入h-距离，构造了DNA序列间的共享函数，应用小种群遗传算法，对DNA编码序列设计问题进行求解。与已有结果比较，算法可以得到更好的DNA序列且计算效率较高。算法可用于DNA计算中编码序列的具体设计。

CLC Number:

TP301.6

ZHENG Xuedong WANG Bin ZHOU Shihua ZHOU Changjun. Design of DNA encoding sequences based on h-distance[J]. Journal of Computer Applications, 2014, 34(5): 1259-1262.

郑学东王宾周士华周昌军. 基于h-距离的DNA编码序列设计[J]. 计算机应用, 2014, 34(5): 1259-1262.

References

［1］ADLEMAN L M. Molecular computation of solution to combinatorial problems ［J］. Science, 1994,266(11):1021-1023.
［2］IGNATOVA Z, MARTINEZ-PEREZ I, ZIMMERMANN K H. DNA computing models ［M］. XI F, WANG S, QIANG X, translation. Beijing: Tsinghua University Press, 2010.(IGNATOVA Z, MARTINEZ-PEREZ I, ZIMMERMANN K H. DNA计算模型［M］. 郗方,王淑栋,强小利,译.北京:清华大学出版社,2010.)
［3］GARZON M, DEATON R, NEATHERY P, et al. On the encoding problem for DNA computing ［C］// Preliminary Proceedings of 3rd DIMACS Workshop on DNA-based Computers. Providence: American Mathematical Society, 1997:230-237.
［4］GARZON M H, DEATON R J. Codeword design and information encoding in DNA ensembles ［J］. Natural Computing, 2004,3(3):253-292.
［5］BAUM E B. DNA sequences useful for computation ［C］// Proceedings of 2nd DIMACS Workshop on DNA Based Computers. Providence: American Mathematical Society, 1996:122-127.
［6］GARZON M, NEATHERY P, DEATON R, et al. A new metric for DNA computing ［EB/OL］. ［2013-04-17］. http://csce.uark.edu/~rdeaton/dna/papers/gp97code.pdf.
［7］PHAN V, GARZON M H. On codeword design in metric DNA spaces ［J］. Natural Computing, 2009,8(3):571-588.
［8］SAGER J, STEFANOVIC D. Designing nucleotide sequences for computation: a survey of constraints ［C］// DNA '05: Proceedings of the 11th International Conference on DNA Computing. Berlin: Springer-Verlag, 2006: 275-289.
［9］PENCHOVSKY R, ACKERMANN J. DNA library design for molecular computation ［J］. Journal of Computational Biology, 2003,10(2):215-229.
［10］WANG W, ZHENG X, ZHANG Q, et al. The optimization of DNA encodings based on GA/SA algorithm ［J］. Progress in Natural Science, 2007,17(6):739-744.
［11］ZHANG Q, WANG B, ZHANG R, et al. Genetic algorithm-based design for DNA sequences sets ［J］. Chinese Journal of Computers, 2008,31(12):2193-2199.(张强，王宾，张锐，等.基于动态遗传算法的DNA序列集合设计［J］.计算机学报，2008,31(12):2193-2199.)
［12］ZHANG X, WANG Y, CUI G, et al. Application of a novel IWO to the design of encoding sequences for DNA computing ［J］. Computers and Mathematics with Applications, 2009,57(11/12):2001-2008.
［13］ARITA M, KOBAYASHI S. DNA sequence design using template ［J］. New Generation Computing, 2002,20(3):263-277.
［14］SHIN S Y, LEE I H, KIM D, et al. Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing ［J］. IEEE Transactions on Evolutionary Computation, 2005,9(2):143-158.
［15］CERVANTES-SALIDO V M, JAIME O, BRIZUELA C A, et al. Improving the design of sequences for DNA computing: a multiobjective evolutionary approach ［J］. Applied Soft Computing, 2013,13(12):4594-4607.
［16］CHAVES-GONZLEZ J M, VEGA- RODRGUEZ M A, GRANADO-CRIADO J M. A multiobjective swarm intelligence approach based on artificial bee colony for reliable DNA sequence design ［J］. Engineering Applications of Artificial Intelligence, 2013,26(9):2045-2057.
［17］ZHANG K, GENG X, XIAO J, et al. DNA sequence design problem and complexity analysis ［J］. Application Research of Computers, 2008,25(11):3264-3267.(张凯,耿修堂,肖建华,等.DNA编码问题及其复杂性研究［J］.计算机应用研究,2008,25(11):3264-3267.)
［18］SANTALUCIA J, HICKS D. The thermodynamics of DNA structural motifs ［J］. Annual Review of Biophysics and Biomolecular Structure, 2004,33:415-440.

[1]	. YOLOv5s-MRD: an efficient fire and smoke detection algorithm for complex scenarios based on YOLOv5s [J]. Journal of Computer Applications, 0, (): 0-0.
[2]	Qiye ZHANG, Xinrui ZENG. Efficient active-set method for support vector data description problem with Gaussian kernel [J]. Journal of Computer Applications, 2024, 44(12): 3808-3814.
[3]	. Path planning of multi-UAV formation based on improved artificial potential field method [J]. Journal of Computer Applications, 0, (): 0-0.
[4]	. Dual-population dual-stage evolutionary algorithm for complex constrained multi-objective optimization problems [J]. Journal of Computer Applications, 0, (): 0-0.
[5]	Qin LENG, Zhengyuan MAO. Two echelon location-routing optimization considering facility sizing decision [J]. Journal of Computer Applications, 2024, 44(11): 3513-3520.
[6]	Qingyuan PENG, Xiaofeng WANG, Junxia WANG, Yingying HUA, Ao TANG, Fei HE. Review of phase transition in satisfiability problems [J]. Journal of Computer Applications, 2024, 44(11): 3503-3512.
[7]	Renke SUN, Zhiyu HUANGFU, Hu CHEN, Zhongnian LI, Xinzheng XU. Survey of neural architecture search [J]. Journal of Computer Applications, 2024, 44(10): 2983-2994.
[8]	Antai SUN, Ye LIU, Dongmei XU. Dynamic surface asymptotic compensation algorithm for multi-agent systems [J]. Journal of Computer Applications, 2024, 44(10): 3151-3157.
[9]	Chaoying YAN, Ziyi ZHANG, Yingnan QU, Qiuyu LI, Dixiang ZHENG, Lijun SUN. Double auction carbon trading based on consortium blockchain [J]. Journal of Computer Applications, 2024, 44(10): 3240-3245.
[10]	. Dung beetle optimizer algorithm with restricted reverse learning and Cauchy-Gauss variation [J]. Journal of Computer Applications, 0, (): 0-0.
[11]	Guanglei YAO, Juxia XIONG, Guowu YANG. Flower pollination algorithm based on neural network optimization [J]. Journal of Computer Applications, 2024, 44(9): 2829-2837.
[12]	Shanglong LI, Jianhua LIU, Heming JIA. Reptile search algorithm based on multi-hunting coordination strategy [J]. Journal of Computer Applications, 2024, 44(9): 2818-2828.
[13]	Yan LI, Dazhi PAN, Siqing ZHENG. Improved adaptive large neighborhood search algorithm for multi-depot vehicle routing problem with time window [J]. Journal of Computer Applications, 2024, 44(6): 1897-1904.
[14]	. Robust shapeles representation method for time series [J]. Journal of Computer Applications, 0, (): 0-0.
[15]	HU Linbo , NI Zhiwei , CHENG Jiale, LIU Wentao , ZHU Xuhui , . Complex collaborative crowdsourcing task allocation method based on fusion community detection [J]. Journal of Computer Applications, 0, (): 0-0.

Design of DNA encoding sequences based on h-distance

基于h-距离的DNA编码序列设计

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics