期刊文献+

DNA Golay码的设计与分析 被引量:6

The Design and Analysis of DNA Golay Codes
下载PDF
导出
摘要 DNA编码是DNA计算初始数据库中寡核苷酸序列的设计问题.合理的DNA编码可以提高实验的稳定性和正确性,从而确保DNA计算的成功率.本文给出DNA码字重量和DNA码字间Watson-Crick Hamming距离的定义;提出DNA Golay码的设计方法;分析了DNA Golay码的性质和规模;与随机搜索优码方法相比,DNA Golay码求解优码更加简单可行. DNA encoding is how to design the DNA sequences in the initial solution space of DNA computation. Reasonable DNA codes could improve the reliability and stability of experiment and the successful rate of computation. In this paper, we the definitions of the weight of a DNA codeword,the Watson- Crick Hamming Distance between two DNA codewords, and the design of DNA Golay codes. Then, we analyze the properties and the size of DNA Golay codes. Comparing with the stochastic search algorithm,DNA Golay codes are easier and more feasible to generate good code.
出处 《电子学报》 EI CAS CSCD 北大核心 2009年第7期1542-1545,共4页 Acta Electronica Sinica
基金 国家自然科学基金(No.60503002 No.30670540 No.60874036) 国家863高技术研究发展计划(No.2006AA01Z104) 中国博士后科学基金(No.20060400344) 浙江省自然科学基金(No.Y1080227)
关键词 DNA计算 DNA编码 GOLAY码 HAMMING距离 DNA computation DNA encoding Golay codc Hamming distance
  • 相关文献

参考文献12

  • 1Adleman.Molecular computation of solution to combinatorial problems[J].Science,1994,266(11):1021-1024.
  • 2E B Baum.DNA sequences useful for computation[A].Proc.Second Annual Meeting on DNA-Based Computers[C].Princeton:American Mathematical Society,1996.122-127.
  • 3M Garzon,et al.A new metric for DNA computing[A].Proc.of the 2nd Annual Genetic Programming Conference GP-97[C].San Francisco:Stanford University,1997.472-487.
  • 4Garzon M,Deaton R,Nino L F,Stevens S E,Witter M.Genome encoding for DNA computing[A].The Third DIMACS Workshop on DNA based Computing[C].Philadelphia:University of Pennsylvania,1997.230-273.
  • 5Feldkamp,et al.A DNA sequence complier[A].Proc.of 6th DIMACS Workshop on DNA based Computing[C].the Netherlands:University of Lei don,2000.253-257.
  • 6A G Frutos,et al.Demonstration of a word design strategy for DNA computing on surface[J].Nucleic Acids Research,1997,25(23):4748-4757.
  • 7M Arita.et al.The power of sequence design in DNA computing[A].The 4th International Conference on Computational Intelligence and Multimedia Applications[C].Yokosuka City:IEEE,2001.163-167.
  • 8Ravinderjit S Braich,Chi Johnson,Paul W K Rothemund,Leonard M Adleman.Solution of a satisfy problem on a gelbased DNA computer[A].The 6th International Workshop on DNA based Computing[C].London:Springer,2001.27-42.
  • 9Dan C.Tulpan,Holger H,Hoos,Anne E.Condon.Stochastic local search algorithms for DNA word design[A].DNA8[C].Hokkaido University,Japan:Springer,2002,2568:229-241.
  • 10Zhiquan Frank Qiu,Mi Lu.A new approach to advance the DNA computing[J].Applied Soft Computing,2003,3:177 -189.

同被引文献56

  • 1傅桂.反转循环码的构造和极小距离的计算[J].中山大学学报(自然科学版),2008,47(z1):32-37. 被引量:1
  • 2WANG ShiYing,YUAN Jun,LIN ShangWei.DNA labelled graphs with DNA computing[J].Science China Mathematics,2008,51(3):437-452. 被引量:2
  • 3朱翔鸥,刘文斌,孙川.DNA计算编码研究及其算法[J].电子学报,2006,34(7):1169-1174. 被引量:12
  • 4周康,同小军,许进.最优指派问题DNA算法[J].系统工程与电子技术,2007,29(7):1183-1187. 被引量:7
  • 5ADLEMAN A M. Molecular computation of solution to combinatorial problems[J].Science, 1994,266(5187) :1021- 1024.
  • 6LIPTON R J. DNA solution of hard computational problcms[J]. Science, 1995,268(5210) : 542-545.
  • 7BONEH D, DUNWORTH C, LIPTON R. Breaking DES using a molecular computer[ C ]//Proc of the 1st DIMACS Workshop on DNA Based Computers. Providence : American Mathematics Society, 1995 : 37- 65.
  • 8GARZON M, DEATON R, NEATHERY P. On the encoding problem for DNA computing[ C]//Proc of the 3rd DIMACS Workshop on DNA Based Computers. 1997:230-237.
  • 9OUYANG Qi, KAPLAN P D, LIU Shu-mao. DNA solution of the maximal clique problem [ J ]. Science, 1997,278 (5337) : 446- 449.
  • 10BAUM E B. DNA sequences useful for computation[ C]//Proc of the 2nd Annual Meeting DNA-based Computers. Providence: American Mathematical Society, 1996.

引证文献6

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部