Skip to main content

Analysing the Expressiveness of Metabolic Networks Representations

  • Conference paper
  • First Online:
Artificial Life and Evolutionary Computation (WIVACE 2023)

Abstract

In this work, we explore the expressiveness of three graph-based representations of metabolic networks. We consider Abstract Metabolic Networks (AMNs), metabolic-Directed Acyclic Graphs (m-DAGs) and Reaction Graphs (RGs). These representations form a hierarchical view of the metabolism, AMNs being the most abstract, m-DAGs serving as the intermediate, and RGs being the most detailed. We evaluate their expressiveness for a case study comprising 331 Vertebrates and by using the Weisfeiler-Lehman graph kernel to perform the comparison. The results show that AMNs are not able to discern the various taxonomic groups at the Class level, while m-DAGs and RGs clearly distinguish Mammals, Fishes and Birds. When focusing on Mammals at the Order level, only m-DAGs are partially able to identify some of the taxonomic groups. Moreover, m-DAGs are able to distinguish Primates at the Infraorder level of taxonomy. Based on the obtained results, it emerges that m-DAGs are a good compromise between the amount of network information and the computational effort needed to obtain reliable patterns on the taxonomic clustering of the different organisms.

This work was partially supported by DAIS - Ca’ Foscari University of Venice within the IRIDE program and Grant PID2021-126114NB-C44 funded by MCIN/AEI/ 10.13039/501100011033 and by “ERDF A way of making Europe”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Abaka, G., Bıyıkoğlu, T., Erten, C.: CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways. Bioinformatics 29(13), i145–i153 (2013)

    Article  Google Scholar 

  2. Alberich, R., Castro, J., Llabrés, M., Palmer-Rodríguez, P.: Metabolomics analysis: finding out metabolic building blocks. PLOS One 12(5), 1–25 (2017)

    Article  Google Scholar 

  3. Beguerisse-Díaz, M., Bosque, G., Oyarzún, D., Picó, J., Mauricio Barahona, M.: Flux-dependent graphs for metabolic networks. NPJ Syst. Biol. Appl. 4, 32 (2018)

    Article  Google Scholar 

  4. Biocyc Database Collection. https://biocyc.org/

  5. Biomodels database. https://www.ebi.ac.uk/biomodels/

  6. Caetano, R.A., Ispolatov, Y., Doebeli, M.: Evolution of diversity in metabolic strategies. eLife 10, 1–20 (2021)

    Article  Google Scholar 

  7. Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 5th edn. Chapman & Hall/CRC (2010)

    Google Scholar 

  8. Cox, M., Cox, T.: Multidimensional scaling. In: Chen, C., Härdle, W., Unwin, A. (eds.) Handbook of Data Visualization. Springer Handbooks Comp.Statistics, pp. 315–347. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-33037-0_14

    Chapter  Google Scholar 

  9. García, I., Chouaia, B., Llabrés, M., Simeoni, M.: Exploring the expressiveness of abstract metabolic networks. PLoS One 18(2) (2023)

    Google Scholar 

  10. Kauffman, K.J., Prakash, P., Edwards, J.: Advances in flux balance analysis. Curr. Opin. Biotechnol. 14(5), 491–496 (2003)

    Article  Google Scholar 

  11. Kyoto Encyclopedia of Genes and Genomes. https://www.genome.jp/kegg/

  12. Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5(1), 6 (2020). https://doi.org/10.1007/s41109-019-0195-3

    Article  Google Scholar 

  13. Nikolentzos, G., Meladianos, P., Vazirgiannis, M.: Matching node embeddings for graph similarity. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, AAAI 2017, pp. 2429–2435. AAAI Press (2017)

    Google Scholar 

  14. Nikolentzos, G., Siglidis, G., Vazirgiannis, M.: Graph kernels: a survey. arXiv e-print (2019)

    Google Scholar 

  15. Price, N.D., Reed, J.L., Palsson, B.: Genome-scale models of microbial cells: evaluating the consequences of constraints. Nat. Rev. Microbiol. 2(11), 886–897 (2004)

    Article  Google Scholar 

  16. R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2023). https://www.R-project.org/

  17. Rawls, K.D., Dougherty, B.V., Blais, E.M., Stancliffe, E., et al.: A simplified metabolic network reconstruction to promote understanding and development of flux balance analysis tools. Comput. Biol. Med. 105, 64–71 (2019)

    Article  Google Scholar 

  18. Shervashidze, N., Schweitzer, P., Leeuwen, E., Mehlhorn, K., Borgwardt, K.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12(Sep), 2539–2561 (2011)

    MathSciNet  Google Scholar 

  19. Siglidis, G., Nikolentzos, G., Limnios, S., Giatsidis, C., Skianis, K., Vazirgiannis, M.: GraKeL: a graph kernel library in python. ArXiv abs/1806.02193 (2018)

    Google Scholar 

  20. Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002). https://doi.org/10.1007/978-3-662-04921-1

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marta Simeoni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

García, I., Chouaia, B., Llabrés, M., Palmer-Rodríguez, P., Simeoni, M. (2024). Analysing the Expressiveness of Metabolic Networks Representations. In: Villani, M., Cagnoni, S., Serra, R. (eds) Artificial Life and Evolutionary Computation. WIVACE 2023. Communications in Computer and Information Science, vol 1977. Springer, Cham. https://doi.org/10.1007/978-3-031-57430-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-57430-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-57429-0

  • Online ISBN: 978-3-031-57430-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics