The motivation for the theorems presented in this article, is that they concur with the Nussinov-Jacobson algorithm, in that the existence of cyclic structure helps in reducing complexity and thus prevents secondary structure formation . i . e . these algorithms satisfy some or all the design requirements for DNA oligonucleotides at the time of hybridization ( which is the core of the DNA computing process ) and hence do not suffer from the problems of self-hybridization.
