Michela Quadrini

Dr. Michela Quadrini


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
18 April 2019 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MQMichela Quadrini
Michela Quadrini
LTLuca Tesei
Luca Tesei
EMEmanuela Merelli
Emanuela Merelli
RNA secondary structure comparison is a fundamental task for several studies, among which are RNA structure prediction and evolution. The comparison can currently be done efficiently only for pseudoknot-free structures due to their inherent tree representation. In this work, we introduce an algebraic language to represent RNA secondary structures with arbitrary pseudoknots. Each structure is associated with a unique algebraic RNA tree that is derived from a tree grammar having concatenation, nesting and crossing as operators. From an algebraic RNA tree, an abstraction is defined in which the primary structure is neglected. The resulting structural RNA tree allows us to define a new measure of similarity calculated exploiting classical tree alignment. The tree grammar with its operators permit to uniquely represent any RNA secondary structure as a tree. Structural RNA trees allow us to perform comparison of RNA secondary structures with arbitrary pseudoknots without taking into account the primary structure.

15 March 2024 in Machine Learning
Verified
Journal Article
Closed access
PDF file
MQMichela Quadrini
Michela Quadrini
ACAntonino Capuccio
Antonino Capuccio
DFDenise Falcone
Denise Falcone
SDSebastian Daberdaku
Sebastian Daberdaku
ABAlessandro Blanda
Alessandro Blanda
GGGianluca Gerard
Gianluca Gerard

20 March 2022 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MQMichela Quadrini
Michela Quadrini
SDSebastian Daberdaku
Sebastian Daberdaku
CFCarlo Ferrari
Carlo Ferrari
Background: Protein–protein interactions have pivotal roles in life processes, and aberrant interactions are associated with various disorders. Interaction site identification is key for understanding disease mechanisms and design new drugs. Effective and efficient computational methods for the PPI prediction are of great value due to the overall cost of experimental methods. Promising results have been obtained using machine learning methods and deep learning techniques, but their effectiveness depends on protein representation and feature selection.Results: We define a new abstraction of the protein structure, calledhierarchical representations, considering and quantifyingspatial and sequential neighboringamong amino acids. We also investigate the effect of molecular abstractions using the Graph Convolutional Networks technique to classify amino acids as interface and no-interface ones. Our study takes into account three abstractions,hierarchical representations, contact map, and the residue sequence, and considers the eight functional classes of proteins extracted from the Protein–Protein Docking Benchmark 5.0. The performance of our method, evaluated using standard metrics, is compared to the ones obtained with some state-of-the-art protein interface predictors. The analysis of the performance values shows that our method outperforms the considered competitors when the considered molecules are structurally similar.Conclusions: Thehierarchical representationcan capture the structural properties that promote the interactions and can be used to represent proteins with unknown structures by codifying only their sequential neighboring. Analyzing the results, we conclude that classes should be arranged according to their architectures rather than functions.

26 July 2023 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
MLMichele Loreti
Michele Loreti
MQMichela Quadrini
Michela Quadrini
Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the distribution of these entities determines a space that can be either physical or logical. The former is defined in terms of a physical relation among components. The latter depends on logical relations, such as being part of the same group. In this context, specification and verification of spatial properties play a fundamental role in supporting the design of systems and predicting their behaviour. For this reason, different tools and techniques have been proposed to specify and verify the properties of space, mainly described as graphs. Therefore, the approaches generally use model spatial relations to describe a form of proximity among pairs of entities. Unfortunately, these graph-based models do not permit considering relations among more than two entities that may arise when one is interested in describing aspects of space by involving interactions among groups of entities. In this work, we propose a spatial logic interpreted on simplicial complexes. These are topological objects, able to represent surfaces and volumes efficiently that generalise graphs with higher-order edges. We discuss how the satisfaction of logical formulas can be verified by a correct and complete model checking algorithm, which is linear to the dimension of the simplicial complex and logical formula. The expressiveness of the proposed logic is studied in terms of the spatial variants of classical bisimulation and branching bisimulation relations defined over simplicial complexes.

6 November 2022
Verified
Book Chapter
Closed access
PDF file
MQMichela Quadrini
Michela Quadrini
SDSebastian Daberdaku
Sebastian Daberdaku
ABAlessandro Blanda
Alessandro Blanda
ACAntonino Capuccio
Antonino Capuccio
LBLuca Bellanova
Luca Bellanova
GGGianluca Gerard
Gianluca Gerard

19 November 2017
Verified
Book Chapter
Closed access
PDF file
MQMichela Quadrini
Michela Quadrini
CRCulmone Rosario
Culmone Rosario
EMEmanuela Merelli
Emanuela Merelli