Have a personal or library account? Click to login
A DNA Algorithm for Calculating the Maximum Flow of a Network Cover

Authors

Andrea Sackmann

Andrea.Sackmann@cs.put.poznan.pl

School of Computer Science, University of Nottingham, Jubilee Campus, Institute of Computing Science, Poznan University of Technology, Nottingham

Kristelle Brown

kristelle.brown@nottingham.ac.uk

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

Piotr Formanowicz

Piotr.Formanowicz@cs.put.poznan.pl

Institute of Computing Science, Poznan University of Technology, Poznań, Poland

Kevin Morgan

kevin.morgan@nottingham.ac.uk

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

Noor Kalsheker

noor.kalsheker@nottingham.ac.uk

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

Jon M. Garibaldi

jon.garibaldi@nottingham.ac.uk

School of Computer Science, University of Nottingham, Jubilee Campus, Nottingham, UK

Jacek Błażewicz

Jacek.Blazewicz@cs.put.poznan.pl

Institute of Computing Science, Poznan University of Technology, Institute of Bioorganic Chemistry, Polish Academy of Sciences, European Centre for Bioinformatics and Genomics, Poznań
DOI: https://doi.org/10.2478/fcds-2023-0021 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Language: English
Page range: 483 - 506
Submitted on: Apr 12, 2022
Accepted on: Dec 5, 2023
Published on: Dec 21, 2023
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2023 Andrea Sackmann, Kristelle Brown, Piotr Formanowicz, Kevin Morgan, Noor Kalsheker, Jon M. Garibaldi, Jacek Błażewicz, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.