DNA运算
计算机科学
DNA
编码(集合论)
理论计算机科学
算法
计算生物学
程序设计语言
生物
遗传学
计算
集合(抽象数据类型)
作者
Olgica Milenković,Navin Kashyap
标识
DOI:10.1109/isit.2005.1523340
摘要
In this paper, we consider the problem of designing DNA sequences (codewords) for DNA storage systems and DNA computing that are unlikely to fold back onto themselves to form undesirable secondary structures. The paper addresses both the issue of enumerating the sequences with such properties and the problem of practical code construction.
科研通智能强力驱动
Strongly Powered by AbleSci AI