1. A DNA Algorithm for Calculating the Maximum Flow of a Network
- Author
-
Sackmann Andrea, Brown Kristelle, Formanowicz Piotr, Morgan Kevin, Kalsheker Noor, Garibaldi Jon M., and Błażewicz Jacek
- Subjects
dna computing ,network problems ,max-flow ,min-cut ,Electronic computers. Computer science ,QA75.5-76.95 - Abstract
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.
- Published
- 2023
- Full Text
- View/download PDF