Modelling and vErification of alkaptonuria and multiple sclerosis Driven by biomedICAl data
The goal of this project is to bridge the gap between data, models and validation, integrating the data-driven and model-driven research directions, so that to develop next generation modelling and analysis approaches for biomedical investigations.
We are developing the MEDICA framework, which combines three analysis phases: (1) extracting existing knowledge from integrated datasets, that will feed into (2) building multilevel mechanistic models, which will then go through (3) validation and model checking.
Biomedical research needs are the driving force of the project. We are tackling open research questions for Multiple Sclerosis (MS) and Alkaptonuria (AKU), for which we have world-leading experts in our consortium.
Our team
- Alina Sîrbu
- Silvia Giulia Galfrè
- Francesca Levi
- Paolo Milazzo
- Corrado Priami
- Elvio Amparore
- Marco Beccuti
- Marinella Clerico
- Massimiliano De Pierro
- Alessandro Maglione
- Simone Pernice
- Simona Rolla
- James Sproston
- Moreno Falaschi
- Francesca Ariani
- Linda Brodo
- Sara Brunetti
- Caterina Graziani
- Veronica Lachi
- Giulia Palma
- Alessandra Renieri
- Simone Rinaldi
- Bianca Roncaglia
- Ottavia Spiga
- Anna Visibelli
- Simone Tini
- Ruggero Lanotte
- Desiree Manicardi
- Nicoletta Sabadini
Contact: alina.sirbu@unipi.it
Publications
2024
Graziani, Caterina; Drucks, Tamara; Jogl, Fabian; Bianchini, Monica; scarselli,; Gärtner, Thomas
The Expressive Power of Path-Based Graph Neural Networks Proceedings Article
In: Forty-first International Conference on Machine Learning, 2024.
@inproceedings{graziani2024the,
title = {The Expressive Power of Path-Based Graph Neural Networks},
author = {Caterina Graziani and Tamara Drucks and Fabian Jogl and Monica Bianchini and scarselli and Thomas Gärtner},
url = {https://openreview.net/forum?id=io1XSRtcO8},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
booktitle = {Forty-first International Conference on Machine Learning},
abstract = {We systematically investigate the expressive power of path-based graph neural networks. While it has been shown that path-based graph neural networks can achieve strong empirical results, an investigation into their expressive power is lacking. Therefore, we propose PATH-WL, a general class of color refinement algorithms based on paths and shortest path distance information. We show that PATH-WL is incomparable to a wide range of expressive graph neural networks, can count cycles, and achieves strong empirical results on the notoriously difficult family of strongly regular graphs. Our theoretical results indicate that PATH-WL forms a new hierarchy of highly expressive graph neural networks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Brodo, Linda; Bruni, Roberto; Falaschi, Moreno
A framework for monitored dynamic slicing of Reaction Systems Journal Article
In: Natural Computing, 2024.
@article{BBF24,
title = {A framework for monitored dynamic slicing of Reaction Systems},
author = {Linda Brodo and Roberto Bruni and Moreno Falaschi},
doi = {https://doi.org/10.1007/s11047-024-09976-3},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
journal = {Natural Computing},
abstract = {Reaction systems (RSs) are a computational framework inspired by biochemical mechanisms. A RS defines a finite set of reactions over a finite set of entities. Typically each reaction has a local scope, because it is concerned with a small set of entities, but complex models can involve a large number of reactions and entities, and their computation can manifest unforeseen emerging behaviours. When a deviation is detected, like the unexpected production of some entities, it is often difficult to establish its causes, e.g., which entities were directly responsible or if some reaction was misconceived. Slicing is a well-known technique for debugging, which can point out the program lines containing the faulty code. In this paper, we define the first dynamic slicer for RSs and show that it can help to detect the causes of erroneous behaviour and highlight the involved reactions for a closer inspection. To fully automate the debugging process, we propose to distil monitors for starting the slicing whenever a violation from a safety specification is detected. We have integrated our slicer in BioResolve, written in Prolog which provides many useful features for the formal analysis of RSs. We define the slicing algorithm for basic RSs and then enhance it for dealing with quantitative extensions of RSs, where timed processes and linear processes can be represented. Our framework is shown at work on suitable biologically inspired RS models.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2023
Pernice, Simone; Maglione, Alessandro; Tortarolo, Dora; Sirovich, Roberta; Clerico, Marinella; Rolla, Simona; Beccuti, Marco; Cordero, Francesca
A new computational workflow to guide personalized drug therapy Journal Article
In: Journal of Biomedical Informatics, vol. 148, pp. 104546, 2023, ISSN: 1532-0464.
@article{PERNICE2023104546,
title = {A new computational workflow to guide personalized drug therapy},
author = {Simone Pernice and Alessandro Maglione and Dora Tortarolo and Roberta Sirovich and Marinella Clerico and Simona Rolla and Marco Beccuti and Francesca Cordero},
url = {https://www.sciencedirect.com/science/article/pii/S1532046423002678},
doi = {https://doi.org/10.1016/j.jbi.2023.104546},
issn = {1532-0464},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {Journal of Biomedical Informatics},
volume = {148},
pages = {104546},
abstract = {Objective:
Computational models are at the forefront of the pursuit of personalized medicine thanks to their descriptive and predictive abilities. In the presence of complex and heterogeneous data, patient stratification is a prerequisite for effective precision medicine, since disease development is often driven by individual variability and unpredictable environmental events. Herein, we present GreatNectorworkflow as a valuable tool for (i) the analysis and clustering of patient-derived longitudinal data, and (ii) the simulation of the resulting model of patient-specific disease dynamics.
Methods:
GreatNectoris designed by combining an analytic strategy composed of CONNECTOR, a data-driven framework for the inspection of longitudinal data, and an unsupervised methodology to stratify the subjects with GreatMod, a quantitative modeling framework based on the Petri Net formalism and its generalizations.
Results:
To illustrate GreatNectorcapabilities, we exploited longitudinal data of four immune cell populations collected from Multiple Sclerosis patients. Our main results report that the T-cell dynamics after alemtuzumab treatment separate non-responders versus responders patients, and the patients in the non-responders group are characterized by an increase of the Th17 concentration around 36 months.
Conclusion:
GreatNectoranalysis was able to stratify individual patients into three model meta-patients whose dynamics suggested insight into patient-tailored interventions.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Computational models are at the forefront of the pursuit of personalized medicine thanks to their descriptive and predictive abilities. In the presence of complex and heterogeneous data, patient stratification is a prerequisite for effective precision medicine, since disease development is often driven by individual variability and unpredictable environmental events. Herein, we present GreatNectorworkflow as a valuable tool for (i) the analysis and clustering of patient-derived longitudinal data, and (ii) the simulation of the resulting model of patient-specific disease dynamics.
Methods:
GreatNectoris designed by combining an analytic strategy composed of CONNECTOR, a data-driven framework for the inspection of longitudinal data, and an unsupervised methodology to stratify the subjects with GreatMod, a quantitative modeling framework based on the Petri Net formalism and its generalizations.
Results:
To illustrate GreatNectorcapabilities, we exploited longitudinal data of four immune cell populations collected from Multiple Sclerosis patients. Our main results report that the T-cell dynamics after alemtuzumab treatment separate non-responders versus responders patients, and the patients in the non-responders group are characterized by an increase of the Th17 concentration around 36 months.
Conclusion:
GreatNectoranalysis was able to stratify individual patients into three model meta-patients whose dynamics suggested insight into patient-tailored interventions.
Graziani, Caterina; Drucks, Tamara; Bianchini, Monica; scarselli,; Gärtner, Thomas
No PAIN no Gain: More Expressive GNNs with Paths Proceedings Article
In: NeurIPS 2023 Workshop: New Frontiers in Graph Learning, 2023.
@inproceedings{<LineBreak>graziani2023no,
title = {No PAIN no Gain: More Expressive GNNs with Paths},
author = {Caterina Graziani and Tamara Drucks and Monica Bianchini and scarselli and Thomas Gärtner},
url = {https://openreview.net/forum?id=q2xXh4M9Dx},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
booktitle = {NeurIPS 2023 Workshop: New Frontiers in Graph Learning},
abstract = {Motivated by the lack of theoretical investigation into the discriminative power of paths, we characterize classes of graphs where paths are sufficient to identify every instance. Our analysis motivates the integration of paths into the learning procedure of graph neural networks in order to enhance their expressiveness. We formally justify the use of paths based on finite-variable counting logic and prove the effectiveness of paths to recognize graph structural features related to cycles and connectivity. We show that paths are able to identify graphs for which higher-order models fail. Building on this, we propose PAth Isomorphism Network (PAIN), a novel graph neural network that replaces the topological neighborhood with paths in the aggregation step of the message-passing procedure. This modification leads to an algorithm that is strictly more expressive than the Weisfeiler-Leman graph isomorphism test, at the cost of a polynomial-time step for every iteration and fixed path length. We support our theoretical findings by empirically evaluating PAIN on synthetic datasets.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This project was financed by the European Union – Next-GenerationEU – National Recovery and Resilience Plan (NRRP) – MISSION 4 COMPONENT 2, INVESTMENT N. 1.1, CALL PRIN 2022 D.D. 104 02-02-2022 – MEDICA CUP N. I53D23003720006 .