Pathway Realizability in Chemical Networks
Journal of Computational Biology · 01.02.2025 · 32 (2) · 164-187
DOI: 10.1089/cmb.2024.0521 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computational Biology, erschienen am 01.02.2025. Verfasst von Jakob L Andersen und 5 weiteren Autor:innen. Beteiligte Einrichtung: Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark. Hauptthemen laut MEDLINE: Metabolic Networks and Pathways, Computational Biology, Models, Biological. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 34 Literaturangaben.
Abstract (Originalsprache)
The exploration of pathways and alternative pathways that have a specific function is of interest in numerous chemical contexts. A framework for specifying and searching for pathways has previously been developed, but a focus on which of the many pathway solutions are realizable, or can be made realizable, is missing. Realizable here means that there actually exists some sequencing of the reactions of the pathway that will execute the pathway. We present a method for analyzing the realizability of pathways based on the reachability question in Petri nets. For realizable pathways, our method also provides a certificate encoding an order of the reactions, which realizes the pathway. We present two extended notions of realizability of pathways, one of which is related to the concept of network catalysts. We exemplify our findings on the pentose phosphate pathway. Furthermore, we discuss the relevance of our concepts for elucidating the choices often implicitly made when depicting pathways. Lastly, we lay the foundation for the mathematical theory of realizability.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark.
- Institute for Theoretical Chemistry, University of Vienna, Wien, Austria.
- Research Network Chemistry Meets Microbiology, University of Vienna, Wien, Austria.
- Algorithmic Cheminformatics Group, Faculty of Technology, Bielefeld University, Bielefeld, Germany.
- Department of Computer Science, and Interdisciplinary Centerfor Bioinformatics, University of Leipzig, Leipzig, Germany.
- Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany.
ORCID-Profile: Sissel Banke, Daniel Merkle
Zitieren
APA
Andersen, J. L., Banke, S., Fagerberg, R., Flamm, C., Merkle, D., & Stadler, P. F. (2025). Pathway Realizability in Chemical Networks. Journal of Computational Biology, 32(2), 164-187. https://doi.org/10.1089/cmb.2024.0521
Vancouver
Andersen JL, Banke S, Fagerberg R, Flamm C, Merkle D, Stadler PF. Pathway Realizability in Chemical Networks. Journal of Computational Biology. 2025;32(2):164-187. doi:10.1089/cmb.2024.0521
BibTeX
@article{Andersen2025,
author = {Andersen, Jakob L and Banke, Sissel and Fagerberg, Rolf and Flamm, Christoph and Merkle, Daniel and Stadler, Peter F},
title = {Pathway Realizability in Chemical Networks},
journal = {Journal of Computational Biology},
year = {2025},
volume = {32},
number = {2},
pages = {164--187},
doi = {10.1089/cmb.2024.0521}
}
EUVIMED