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

Giulio Pavesi

dblp:39/742 · DBLP profile ↗
← Back
23ranked-venue papers
5as first author
1since 2021 · last 2021
0000-0001-5705-6249ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 9 · 4 first-author · 1 since 2021Artificial intelligence and machine learning · 5 · 1 first-authorTheory of computation · 4Systems, architecture and hardware · 3Graphics, computer vision, multimedia, augmented reality and games · 2

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%
Theoretical computer science
1 paper
Approximation and online algorithms · 50% Algorithms and data structures · 50%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › transcriptomics
alternative splicing analysis
0.112008
ASPicDB: A database resource for alternative splicing analysis · Bioinform. 2008
Bioinformatics and computational biology › transcriptomics › transcript isoform analysis
isoform annotation
0.112008
ASPicDB: A database resource for alternative splicing analysis · Bioinform. 2008
Bioinformatics and computational biology › genome annotation
splice site prediction
0.112008
ASPicDB: A database resource for alternative splicing analysis · Bioinform. 2008
Bioinformatics and computational biology › transcriptomics
transcriptome annotation
0.112008
ASPicDB: A database resource for alternative splicing analysis · Bioinform. 2008
Approximation and online algorithms
approximation algorithms
0.011999
Approximation Algorithms for Protein Folding Prediction · SODA 1999
Algorithms and data structures › computational biology
protein folding
0.011999
Approximation Algorithms for Protein Folding Prediction · SODA 1999

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

