Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Simona Panni

dblp:41/1988 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-7500-4028ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
biocuration
1.012026
GOFlowLLM - curating miRNA literature with large language models and flowcharts · Bioinform. 2026
Bioinformatics and computational biology › protein function prediction
gene ontology annotation
1.012026
GOFlowLLM - curating miRNA literature with large language models and flowcharts · Bioinform. 2026
Bioinformatics and computational biology
molecular interaction data
0.512021
The Minimum Information about a Molecular Interaction CAusal STatement (MI2CAST) · Bioinform. 2021

Methods — techniques the papers use, named apart from their topics

reasoning traces · 1.0large language model · 1.0checklist development · 0.5
YearPublicationVenuePosition
2026 GOFlowLLM - curating miRNA literature with large language models and flowcharts
abstract
MOTIVATION: The exponential growth of non-coding RNA research-with over 230 000 papers published since 2000-has created an urgent knowledge management crisis in molecular biology. Despite their crucial regulatory roles, microRNAs (miRNAs) face a significant curation bottleneck, with only 1400 articles manually curated to the Gene Ontology (GO) knowledgebase over a decade. This highlights the critical need for automated systems that can accelerate biocuration while maintaining high-quality standards. RESULTS: We present GOFlowLLM, an automated curation pipeline powered by reasoning-enabled Large Language Models (LLMs) that follows established GO curation flowcharts to extract and structure miRNA-mediated gene silencing data at scale. When evaluated on existing curation, GOFlowLLM selects the correct GO term in 90% of cases, with curators agreeing with 95% of the system's reasoning steps and 90% of the evidence selected. Applied to 6996 previously uncurated articles using the Qwen QwQ-32B model, our system identified 2538 new candidate GO annotations on 1785 articles in just 58 hours-potentially doubling the available miRNA GO curation. Manual review shows curators agreed with the selected term in 87% of cases, the model's reasoning in 92% of cases, and the extracted evidence in 93%. The integration of reasoning traces provides transparent justification for annotations that can be reviewed by human curators, addressing a key challenge in adopting AI for scientific curation. AVAILABILITY AND IMPLEMENTATION: GOFlowLLM is implemented as an automated pipeline that follows expert-designed reasoning frameworks to maintain curation quality. The system is available on GitHub: https://github.com/RNAcentral/GO_Flow_LLM.
Andrew Green 0001, Nancy Ontiveros-Palacios, Isaac Jandalala, Simona Panni, Valerie Wood, Giulia Antonazzo, Helen Attrill, Alex Bateman, Blake A. Sweeney
Bioinform.4
2021 The Minimum Information about a Molecular Interaction CAusal STatement (MI2CAST)
abstract
MOTIVATION: A large variety of molecular interactions occurs between biomolecular components in cells. When a molecular interaction results in a regulatory effect, exerted by one component onto a downstream component, a so-called 'causal interaction' takes place. Causal interactions constitute the building blocks in our understanding of larger regulatory networks in cells. These causal interactions and the biological processes they enable (e.g. gene regulation) need to be described with a careful appreciation of the underlying molecular reactions. A proper description of this information enables archiving, sharing and reuse by humans and for automated computational processing. Various representations of causal relationships between biological components are currently used in a variety of resources. RESULTS: Here, we propose a checklist that accommodates current representations, called the Minimum Information about a Molecular Interaction CAusal STatement (MI2CAST). This checklist defines both the required core information, as well as a comprehensive set of other contextual details valuable to the end user and relevant for reusing and reproducing causal molecular interaction information. The MI2CAST checklist can be used as reporting guidelines when annotating and curating causal statements, while fostering uniformity and interoperability of the data across resources. AVAILABILITY AND IMPLEMENTATION: The checklist together with examples is accessible at https://github.com/MI2CAST/MI2CAST. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Vasundra Touré, Steven Vercruysse, Marcio Luis Acencio, Ruth C. Lovering, Sandra E. Orchard, Glyn Bradley, Cristina Casals-Casas, Claudine Chaouiya, Noemi del-Toro, Åsmund Flobak, Pascale Gaudet, Henning Hermjakob, Charles Tapley Hoyt, Luana Licata, Astrid Lægreid, Chris Mungall, Anne Niknejad, Simona Panni, Livia Perfetto, Pablo Porras, Dexter Pratt, Julio Saez-Rodriguez, Denis Thieffry, Paul D. Thomas, Dénes Türei, Martin Kuiper
Bioinform.18
2018 Encompassing new use cases - level 3.0 of the HUPO-PSI format for molecular interactions
abstract
BACKGROUND: Systems biologists study interaction data to understand the behaviour of whole cell systems, and their environment, at a molecular level. In order to effectively achieve this goal, it is critical that researchers have high quality interaction datasets available to them, in a standard data format, and also a suite of tools with which to analyse such data and form experimentally testable hypotheses from them. The PSI-MI XML standard interchange format was initially published in 2004, and expanded in 2007 to enable the download and interchange of molecular interaction data. PSI-XML2.5 was designed to describe experimental data and to date has fulfilled this basic requirement. However, new use cases have arisen that the format cannot properly accommodate. These include data abstracted from more than one publication such as allosteric/cooperative interactions and protein complexes, dynamic interactions and the need to link kinetic and affinity data to specific mutational changes. RESULTS: The Molecular Interaction workgroup of the HUPO-PSI has extended the existing, well-used XML interchange format for molecular interaction data to meet new use cases and enable the capture of new data types, following extensive community consultation. PSI-MI XML3.0 expands the capabilities of the format beyond simple experimental data, with a concomitant update of the tool suite which serves this format. The format has been implemented by key data producers such as the International Molecular Exchange (IMEx) Consortium of protein interaction databases and the Complex Portal. CONCLUSIONS: PSI-MI XML3.0 has been developed by the data producers, data users, tool developers and database providers who constitute the PSI-MI workgroup. This group now actively supports PSI-MI XML2.5 as the main interchange format for experimental data, PSI-MI XML3.0 which additionally handles more complex data types, and the simpler, tab-delimited MITAB2.5, 2.6 and 2.7 for rapid parsing and download.
M. Sivade Dumousseau, Diego Alonso-López, Mais G. Ammari, Glyn Bradley, Nancy H. Campbell, Arnaud Céol, Gianni Cesareni, Colin W. Combe, Javier De Las Rivas, Noemi del-Toro, Joshua Heimbach, Henning Hermjakob, Igor Jurisica, Luana Licata, Ruth C. Lovering, David J. Lynn, Birgit Meldal, Gos Micklem, Simona Panni, Pablo Porras, Sylvie Ricard-Blum, Bernd Roechert, Lukasz Salwínski, Anjali Shrivastava, Julie M. Sullivan, Nicolas Thierry-Mieg, Yo Yehudi, Kim Van Roey, Sandra E. Orchard
BMC Bioinform.20
2015 Searching for repetitions in biological networks: methods, resources and tools
abstract
We present here a compact overview of the data, models and methods proposed for the analysis of biological networks based on the search for significant repetitions. In particular, we concentrate on three problems widely studied in the literature: 'network alignment', 'network querying' and 'network motif extraction'. We provide (i) details of the experimental techniques used to obtain the main types of interaction data, (ii) descriptions of the models and approaches introduced to solve such problems and (iii) pointers to both the available databases and software tools. The intent is to lay out a useful roadmap for identifying suitable strategies to analyse cellular data, possibly based on the joint use of different interaction data types or analysis techniques.
Simona Panni, Simona E. Rombo
Briefings Bioinform.1
2011 Asymmetric Comparison and Querying of Biological Networks
abstract
Comparing and querying the protein-protein interaction (PPI) networks of different organisms is important to infer knowledge about conservation across species. Known methods that perform these tasks operate symmetrically, i.e., they do not assign a distinct role to the input PPI networks. However, in most cases, the input networks are indeed distinguishable on the basis of how the corresponding organism is biologically well characterized. In this paper a new idea is developed, that is, to exploit differences in the characterization of organisms at hand in order to devise methods for comparing their PPI networks. We use the PPI network (called Master) of the best characterized organism as a fingerprint to guide the alignment process to the second input network (called Slave), so that generated results preferably retain the structural characteristics of the Master network. Technically, this is obtained by generating from the Master a finite automaton, called alignment model, which is then fed with (a linearization of) the Slave for the purpose of extracting, via the Viterbi algorithm, matching subgraphs. We propose an approach able to perform global alignment and network querying, and we apply it on PPI networks. We tested our method showing that the results it returns are biologically relevant.
Nicola Ferraro, Luigi Palopoli 0001, Simona Panni, Simona E. Rombo
IEEE ACM Trans. Comput. Biol. Bioinform.3
2010 "Master-Slave" Biological Network Alignment
Nicola Ferraro, Luigi Palopoli 0001, Simona Panni, Simona E. Rombo
ISBRA3
2007 GRAPPIN: Bipartite GRAph Based Protein-Protein Interaction Network Similarity Search
abstract
We propose an algorithm, called BI-GRAPPIN, to search for similarities across PPI networks. The technique core consists in computing a maximum weight matching of bipartite graphs to compare the neighborhoods of pairs of proteins in different PPI networks. The idea is that proteins belonging to different networks should be matched look- ing not only at their own sequence similarity, but also at the similarity of proteins they "strongly" interact with, ei- ther directly or indirectly. We implemented the method and tested it on both real and synthetic data, showing its effec- tiveness in solving ambiguous situations and in individuat- ing functionally related proteins. Differently from previous work, the presented algorithm allows to take into account both quantitative and reliability information possibly avail- able about interactions.
Valeria Fionda, Luigi Palopoli 0001, Simona Panni, Simona E. Rombo
BIBM3