6 papers
PanDelos-plus: A parallel algorithm for computing sequence homology in pangenomic analysis
Simone Colli, Emiliano Maresi, Vincenzo Bonnici
The identification of homologous gene families across multiple genomes is a central task in bacterial pangenomics traditionally requiring computationally demanding all-against-all…
MultiGraphMatch: a subgraph matching algorithm for multigraphs
Giovanni Micale, Antonio Di Maria, Roberto Grasso +5
Subgraph matching is the problem of finding all the occurrences of a small graph, called the query, in a larger graph, called the target. Although the problem has been widely studi…
Spectral concepts in genome informational analysis
Vincenzo Bonnici, Giuditta Franco, Vincenzo Manca
The concept of k-spectrum for genomes is here investigated as a basic tool to analyze genomes. Related spectral notions based on k-mers are introduced with some related mathematica…
A word recurrence based algorithm to extract genomic dictionaries
Vincenzo Bonnici, Giuditta Franco, Vincenzo Manca
Genomes may be analyzed from an information viewpoint as very long strings, containing functional elements of variable length, which have been assembled by evolution. In this work…
Kullback-Leibler divergence between quantum distributions, and its upper-bound
Vincenzo Bonnici
This work presents an upper-bound to value that the Kullback-Leibler (KL) divergence can reach for a class of probability distributions called quantum distributions (QD). The aim i…
MultiRI: Fast Subgraph Matching in Labeled Multigraphs
Giovanni Micale, Vincenzo Bonnici, Alfredo Ferro +3
The Subgraph Matching (SM) problem consists of finding all the embeddings of a given small graph, called the query, into a large graph, called the target. The SM problem has been w…