A novel algorithm based on DNA computing for adding binary integer numbers is presented. It requires the unique representation of bits placed in test tubes treated as registers. Amplification step used for the carry operation allows one, in theory, to add numbers with the same quantity of elementary operations, regardless of the number of bits used for representation. New notation proposed in the paper allows for efficient and abstract description of the technical operations on DNA.

In the paper we propose a new method of tuning the probabilities of the genetic operators. We assume that every member of optimized population conducts his own ranking of genetic operators qualities. This ranking becomes a base to compute the probabilities of appearance and execution of genetic operators. This set of probabilities is a base of experience of every individual and according to this it chooses the operator in every iteration of the algorithm. Due to this experience one can maximize chances of his offspring to survive.