| 摘要 |
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 x of length k, which occurs in any two sequences äZjü or subsequence x occurs in a sequence S0ZjS0 and the complement x occurs in a sequence S0ZiS0, where Zj is at least of length k, so that it may be extracted. <IMAGE>
|
