arXiv subjects

Marco Beccuti

Publications and source records attributed to Marco Beccuti.

7 recordsLinked to original sources

arXiv2026

Machine Learning for analysis of Multiple Sclerosis cross-tissue bulk and single-cell transcriptomics data

Multiple Sclerosis (MS) is a chronic autoimmune disease of the central nervous system whose molecular mechanisms remain incompletely understood. In this study, we developed an end-to-end machine learning pipeline to analyze transcriptomic data from peripheral blood mononuclear cells and cerebrospinal fluid, integrating both bulk microarray and single-cell RNA sequencing datasets (concentrating on CD4+ and B-cells). After rigorous preprocessing, batch correction, and gene declustering, XGBoost classifiers were trained to distinguish MS patients from healthy controls. Explainable AI tools, namely SHapley Additive exPlanations (SHAP), were employed to identify key genes driving classification, and results were compared with Differential Expression Analysis (DEA). SHAP-prioritized genes were further investigated through interaction networks and pathway enrichment analyses. The models achieved strong performance, particularly in CSF B-cells (AUC=0.94) and microarray (AUC=0.86). SHAP gene selection proved to be complementary to classical DEA. Gene clusters identified across multiple datasets highlighted immune activation, non-canonical immune checkpoints (ITK, CLEC2D, KLRG1, CEACAM1), ribosomal and translational programs, ubiquitin-proteasome regulation, lipid trafficking, and Epstein-Barr virus-related pathways. Our integrative and explainable framework reveals complementary insights beyond conventional analysis and provides novel mechanistic hypotheses and potential biomarkers for MS pathogenesis.

q-bio.GN↗

arXiv2020

Multiple Sclerosis disease: a computational approach for investigating its drug interactions

Multiple Sclerosis (MS) is a chronic and potentially highly disabling disease that can cause permanent damage and deterioration of the central nervous system. In Europe it is the leading cause of non-traumatic disabilities in young adults, since more than 700,000 EU people suffer from MS. Although recent studies on MS pathophysiology have been provided, MS remains a challenging disease. In this context, thanks to recent advances in software and hardware technologies, computational models and computer simulations are becoming appealing research tools to support scientists in the study of such disease. Thus, motivated by this consideration we propose in this paper a new model to study the evolution of MS in silico, and the effects of the administration of Daclizumab drug, taking into account also spatiality and temporality of the involved phenomena. Moreover, we show how the intrinsic symmetries of the system can be exploited to drastically reduce the complexity of its analysis.

q-bio.QM↗

arXiv2018

A review of the deterministic and diffusion approximations for stochastic chemical reaction networks

This work reviews deterministic and diffusion approximations of the stochastic chemical reaction networks and explains their applications. We discuss the added value the diffusion approximation provides for systems with different phenomena, such as a deficiency and a bistability. It is advocated that the diffusion approximation can be considered as an alternative theoretical approach to study the reaction networks rather than a simulation shortcut. We discuss two examples in which the diffusion approximation is able to catch qualitative properties of reaction networks that the deterministic model misses. We provide an explicit construction of the original process and the diffusion approximation such that the distance between their trajectories is controlled and demonstrate this construction for the examples. We also discuss the limitations and potential directions of the developments.

math.PR↗

arXiv2015

Approximate analysis of biological systems by hybrid switching jump diffusion

