Andrea Passerini

Dr. Andrea Passerini


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
1 July 2006 in Nucleic Acids Research
Verified
Journal Article
Open access
ACA. Ceroni
A. Ceroni
APAndrea Passerini
Andrea Passerini
AVA. Vullo
A. Vullo
PFP. Frasconi
P. Frasconi
DISULFIND is a server for predicting the disulfide bonding state of cysteines and their disulfide connectivity starting from sequence alone. Optionally, disulfide connectivity can be predicted from sequence and a bonding state assignment given as input. The output is a simple visualization of the assigned bonding state (with confidence degrees) and the most likely connectivity patterns. The server is available at http://disulfind.dsi.unifi.it/.

6 June 2012 in BMC Genomics
Verified
Journal Article
Open access
PDF file
TTToma Tebaldi
Toma Tebaldi
ARAngela Re
Angela Re
GVGabriella Viero
Gabriella Viero
IPIlaria Pegoretti
Ilaria Pegoretti
APAndrea Passerini
Andrea Passerini
AQAlessandro Quattrone
Alessandro Quattrone
Background: The classical view on eukaryotic gene expression proposes the scheme of a forward flow for which fluctuations in mRNA levels upon a stimulus contribute to determine variations in mRNA availability for translation. Here we address this issue by simultaneously profiling with microarrays the total mRNAs (the transcriptome) and the polysome-associated mRNAs (the translatome) after EGF treatment of human cells, and extending the analysis to other 19 different transcriptome/translatome comparisons in mammalian cells following different stimuli or undergoing cell programs. Results: Triggering of the EGF pathway results in an early induction of transcriptome and translatome changes, but 90% of the significant variation is limited to the translatome and the degree of concordant changes is less than 5%. The survey of other 19 different transcriptome/translatome comparisons shows that extensive uncoupling is a general rule, in terms of both RNA movements and inferred cell activities, with a strong tendency of translation-related genes to be controlled purely at the translational level. By different statistical approaches, we finally provide evidence of the lack of dependence between changes at the transcriptome and translatome levels. Conclusions: We propose a model of diffused independency between variation in transcript abundances and variation in their engagement on polysomes, which implies the existence of specific mechanisms to couple these two ways of regulating gene expression.

1 October 2010 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
RBRoberto Battiti
Roberto Battiti
APAndrea Passerini
Andrea Passerini
The centrality of the decision maker (DM) is widely recognized in the multiple criteria decision-making community. This translates into emphasis on seamless human-computer interaction, and adaptation of the solution technique to the knowledge which is progressively acquired from the DM. This paper adopts the methodology of reactive search optimization (RSO) for evolutionary interactive multiobjective optimization. RSO follows to the paradigm of “learning while optimizing,” through the use of online machine learning techniques as an integral part of a self-tuning optimization scheme. User judgments of couples of solutions are used to build robust incremental models of the user utility function, with the objective to reduce the cognitive burden required from the DM to identify a satisficing solution. The technique of support vector ranking is used together with a k-fold cross-validation procedure to select the best kernel for the problem at hand, during the utility function training procedure. Experimental results are presented for a series of benchmark problems.

5 February 2007 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
APAndrea Passerini
Andrea Passerini
Claudia AndreiniClaudia Andreini
Claudia Andreini
SMSauro Menchetti
Sauro Menchetti
Antonio RosatoAntonio Rosato
Antonio Rosato
PFPaolo Frasconi
Paolo Frasconi
Metalloproteins are proteins capable of binding one or more metal ions, which may be required for their biological function, for regulation of their activities or for structural purposes. Metal-binding properties remain difficult to predict as well as to investigate experimentally at the whole-proteome level. Consequently, the current knowledge about metalloproteins is only partial. The present work reports on the development of a machine learning method for the prediction of the zinc-binding state of pairs of nearby amino-acids, using predictors based on support vector machines. The predictor was trained using chains containing zinc-binding sites and non-metalloproteins in order to provide positive and negative examples. Results based on strong non-redundancy tests prove that (1) zinc-binding residues can be predicted and (2) modelling the correlation between the binding state of nearby residues significantly improves performance. The trained predictor was then applied to the human proteome. The present results were in good agreement with the outcomes of previous, highly manually curated, efforts for the identification of human zinc-binding proteins. Some unprecedented zinc-binding sites could be identified, and were further validated through structural modelling. The software implementing the predictor is freely available at: http://zincfinder.dsi.unifi.it The proposed approach constitutes a highly automated tool for the identification of metalloproteins, which provides results of comparable quality with respect to highly manually refined predictions. The ability to model correlations between pairwise residues allows it to obtain a significant improvement over standard 1D based approaches. In addition, the method permits the identification of unprecedented metal sites, providing important hints for the work of experimentalists.

6 June 2005
Verified
Conference Paper
Open access
PDF file
CBC. Biagioli
C. Biagioli
EFE. Francesconi
E. Francesconi
APAndrea Passerini
Andrea Passerini
SMS. Montemagni
S. Montemagni
CSClaudia Soria
Claudia Soria

9 January 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
ALAntonio Longa
Antonio Longa
SASteve Azzolin
Steve Azzolin
GSGabriele Santin
Gabriele Santin
GCGiulia Cencetti
Giulia Cencetti
PLPietro Lio
Pietro Lio
APAndrea Passerini
Andrea Passerini
Following a fast initial breakthrough in graph-based learning, Graph Neural Networks (GNNs) have reached a widespread application in many science and engineering fields, prompting the need for methods to understand their decision process. GNN explainers have started to emerge in recent years, with a multitude of methods both novel or adapted from other domains. To sort out this plethora of alternative approaches, several studies have benchmarked the performance of different explainers in terms of various explainability metrics. However, these earlier works make no attempts at providing insights into why different GNN architectures are more or less explainable or which explainer should be preferred in a given setting. In this survey we fill these gaps by devising a systematic experimental study, which tests 12 explainers on eight representative message-passing architectures trained on six carefully designed graph and node classification datasets. With our results we provide key insights on the choice and applicability of GNN explainers, we isolate key components that make them usable and successful and provide recommendations on how to avoid common interpretation pitfalls. We conclude by highlighting open questions and directions of possible future research.