Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (28): 83-85.DOI: 10.3778/j.issn.1002-8331.2008.28.029
• 研发、设计、测试 • Previous Articles Next Articles
MA Fang-fang1,SONG Tao1,LI Han2
Received:
Revised:
Online:
Published:
Contact:
马芳芳1,宋 弢1,李 涵2
通讯作者:
Abstract: DNA encoding is a problem of designing initial solutions in DNA computing,and the quality of the DNA codes can determine whether the DNA computing is successful or not.In this paper,we propose the method which takes a DNA code as a language formed by some grammar and prove the existence of the DNA encoding grammar.Then,by simplifying the alphabet of the grammar,we make the design of DNA encoding be equal to that of the binary grammar.Synchronously,we contrive a grammar which can produce a concrete DNA encoding.Finally,we get two properties of the DNA encoding grammar.
Key words: DNA computation, DNA encoding, Hamming distance, formal language, Turing machine
摘要: DNA编码问题是DNA计算中初始数据库的设计问题,DNA编码优劣直接影响DNA计算的成功与否。提出了将DNA编码视为是某个文法产生的语言的思想,并且证明了DNA编码文法的存在性;进而通过化简文法的字母表,将DNA编码文法的设计问题转化为二进制文法的设计问题;同时设计出产生某个具体DNA编码的文法,最后得到了DNA编码文法的两个性质。
关键词: DNA计算, DNA编码, Hamming距离, 形式语言, 图灵机
MA Fang-fang1,SONG Tao1,LI Han2. Analysis and research on DNA encoding grammar[J]. Computer Engineering and Applications, 2008, 44(28): 83-85.
马芳芳1,宋 弢1,李 涵2. DNA编码文法的分析与设计[J]. 计算机工程与应用, 2008, 44(28): 83-85.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2008.28.029
http://cea.ceaj.org/EN/Y2008/V44/I28/83