Towards a DNA solution to the shortest common superstring problem

This paper proposes a DNA algorithm for solving an NP-complete problem (the shortest common superstring problem) by manipulation of biomolecules, and presents partial results of the experiment that implements our algorithm. We also discuss practical constraints that have to be taken into account when implementing the algorithm, propose a coding system as a solution to these practical restrictions, and discuss the control experiments performed for establishing the parameters controlling the specificity of the assay