Roberto Pagliarini

Dr. Roberto Pagliarini

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 August 2024
Verified
Book Chapter
Closed access
PDF file
RPRoberto Pagliarini
Roberto Pagliarini
FMFabio Marroni
Fabio Marroni
Carla  PiazzaCarla Piazza
Carla Piazza
GGGiovanni Gabelli
Giovanni Gabelli
GMGabriele Magris
Gabriele Magris
Alberto PolicritiAlberto Policriti
Alberto Policriti

1 April 2026 in BMC Bioinformatics
Verified
Journal Article
Open access
RPRoberto Pagliarini
Roberto Pagliarini
FNFrancesco Nascimben
Francesco Nascimben
APAlberto Policriti
Alberto Policriti
Background: Allele Specific Expression analysis is an important tool for integrating genome and transcriptome data. It quantifies expression variation between the two haplotypes of a diploid individual distinguished by heterozygous sites, and is a powerful tool to estimate cis- regulatory diversity of alleles. Clustering algorithms can be used to identify patterns or groups of genes/samples based on their expression profiles. Depending on the structure of the data, different existing clustering algorithm can be adapted to allele specific expression data. However, no ad-hoc procedure has been developed. Results: In this work, we begin defining an expression matrix capturing allele expressions from an RNA-sequencing experiment. On this matrix, we develop a novel two-phase unsupervised clustering procedure, built on top of a spectral clustering algorithm, whose aim is to partition the population into groups of similar individuals, according to their allelic expression. As case-studies, the approach is used to cluster 98 cultivars representative of the variability observed in Vitis vinifera, starting from read counts of genes of chromosome 1 of leaves, and to analyze allele-specific count data from a CASTxMRL F1 hybrid mice dataset. Conclusion: Using the above mentioned real case-studies as well as generated synthetic data, we see that our algorithm shows significant robustness and outperforms other standard clustering techniques.


22 September 2025 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
CACasagrande Alberto
Casagrande Alberto
FFFrancesco Fabris
Francesco Fabris
RGRossano Girometti
Rossano Girometti
RPRoberto Pagliarini
Roberto Pagliarini
Agreement measures, such as Cohen’s kappa or intraclass correlation, gauge the matching between two or more classifiers. They are used in a wide range of contexts from medicine, where they evaluate the effectiveness of medical treatments and clinical trials, to artificial intelligence, where they can quantify the approximation due to the reduction of a classifier. The consistency of different classifiers to a gold standard can be compared simply by using the order induced by their agreement measure with respect to the gold standard itself. Nevertheless, labelling an approach as good or bad exclusively by using the value of an agreement measure requires a scale or a significativity index. Some quality scales have been proposed in the literature for Cohen’s kappa, but they are mainly naïve, and their boundaries are arbitrary. We propose a general approach to evaluate the significance of any agreement value between two classifiers as the probability of randomly choosing a confusion matrix, built over the same data set, with a lower agreement value. This measure, named significativity, gauges the relevance of the observed agreement value rather than replacing the agreement measure used to calculate it. This work introduces two significativity indices: one dealing with finite data sets, the other one handling classification probability distributions. This manuscript also addresses the computational challenges of evaluating such indices and proposes some efficient algorithms for their evaluation.

16 December 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
RPRoberto Pagliarini
Roberto Pagliarini
Carla  PiazzaCarla Piazza
Carla Piazza
Epigenetic variation and somatic mutations represent molecular components of biodiversity that directly link the genome to the environment

14 April 2026 in Frontiers in Bioinformatics
Verified
Journal Article
Open access
PDF file
RPRoberto Pagliarini
Roberto Pagliarini
FNFrancesco Nascimben
Francesco Nascimben
APAlberto Policriti
Alberto Policriti
Allele Specific Expression data quantifies expression variation between the two haplotypes of a diploid individual distinguished by heterozygous sites. Current methodologies of genome-wide sequencing produce large amounts of missing data that may affect statistical inference and bias the outcome of experiments. Machine learning tools could be employed to explore the data and to estimate missing signatures. We present a two-phase procedure based on Self-Organizing Maps (SOMs), an unsupervised clustering technique, to recover missing allele specific expression data from RNA-seq experiments. Specifically, a SOM trained on a complete population P is used to assign a so-called corrupted individual p ̂ to its most fitting cluster c ; then, a completion rule based on allele frequencies within the subpopulation of P c ⊆ P defined by c is employed to reconstruct p ̂ . To evaluate our approach, we first apply it to purely artificial datasets, in order to have full control over all experimental conditions. After that, we consider a real population of Vitis vinifera , which we also extend by applying a computational framework to generate synthetic individuals from allele expression data. We then introduce two local feature relevance indices in order to assess the influence of specific alleles on the topological placement of corrupted individuals in the SOM structure. Our results, showing promising accuracy in the prediction of missing alleles, suggest that the developed approach could be very useful for recovering incomplete samples in a dataset instead of discarding them, mainly in situations where experiments are challenging.