A DNA Algorithm for Calculating the Maximum Flow of a Network

DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied. We aim to provide an approach to calculate the value of the maximum flow in networks by encoding the mathematical problem in DNA molecules and by using molecular biology techniques to manipulate the DNA. We present results which demonstrate that the algorithm works for an example network problem.

This paper presents the first application of DNA computing to network-flow problems. The presented algorithm has a linear time complexity where the calculation itself is done in a constant number of steps.