| 摘要 |
In DNA computing there are DNA sequences which will substantially eliminate binding errors for molecules used in the computing processing. The elimination of binding errors will prevent extraction errors and binding during computations. A set of DNA sequences {Zj} and spacer sequence S0 must meet the criteria that there is no subsequence chi of length k, which occurs in any two sequences {Zj} or subsequence chi occurs in a sequence S0ZjS0 and the complement +E,ovs chi +EE occurs in a sequence S0ZjS0, where Zj is at least of length k, so that it may be extracted.
|