In this paper we consider large state space continuous time Markov chains (MCs) arising in the field of systems biology. For density dependent families of MCs that represent the interaction of large groups of identical objects, Kurtz has proposed two kinds of approximations. One is based on ordinary differential equations, while the other uses a diffusion process. The computational cost of the deterministic approximation is significantly lower, but the diffusion approximation retains stochasticity and is able to reproduce relevant random features like variance, bimodality, and tail behavior. In a recent paper, for particular stochastic Petri net models, we proposed a jump diffusion approximation that aims at being applicable beyond the limits of Kurtz's diffusion approximation, namely when the process reaches the boundary with non-negligible probability. Other limitations of the diffusion approximation in its original form are that it can provide inaccurate results when the number of objects in some groups is often or constantly low and that it can be applied only to pure density dependent Markov chains. In order to overcome these drawbacks, in this paper we propose to apply the jump-diffusion approximation only to those components of the model that are in density dependent form and are associated with high population levels. The remaining components are treated as discrete quantities. The resulting process is a hybrid switching jump diffusion. We show that the stochastic differential equations that characterize this process can be derived automatically both from the description of the original Markov chains or starting from a higher level description language, like stochastic Petri nets. The proposed approach is illustrated on three models: one modeling the so called crazy clock reaction, one describing viral infection kinetics and the last considering transcription regulation.

cs.PF↗

arXiv2014

Analysis of Petri Net Models through Stochastic Differential Equations

It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODEs) when their indexing parameter grows very large. This approximation cannot capture the stochastic nature of the process and, consequently, it can provide an erroneous view of the behavior of the Markov chain if the indexing parameter is not sufficiently high. Important phenomena that cannot be revealed include non-negligible variance and bi-modal population distributions. A less-known approximation proposed by Kurtz applies stochastic differential equations (SDEs) and provides information about the stochastic nature of the process. In this paper we apply and extend this diffusion approximation to study stochastic Petri nets. We identify a class of nets whose underlying stochastic process is a density dependent Markov chain whose indexing parameter is a multiplicative constant which identifies the population level expressed by the initial marking and we provide means to automatically construct the associated set of SDEs. Since the diffusion approximation of Kurtz considers the process only up to the time when it first exits an open interval, we extend the approximation by a machinery that mimics the behavior of the Markov chain at the boundary and allows thus to apply the approach to a wider set of problems. The resulting process is of the jump-diffusion type. We illustrate by examples that the jump-diffusion approximation which extends to bounded domains can be much more informative than that based on ODEs as it can provide accurate quantity distributions even when they are multi-modal and even for relatively small population levels. Moreover, we show that the method is faster than simulating the original Markov chain.

cs.PF↗

arXiv2013

Model Checking Contest @ Petri Nets, Report on the 2013 edition

This document presents the results of the Model Checking Contest held at Petri Nets 2013 in Milano. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. This is the third edition after two successful editions in 2011 and 2012. The participating tools were compared on several examinations (state space generation and evaluation of several types of formulæ -- reachability, LTL, CTL for various classes of atomic propositions) run on a set of common models (Place/Transition and Symmetric Petri nets). After a short overview of the contest, this paper provides the raw results from the contest, model per model and examination per examination. An HTML version of this report is also provided (http://mcc.lip6.fr).

cs.SE↗

arXiv2011

Barcoding-free BAC Pooling Enables Combinatorial Selective Sequencing of the Barley Gene Space

We propose a new sequencing protocol that combines recent advances in combinatorial pooling design and second-generation sequencing technology to efficiently approach de novo selective genome sequencing. We show that combinatorial pooling is a cost-effective and practical alternative to exhaustive DNA barcoding when dealing with hundreds or thousands of DNA samples, such as genome-tiling gene-rich BAC clones. The novelty of the protocol hinges on the computational ability to efficiently compare hundreds of million of short reads and assign them to the correct BAC clones so that the assembly can be carried out clone-by-clone. Experimental results on simulated data for the rice genome show that the deconvolution is extremely accurate (99.57% of the deconvoluted reads are assigned to the correct BAC), and the resulting BAC assemblies have very high quality (BACs are covered by contigs over about 77% of their length, on average). Experimental results on real data for a gene-rich subset of the barley genome confirm that the deconvolution is accurate (almost 70% of left/right pairs in paired-end reads are assigned to the same BAC, despite being processed independently) and the BAC assemblies have good quality (the average sum of all assembled contigs is about 88% of the estimated BAC length).

q-bio.GN↗