Giuditta Franco
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Giuditta Franco has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Vincenzo Manca
University of Verona, Italy, Italy
5 shared publications - Alberto Castellini
University of Verona
4 shared publications - Francesco Bellamoli
SOLE-LAB, Department of Biotechnology, University of Verona, Verona, Italy
2 shared publications - Roberto Pagliarini
University of Verona, Italy
2 shared publications - Silvia Lampis
Department of Biotechnology, University of Verona, Verona, Italy
2 shared publications - Alessandro Farinelli
University of Verona
1 shared publication
Latest Publications
- Open Access
- 27 November 2025
- Published by Springer Nature in Natural Computing
- Vol. 24 (4) , 973-989
The threshold q-gram distance: a simple, efficient, and effective distance measure for genomic sequence comparison
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.- 27 November 2025
- Published by Springer Nature in Natural Computing
- Vol. 24 (4) , 973-989
Open AccessThe threshold q-gram distance: a simple, efficient, and effective distance measure for genomic sequence comparison
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. - 1 June 2023
- Published by Springer Nature
- p. 1-16
An Investigation to Test Spectral Segments as Bacterial Biomarkers
- 1 June 2023
- Published by Springer Nature
- p. 1-16
An Investigation to Test Spectral Segments as Bacterial Biomarkers
- 31 August 2021
- Published by Springer Nature in Natural Computing
- Vol. 20 (4) , 647-658
Conjugate word blending: formal model and experimental implementation by XPCR
- 31 August 2021
- Published by Springer Nature in Natural Computing
- Vol. 20 (4) , 647-658
Conjugate word blending: formal model and experimental implementation by XPCR
- Open Access
Experimental Analysis of XPCR-based protocols
This paper reports some experimental results validating in a broader context a variant of PCR, called XPCR, previously introduced and tested on relatively short synthetic DNA sequences. Basic XPCR technique confirmed to work as expected, to concatenate two genes of different lengths, while a library of all permutations of three different genes (extracted from the bacterial strain Bulkolderia fungorum DBT1) has been realized in one step by multiple XPCR. Limits and potentialities of the protocols have been discussed, and tested in several experimental conditions, by aside showing that overlap concatenation of multiple copies of one only gene is not realizable by these procedures, due to strand displacement phenomena. In this case, in fact, one copy of the gene is obtained as a unique amplification product.
Open AccessExperimental Analysis of XPCR-based protocols
This paper reports some experimental results validating in a broader context a variant of PCR, called XPCR, previously introduced and tested on relatively short synthetic DNA sequences. Basic XPCR technique confirmed to work as expected, to concatenate two genes of different lengths, while a library of all permutations of three different genes (extracted from the bacterial strain Bulkolderia fungorum DBT1) has been realized in one step by multiple XPCR. Limits and potentialities of the protocols have been discussed, and tested in several experimental conditions, by aside showing that overlap concatenation of multiple copies of one only gene is not realizable by these procedures, due to strand displacement phenomena. In this case, in fact, one copy of the gene is obtained as a unique amplification product.
- 17 February 2017
- Published by Springer Nature
- p. 177-189
Minimal Multiset Grammars for Recurrent Dynamics
- 17 February 2017
- Published by Springer Nature
- p. 177-189
Minimal Multiset Grammars for Recurrent Dynamics
- Open Access
- 7 May 2015
- Published by Springer Nature in Natural Computing
- Vol. 14 (3) , 339-340
Algorithms and models for complex natural systems
- 7 May 2015
- Published by Springer Nature in Natural Computing
- Vol. 14 (3) , 339-340
Open AccessAlgorithms and models for complex natural systems
- 23 July 2014
- Published by Springer Nature in Natural Computing
- Vol. 14 (3) , 403-420
A genome analysis based on repeat sharing gene networks
- 23 July 2014
- Published by Springer Nature in Natural Computing
- Vol. 14 (3) , 403-420
A genome analysis based on repeat sharing gene networks
- Open Access
- 17 September 2012
- Published by Springer Nature in BMC Genomics
- Vol. 13 (1) , 485
A dictionary based informational genome analysis
Background: In the post-genomic era several methods of computational genomics are emerging to understand how the whole information is structured within genomes. Literature of last five years accounts for several alignment-free methods, arisen as alternative metrics for dissimilarity of biological sequences. Among the others, recent approaches are based on empirical frequencies of DNA k-mers in whole genomes. Results: Any set of words (factors) occurring in a genome provides a genomic dictionary. About sixty genomes were analyzed by means of informational indexes based on genomic dictionaries, where a systemic view replaces a local sequence analysis. A software prototype applying a methodology here outlined carried out some computations on genomic data. We computed informational indexes, built the genomic dictionaries with different sizes, along with frequency distributions. The software performed three main tasks: computation of informational indexes, storage of these in a database, index analysis and visualization. The validation was done by investigating genomes of various organisms. A systematic analysis of genomic repeats of several lengths, which is of vivid interest in biology (for example to compute excessively represented functional sequences, such as promoters), was discussed, and suggested a method to define synthetic genetic networks. Conclusions: We introduced a methodology based on dictionaries, and an efficient motif-finding software application for comparative genomics. This approach could be extended along many investigation lines, namely exported in other contexts of computational genomics, as a basis for discrimination of genomic pathologies.
- 17 September 2012
- Published by Springer Nature in BMC Genomics
- Vol. 13 (1) , 485
Open AccessA dictionary based informational genome analysis
Background: In the post-genomic era several methods of computational genomics are emerging to understand how the whole information is structured within genomes. Literature of last five years accounts for several alignment-free methods, arisen as alternative metrics for dissimilarity of biological sequences. Among the others, recent approaches are based on empirical frequencies of DNA k-mers in whole genomes. Results: Any set of words (factors) occurring in a genome provides a genomic dictionary. About sixty genomes were analyzed by means of informational indexes based on genomic dictionaries, where a systemic view replaces a local sequence analysis. A software prototype applying a methodology here outlined carried out some computations on genomic data. We computed informational indexes, built the genomic dictionaries with different sizes, along with frequency distributions. The software performed three main tasks: computation of informational indexes, storage of these in a database, index analysis and visualization. The validation was done by investigating genomes of various organisms. A systematic analysis of genomic repeats of several lengths, which is of vivid interest in biology (for example to compute excessively represented functional sequences, such as promoters), was discussed, and suggested a method to define synthetic genetic networks. Conclusions: We introduced a methodology based on dictionaries, and an efficient motif-finding software application for comparative genomics. This approach could be extended along many investigation lines, namely exported in other contexts of computational genomics, as a basis for discrimination of genomic pathologies.
- 18 January 2011
- Published by IGI Global Scientific Publishing
State Transition Dynamics
State Transition Dynamics: Basic Concepts and Molecular Computing Perspectives: 10.4018/978-1-59140-333-3.ch002: Classical dynamics concepts are analysed in the basic mathematical setting of state transition systems where time and space are both completely discrete and
- 18 January 2011
- Published by IGI Global Scientific Publishing
State Transition Dynamics
State Transition Dynamics: Basic Concepts and Molecular Computing Perspectives: 10.4018/978-1-59140-333-3.ch002: Classical dynamics concepts are analysed in the basic mathematical setting of state transition systems where time and space are both completely discrete and