Giuditta Franco

dblp:34/4983 · DBLP profile ↗
← Back
16ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0003-1447-5253ORCID · verified

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

Artificial intelligence and machine learning · 11 · 2 first-author · 2 since 2021Theory of computation · 4 · 3 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 The threshold q-gram distance: a simple, efficient, and effective distance measure for genomic sequence comparison
abstract
Abstract The q –gram distance between two strings $$s,s^\prime$$ , introduced by Ukkonen in 1992, is an alignment-free string similarity measure which can be computed in linear time, as opposed to the quadratic time necessary for alignment/edit distance. It is based on the $$L_1$$ -distance, or Manhattan-distance, between the multiplicity vectors of fixed-length substrings (so-called q-grams or k-mers ), and has been successfully applied in diverse bioinformatics settings. In this paper, we introduce the threshold q-gram distance (T q D), a new distance measure which is similar to the q -gram distance but uses reduced information on the multiplicities of the q -grams. The new measure retains the linear time computation of the q -gram distance but requires significantly less space. Storage space and accuracy of the measure can be controlled via a user-defined threshold t , which sets a limit on the maximum value of the integers in the multiplicity vectors. In particular, for $$t=1$$ , the comparison is made only on the basis of the sets of uniquely occurring q -grams on the one hand, and of repeated q -grams, on the other. We tested the new distance measure, using the benchmarking tool AFproject of Zielezinski et al. [Genome Biology, 2019], on several real-life data sets for phylogenetic reconstruction and compared the results with those of other k -mer based distance measures. Our experiments show that the new measure T q D compares well to other non-alignment based measures regarding accuracy, while requiring substantially less memory than the classic q -gram distance.
Davide Cenzato, Giuditta Franco, Zsuzsanna Lipták, Alessio Milanese
Nat. Comput.2
2023 PanDelos-frags: A methodology for discovering pangenomic content of incomplete microbial assemblies
abstract
Pangenomics was originally defined as the problem of comparing the composition of genes into gene families within a set of bacterial isolates belonging to the same species. The problem requires the calculation of sequence homology among such genes. When combined with metagenomics, namely for human microbiome composition analysis, gene-oriented pangenome detection becomes a promising method to decipher ecosystem functions and population-level evolution. Established computational tools are able to investigate the genetic content of isolates for which a complete genomic sequence is available. However, there is a plethora of incomplete genomes that are available on public resources, which only a few tools may analyze. Incomplete means that the process for reconstructing their genomic sequence is not complete, and only fragments of their sequence are currently available. However, the information contained in these fragments may play an essential role in the analyses. Here, we present PanDelos-frags, a computational tool which exploits and extends previous results in analyzing complete genomes. It provides a new methodology for inferring missing genetic information and thus for managing incomplete genomes. PanDelos-frags outperforms state-of-the-art approaches in reconstructing gene families in synthetic benchmarks and in a real use case of metagenomics. PanDelos-frags is publicly available at https://github.com/InfOmics/PanDelos-frags.
Vincenzo Bonnici, Claudia Mengoni, Manuel Mangoni, Giuditta Franco, Rosalba Giugno
J. Biomed. Informatics4
2021 Conjugate word blending: formal model and experimental implementation by XPCR
Francesco Bellamoli, Giuditta Franco, Lila Kari, Silvia Lampis, Timothy Ng 0001
Nat. Comput.2
2021 Spectral concepts in genome informational analysis
Vincenzo Bonnici, Giuditta Franco, Vincenzo Manca
Theor. Comput. Sci.2
2021 Emergence of random selections in evolution of biological populations
Giuditta Franco, Vincenzo Manca, Marco Andreolli, Silvia Lampis
Theor. Comput. Sci.1
2017 Age-related relationships among peripheral B lymphocyte subpopulations
abstract
An immunological data-driven model is proposed, for age related changes in the network of relationships among cell quantities of eight peripheral B lymphocyte subpopulations, that is, cells exhibiting all combinations of three specific receptor clusters (CD27, CD23, CD5). The model is based on immunological data (quantities of cells exhibiting CD19, characterizing B lymphocytes) from about six thousands patients, having an age ranging between one day and ninety-five years, by means of a suitably combination of data analysis methods, such as piecewise linear regression models. With relaxed values for statistically significant models (coefficient p-values bounded by 0.05), we found a network holding for all ages, that likely represents the general assessment of adaptive immune system for healthy human beings. When statistical validation comes to be more restrictive, we found that some of these interactions are lost with aging, as widely observed in medical literature. Namely, interesting (inverse or directed) proportions are highlighted among mutual quantities of a partition of peripheral B lymphocytes.
Alberto Castellini, Giuditta Franco, Antonio Vella
CEC2
2015 A genome analysis based on repeat sharing gene networks
Alberto Castellini, Giuditta Franco, Alessio Milanese
Nat. Comput.2
2015 Algorithms and models for complex natural systems
Carlos A. Coello Coello, Giuditta Franco, Natalio Krasnogor, Mario Pavone
Nat. Comput.2
2013 An Investigation on Genomic Repeats
Giuditta Franco, Alessio Milanese
CiE1
2011 Foreword
Roberto Barbuti, Giuditta Franco, Gheorghe Paun
Nat. Comput.2
2011 On aggregation in multiset-based self-assembly of graphs
Francesco Bernardini, Robert Brijder, Matteo Cavaliere, Giuditta Franco, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
Nat. Comput.4
2011 Data analysis pipeline from laboratory to MP models
Alberto Castellini, Giuditta Franco, Roberto Pagliarini
Nat. Comput.2
2011 Algorithmic applications of XPCR
Giuditta Franco, Vincenzo Manca
Nat. Comput.1
2010 Hybrid Functional Petri Nets as MP systems
Alberto Castellini, Giuditta Franco, Vincenzo Manca
Nat. Comput.2
2008 A DNA computing inspired computational model
Giuditta Franco, Maurice Margenstern
Theor. Comput. Sci.1
2005 An algorithmic analysis of DNA structure
Giuditta Franco, Vincenzo Manca
Soft Comput.1