transcript modeling · 0.1multiple sequence alignment · 0.1
YearPublicationVenuePosition
2021 Next generation sequencing of SARS-CoV-2 genomes: challenges, applications and opportunities
abstract
Various next generation sequencing (NGS) based strategies have been successfully used in the recent past for tracing origins and understanding the evolution of infectious agents, investigating the spread and transmission chains of outbreaks, as well as facilitating the development of effective and rapid molecular diagnostic tests and contributing to the hunt for treatments and vaccines. The ongoing COVID-19 pandemic poses one of the greatest global threats in modern history and has already caused severe social and economic costs. The development of efficient and rapid sequencing methods to reconstruct the genomic sequence of SARS-CoV-2, the etiological agent of COVID-19, has been fundamental for the design of diagnostic molecular tests and to devise effective measures and strategies to mitigate the diffusion of the pandemic. Diverse approaches and sequencing methods can, as testified by the number of available sequences, be applied to SARS-CoV-2 genomes. However, each technology and sequencing approach has its own advantages and limitations. In the current review, we will provide a brief, but hopefully comprehensive, account of currently available platforms and methodological approaches for the sequencing of SARS-CoV-2 genomes. We also present an outline of current repositories and databases that provide access to SARS-CoV-2 genomic data and associated metadata. Finally, we offer general advice and guidelines for the appropriate sharing and deposition of SARS-CoV-2 data and metadata, and suggest that more efficient and standardized integration of current and future SARS-CoV-2-related data would greatly facilitate the struggle against this new pathogen. We hope that our 'vademecum' for the production and handling of SARS-CoV-2-related sequencing data, will contribute to this objective.
Matteo Chiara, Anna Maria D'Erchia, Carmela Gissi, Caterina Manzari, Antonio Parisi, Nicoletta Resta, Federico Zambelli, Ernesto Picardi, Giulio Pavesi, David Stephen Horner, Graziano Pesole
Briefings Bioinform.9
2020 On the NF-Y regulome as in ENCODE (2019)
abstract
NF-Y is a trimeric Transcription Factor -TF- which binds with high selectivity to the conserved CCAAT element. Individual ChIP-seq analysis as well as ENCODE have progressively identified locations shared by other TFs. Here, we have analyzed data introduced by ENCODE over the last five years in K562, HeLa-S3 and GM12878, including several chromatin features, as well RNA-seq profiling of HeLa cells after NF-Y inactivation. We double the number of sequence-specific TFs and co-factors reported. We catalogue them in 4 classes based on co-association criteria, infer target genes categorizations, identify positional bias of binding sites and gene expression changes. Larger and novel co-associations emerge, specifically concerning subunits of repressive complexes as well as RNA-binding proteins. On the one hand, these data better define NF-Y association with single members of major classes of TFs, on the other, they suggest that it might have a wider role in the control of mRNA production.
Mirko Ronzio, Giulio Pavesi, Roberto Mantovani, Diletta Dolfini
PLoS Comput. Biol.3
2013 A neural network based algorithm for gene expression prediction from chromatin structure
abstract
Gene expression is a very complex process, which is finely regulated and modulated at different levels. The first step of gene expression, the transcription of DNA into mRNA, is in turn regulated both at the genetic and epigenetic level. In particular, the latter, which involves the structure formed by DNA wrapped around histones (chromatin), has been recently shown to be a key factor, with post-translational modifications of histones acting combinatorially to activate or block transcription. In this work we addressed the problem of predicting the level of expression of genes starting from genome-wide maps of chromatin structure, that is, of the localization of several different histone modifications, which have been recently made available through the introduction of technologies like ChIP-Seq. We formalized the problem as a multi-class bipartite ranking problem, in which for each class a gene can be under-or over-expressed with respect to a given reference expression value. In order to deal with this problem, we exploit and extend a semi-supervised method (COSNet) based on a family of Hopfield neural networks. Benchmark genome-wide tests performed on six different human cell lines yielded satisfactory results, with clear improvements over the alternative approach most commonly adopted in the literature.
Marco Frasca 0001, Giulio Pavesi
IJCNN2
2013 Motif discovery and transcription factor binding sites before and after the next-generation sequencing era
abstract
Motif discovery has been one of the most widely studied problems in bioinformatics ever since genomic and protein sequences have been available. In particular, its application to the de novo prediction of putative over-represented transcription factor binding sites in nucleotide sequences has been, and still is, one of the most challenging flavors of the problem. Recently, novel experimental techniques like chromatin immunoprecipitation (ChIP) have been introduced, permitting the genome-wide identification of protein-DNA interactions. ChIP, applied to transcription factors and coupled with genome tiling arrays (ChIP on Chip) or next-generation sequencing technologies (ChIP-Seq) has opened new avenues in research, as well as posed new challenges to bioinformaticians developing algorithms and methods for motif discovery.
Federico Zambelli, Graziano Pesole, Giulio Pavesi
Briefings Bioinform.3
2010 Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing
abstract
Technical advances such as the development of molecular cloning, Sanger sequencing, PCR and oligonucleotide microarrays are key to our current capacity to sequence, annotate and study complete organismal genomes. Recent years have seen the development of a variety of so-called 'next-generation' sequencing platforms, with several others anticipated to become available shortly. The previously unimaginable scale and economy of these methods, coupled with their enthusiastic uptake by the scientific community and the potential for further improvements in accuracy and read length, suggest that these technologies are destined to make a huge and ongoing impact upon genomic and post-genomic biology. However, like the analysis of microarray data and the assembly and annotation of complete genome sequences from conventional sequencing data, the management and analysis of next-generation sequencing data requires (and indeed has already driven) the development of informatics tools able to assemble, map, and interpret huge quantities of relatively or extremely short nucleotide sequence data. Here we provide a broad overview of bioinformatics approaches that have been introduced for several genomics and functional genomics applications of next-generation sequencing.
David Stephen Horner, Giulio Pavesi, Tiziana Castrignanò, Paolo D'Onorio De Meo, Sabino Liuni, Michael Sammeth, Ernesto Picardi, Graziano Pesole
Briefings Bioinform.2
2010 Beyond evolutionary trees
Gianluca Della Vedova, Riccardo Dondi, Tao Jiang 0001, Giulio Pavesi, Yuri Pirola, Lusheng Wang 0001
Nat. Comput.4
2009 Detecting conserved coding genomic regions through signal processing of nucleotide substitution patterns
Matteo Ré, Giulio Pavesi
Artif. Intell. Medicine2
2008 ASPicDB: A database resource for alternative splicing analysis
abstract
MOTIVATION: Alternative splicing has recently emerged as a key mechanism responsible for the expansion of transcriptome and proteome complexity in human and other organisms. Although several online resources devoted to alternative splicing analysis are available they may suffer from limitations related both to the computational methodologies adopted and to the extent of the annotations they provide that prevent the full exploitation of the available data. Furthermore, current resources provide limited query and download facilities. RESULTS: ASPicDB is a database designed to provide access to reliable annotations of the alternative splicing pattern of human genes and to the functional annotation of predicted splicing isoforms. Splice-site detection and full-length transcript modeling have been carried out by a genome-wide application of the ASPic algorithm, based on the multiple alignments of gene-related transcripts (typically a Unigene cluster) to the genomic sequence, a strategy that greatly improves prediction accuracy compared to methods based on independent and progressive alignments. Enhanced query and download facilities for annotations and sequences allow users to select and extract specific sets of data related to genes, transcripts and introns fulfilling a combination of user-defined criteria. Several tabular and graphical views of the results are presented, providing a comprehensive assessment of the functional implication of alternative splicing in the gene set under investigation. ASPicDB, which is regularly updated on a monthly basis, also includes information on tissue-specific splicing patterns of normal and cancer cells, based on available EST sequences and their library source annotation. AVAILABILITY: www.caspur.it/ASPicDB
Tiziana Castrignanò, Mattia D'Antonio, Anna Anselmo, Danilo Carrabino, A. D'Onorio De Meo, Anna Maria D'Erchia, Flavio Licciulli, Marina Mangiulli, Flavio Mignone, Giulio Pavesi, Ernesto Picardi, Alberto Riva, Raffaella Rizzi, Paola Bonizzoni, Graziano Pesole
Bioinform.10
2007 WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
abstract
BACKGROUND: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homologous genes, an approach that is becoming more and more widely used given the ever increasing amount of genomic data available. RESULTS: We present an algorithm that identifies conserved transcription factor binding sites in a given sequence by comparing it to one or more homologs, adapting a framework we previously introduced for the discovery of sites in sequences from co-regulated genes. Differently from the most commonly used methods, the approach we present does not need or compute an alignment of the sequences investigated, nor resorts to descriptors of the binding specificity of known transcription factors. The main novel idea we introduce is a relative measure of conservation, assuming that true functional elements should present a higher level of conservation with respect to the rest of the sequence surrounding them. We present tests where we applied the algorithm to the identification of conserved annotated sites in homologous promoters, as well as in distal regions like enhancers. CONCLUSION: Results of the tests show how the algorithm can provide fast and reliable predictions of conserved transcription factor binding sites regulating the transcription of a gene, with better performances than other available methods for the same task. We also show examples on how the algorithm can be successfully employed when promoter annotations of the genes investigated are missing, or when regulatory sites and regions are located far away from the genes.
Giulio Pavesi, Federico Zambelli, Graziano Pesole
BMC Bioinform.1
2005 On-line construction of compact directed acyclic word graphs
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
Discret. Appl. Math.7
2005 Algorithms for pattern matching and discovery in RNA secondary structure
Giancarlo Mauri, Giulio Pavesi
Theor. Comput. Sci.2
2004 A GA Approach to the Definition of Regulatory Signals in Genomic Sequences
Giancarlo Mauri, Roberto Mosca 0002, Giulio Pavesi
GECCO (1)3
2004 Computing with a Distributed Reaction-Diffusion Model
Stefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone
MCU3
2004 In silico representation and discovery of transcription factor binding sites
abstract
Understanding the complex mechanisms governing basic biological processes requires the characterisation of regulatory motifs modulating gene expression at transcriptional and post-transcriptional level. In particular, extent, chronology and cell-specificity of transcription are modulated by the interaction of transcription factors with their corresponding binding sites, mostly located near (or sometimes quite far away from) the transcription start site of the gene. The constantly growing amount of genomic data, complemented by other sources of information such as expression data derived from microarray experiments, has opened new opportunities to researchers in this field. Many different methods have been proposed for the identification of transcription factor binding sites in the regulatory regions of co-expressed genes: unfortunately this is a very challenging problem both from the computational and the biological viewpoint. This paper provides a survey of existing methods proposed for the problem, focusing both on the ideas underlying them and their availability to the scientific community.
Giulio Pavesi, Giancarlo Mauri, Graziano Pesole
Briefings Bioinform.1
2004 An Algorithm for Finding Conserved Secondary Structure Motifs in Unaligned RNA Sequences
Giulio Pavesi, Giancarlo Mauri, Graziano Pesole
J. Comput. Sci. Technol.1
2003 Pattern Discovery in RNA Secondary Structure Using Affix Trees
Giancarlo Mauri, Giulio Pavesi
CPM2
2003 Predicting Conserved Hairpin Motifs in Unaligned RNA Sequences
abstract
Several experiments and observations have revealed the fact that small local distinct structural features in RNA molecules are correlated with their biological function, for example in post-transcriptional regulation of gene expression. Thus, finding similar structural features in a set of RNA sequences known to play the same biological function could provide substantial information concerning which parts of the sequences are responsible for the function itself. The main difficulty lies in the fact that in nearly all the cases the structure of the molecules is unknown, has to be somehow predicted, and that sequences with little or no similarity can fold into similar structures. The algorithm we present searches for regions of the sequences that, according to base pairing rules, can fold into similar structures, where the degree of similarity can be defined by the user. Any information concerning sequence similarity in the motifs can be used either as a search constraint, or a posteriori, by post-processing the output. The search for the regions sharing structural similarity is implemented with the affix tree, a novel text-indexing structure that significantly accelerates the search for patterns having a symmetric layout, like those forming RNA hairpins. Tests based on experimentally known structures have shown that the algorithm is able to identify functional motifs in the secondary structure of non coding RNA, such as Iron Responsive Elements (IRE) in the untranslated regions of ferritin mRNA, and the domain IV stem-loop structure in SRP RNA.
Giulio Pavesi, Giancarlo Mauri, Graziano Pesole
ICTAI1
2002 Controlled generation of two-dimensional patterns based on Stochastic Cellular Automata
Stefania Bandini, Giulio Pavesi
Future Gener. Comput. Syst.2
2002 A parallel algorithm for pattern discovery in biological sequences
Giancarlo Mauri, Giulio Pavesi
Future Gener. Comput. Syst.2
2001 On-Line Construction of Compact Directed Acyclic Word Graphs
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
CPM7
2001 Methods for Pattern Discovery in Unaligned Biological Sequences
Giulio Pavesi, Giancarlo Mauri, Graziano Pesole
Briefings Bioinform.1
2001 Parallel simulation of reaction-diffusion phenomena in percolation processes : A model based on cellular automata
Stefania Bandini, Giancarlo Mauri, Giulio Pavesi, Carla Simone
Future Gener. Comput. Syst.3
1999 Approximation Algorithms for Protein Folding Prediction
Giancarlo Mauri, Giulio Pavesi, Antonio Piccolboni
SODA2