Fast Solutions for DNA Code Words Test

An essential part of any DNA computation is to encode data on DNA strands. Performing such computation we must be sure that no undesirable hybridization will occur. The aim of this paper is to present algorithms which can test if a given set of code words satisfies certain coding and involutory properties, as it is necessary to prevent undesirable DNA strands interactions. These algorithms are based on the theory of codes and pattern matching methods. If we denote by m sum of the lengths of words in a given set, then all presented algorithms can be realized with O(m2) complexity both for time and space.