A DNA Algorithm for Calculating the Maximum Flow of a Network-Reference-Cited by-同舟云学术

A DNA Algorithm for Calculating the Maximum Flow of a Network

Published:2023-12-01 Issue:4 Volume:48 Page:483-506
ISSN:2300-3405
Container-title:Foundations of Computing and Decision Sciences
language:en
Short-container-title:

Author:

Sackmann Andrea¹,Brown Kristelle²,Formanowicz Piotr³,Morgan Kevin⁴,Kalsheker Noor⁵,Garibaldi Jon M.⁶,Błażewicz Jacek⁷

Affiliation:

1. * School of Computer Science, University of Nottingham, Jubilee Campus , Wollaton Road , Nottingham , , UK and Institute of Computing Science, Poznan University of Technology , Piotrowo 2 , Poznań , Poland

2. † School of Molecular Medical Sciences, Queen’s Medical Centre, University of Nottingham , Nottingham , , UK

3. ‡ Institute of Computing Science, Poznan University of Technology , Piotrowo 2 , Poznań , Poland

4. § School of Molecular Medical Sciences, Queen’s Medical Centre, University of Nottingham , Nottingham , , UK

5. ¶ School of Molecular Medical Sciences, Queen’s Medical Centre, University of Nottingham , Nottingham , , UK

6. ǁ School of Computer Science, University of Nottingham, Jubilee Campus , Wollaton Road , Nottingham , , UK

7. ** Institute of Computing Science, Poznan University of Technology , Piotrowo 2 , Poznań , Poland ; Institute of Bioorganic Chemistry, Polish Academy of Sciences , Noskowskiego 12/14 , Poznań , Poland , and European Centre for Bioinformatics and Genomics , Piotrowo 2 , Poznań , Poland

Abstract

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. 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.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/fcds-2023-0021

Reference39 articles.

1. Adleman, L., Molecular computation of solutions to combinatorial problems, Science 266, 1021–1024 (1994).

2. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Upper Saddle River, NJ, 1993.

3. Benenson, Y., DNA computes a square root, Nature Nanotechnology 6, 465–467 (2011).

4. Błażewicz, J., Formanowicz, P., Urbaniak, R., DNA Based Algorithms for Some Scheduling Problems, In: Raidl, G. et al. Applications of Evolutionary Computing. EvoWorkshops 2003. LNCS 2611, Springer, Berlin, Heidelberg, 673–683 (2003).

5. Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., and Adleman, L., Solution of a 20-variable 3-SAT problem on a DNA compute, Science 296, 499–502 (2002).