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

Stefano Cozzini

dblp:07/5947 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0001-6049-5242ORCID · corroborated

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

Systems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure analysis
0.112009
PiSQRD: a web server for decomposing proteins into quasi-rigid dynamical domains · Bioinform. 2009
Bioinformatics and computational biology › computational structural biology
normal mode analysis
0.012009
PiSQRD: a web server for decomposing proteins into quasi-rigid dynamical domains · Bioinform. 2009
Bioinformatics and computational biology
protein dynamics
0.012009
PiSQRD: a web server for decomposing proteins into quasi-rigid dynamical domains · Bioinform. 2009

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

elastic network model · 0.1
YearPublicationVenuePosition
2022 DPCfam: Unsupervised protein family classification by Density Peak Clustering of large sequence datasets
abstract
Proteins that are known only at a sequence level outnumber those with an experimental characterization by orders of magnitude. Classifying protein regions (domains) into homologous families can generate testable functional hypotheses for yet unannotated sequences. Existing domain family resources typically use at least some degree of manual curation: they grow slowly over time and leave a large fraction of the protein sequence space unclassified. We here describe automatic clustering by Density Peak Clustering of UniRef50 v. 2017_07, a protein sequence database including approximately 23M sequences. We performed a radical re-implementation of a pipeline we previously developed in order to allow handling millions of sequences and data volumes of the order of 3 TeraBytes. The modified pipeline, which we call DPCfam, finds ∼ 45,000 protein clusters in UniRef50. Our automatic classification is in close correspondence to the ones of the Pfam and ECOD resources: in particular, about 81% of medium-large Pfam families and 72% of ECOD families can be mapped to clusters generated by DPCfam. In addition, our protocol finds more than 14,000 clusters constituted of protein regions with no Pfam annotation, which are therefore candidates for representing novel protein families. These results are made available to the scientific community through a dedicated repository.
Elena Tea Russo, Federico Barone, Alex Bateman, Stefano Cozzini, Marco Punta, Alessandro Laio
PLoS Comput. Biol.4
2021 Continuous-Action Reinforcement Learning for Portfolio Allocation of a Life Insurance Company
Carlo Abrate, Alessio Angius, Gianmarco De Francisci Morales, Stefano Cozzini, Francesca Iadanza, Laura Li Puma, Simone Pavanelli, Alan Perotti, Stefano Pignataro, Silvia Ronchiadin
ECML/PKDD (4)4
2016 The ExaNeSt Project: Interconnects, Storage, and Packaging for Exascale Systems
abstract
ExaNest is one of three European projects that support a ground-breaking computing architecture for exascale-class systems built upon power-efficient 64-bit ARM processors. This group of projects share an "everything-close" and "share-anything" paradigm, which trims down the power consumption -- by shortening the distance of signals for most data transfers -- as well as the cost and footprint area of the installation -- by reducing the number of devices needed to meet performance targets. In ExaNeSt, we will design and implement: (i) a physical rack prototype and its liquid-cooling subsystem providing ultra-dense compute packaging, (ii) a storage architecture with distributed (in-node) non-volatile memory (NVM) devices, (iii) a unified, low-latency interconnect, designed to efficiently uphold desired Quality-of-Service guarantees for a mix of storage with inter-processor flows, and (iv) efficient rack-level memory sharing, where each page is cacheable at only a single node. Our target is to test alternative storage and interconnect options on actual hardware, using real-world HPC applications. The ExaNeSt consortium brings together technology, skills, and knowledge across the entire value chain, from computing IP, packaging, and system deployment, all the way up to operating systems, storage, HPC, big data frameworks, and cutting-edge applications.
Manolis Katevenis, Nikolaos Chrysos, Manolis Marazakis, Iakovos Mavroidis, Fabien Chaix, Nikolaos D. Kallimanis, Javier Navaridas, John Goodacre, Piero Vicini, Andrea Biagioni, Pier Stanislao Paolucci, Alessandro Lonardo, Elena Pastorelli, Francesca Lo Cicero, Roberto Ammendola, P. Hopton, P. Coates, Giuliano Taffoni, Stefano Cozzini, Martin L. Kersten, Julio Sahuquillo, Sergio Lechago, C. Pinto, Bernd Lietzow, D. Everett, Gino Perna
DSD19
2014 Regional Climate Simulations on EU-INDIA Grid Infrastructures: Methodologies and Performance
Stefano Cozzini, Deepika Vaddi, Savita Goel, Francesco De Giorgi, S. K. Dash
J. Grid Comput.1
2013 The HPC Testbed of the Italian Grid Infrastructure
abstract
Even though the Italian Grid Infrastructure (IGI) is a general purpose distributed platform, in the past it has been used mainly for serial computations. Parallel applications have been typically executed on supercomputer facilities or, in case of ``not high-end'' HPC applications, on local commodity parallel clusters. Nowadays, with the availability of multiple cores processors, Grid computing is becoming very attractive also for parallel applications but some problems exist in supporting of HPC applications on Grid environment. Here we describe the work made to set up a HPC testbed for ``not high-end'' HPC applications, based on IGI Grid technologies, to find solutions to those problems. Participating sites have been selected among the ones running HPC clusters in Grid environment. Each of them contributed with their specific HPC experience and their available resources to the present test, which encompasses an unprecedented large set of applications from different disciplines in the fields of astronomy, astrophysics, chemistry, climatology, material science and oceanography. In addition to computing resources sharing, the main contribution of each participant was the identification of the real requirements of his application also related to the current middleware limitations and then the realization of a test platform enhanced with additional HPC solutions and configurations developed in a tight collaboration between HPC administrators, users and IGI managers. The main work was on computational resources selection, data management and the definition, the deployment and the documentation of the software execution environment. The outcoming results of the testbed represent the basis of the HPC support in the IGI production infrastructure.
Roberto Alfieri, Silvia Arezzini, Giovanni Battista Barone, Ugo Becciani, Marco Bencivenni, Vania Boccia, Davide Bottalico, Luisa Carracciuolo, Daniele Cesini, Alberto Ciampa, Alessandro Costantini, Stefano Cozzini, Roberto De Pietri, M. Drudi, Antonia Ghiselli, Enrico Mazzoni, Stefano Ottani, A. Venturini, Paolo Veronesi
PDP12
2009 PiSQRD: a web server for decomposing proteins into quasi-rigid dynamical domains
abstract
SUMMARY: The PiSQRD web resource can be used to subdivide protein structures in quasi-rigid dynamical domains. The latter are groups of amino acids behaving as approximately rigid units in the course of protein equilibrium fluctuations. The PiSQRD server takes as input a biomolecular structure and the desired fraction of protein internal fluctuations that must be accounted for by the relative rigid-body motion of the dynamical domains. Next, the lowest energy modes of fluctuation of the protein (optionally provided by the user) are calculated and used to identify the rigid subunits. The resulting optimal subdivision is returned through a web page containing both interactive graphics and detailed data output. AVAILABILITY: The PiSQRD web server, which requires Java, is available free of charge for academic users at http://pisqrd.escience-lab.org.
Tyanko Aleksiev, Raffaello Potestio, Francesco Pontiggia, Stefano Cozzini, Cristian Micheletti
Bioinform.4