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

Pietro Speroni di Fenizio

dblp:54/810 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0001-9909-8068ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
systems biology
0.222010
A parallel algorithm to compute chemical organizations in biological networks · Bioinform. 2010
Computing chemical organizations in biological networks · Bioinform. 2008
Parallel and multicore computing › MPI
MPI-based parallelization
0.112010
A parallel algorithm to compute chemical organizations in biological networks · Bioinform. 2010
Parallel and multicore computing
parallel algorithms
0.112010
A parallel algorithm to compute chemical organizations in biological networks · Bioinform. 2010
Bioinformatics and computational biology › network bioinformatics › biological network analysis › molecular network analysis
biochemical network analysis
0.112008
Computing chemical organizations in biological networks · Bioinform. 2008

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

message passing interface · 0.2constructive algorithm · 0.2flux-based analysis · 0.1SBML parsing · 0.1
YearPublicationVenuePosition
2010 A parallel algorithm to compute chemical organizations in biological networks
abstract
SUMMARY: Analysing genome-scale in silico models with stoichiometry-based methods is computationally demanding. The current algorithms to compute chemical organizations in chemical reaction networks are limited to small-scale networks, prohibiting a thorough analysis of large models. Here, we introduce a parallelized version of the constructive algorithm to determine chemical organizations. The algorithm is implemented in the Standard C programming language and parallelized using the message passing interface (MPI) protocol. The resulting code can be executed on computer clusters making use of an arbitrary number of processors. The algorithm is parallelized in an embarrassing parallel manner, providing good scalability. AVAILABILITY: An implementation of the algorithm including source code can be obtained from http://www.minet.uni-jena.de/csb/prj/ot/tools
Florian Centler, Christoph Kaleta, Pietro Speroni di Fenizio, Peter Dittrich
Bioinform.3
2008 Chemical organizations in living systems
Peter Dittrich, Florian Centler, Christoph Kaleta, Naoki Matsumaru, Pietro Speroni di Fenizio
ALIFE5
2008 Computing chemical organizations in biological networks
abstract
MOTIVATION: Novel techniques are required to analyze computational models of intracellular processes as they increase steadily in size and complexity. The theory of chemical organizations has recently been introduced as such a technique that links the topology of biochemical reaction network models to their dynamical repertoire. The network is decomposed into algebraically closed and self-maintaining subnetworks called organizations. They form a hierarchy representing all feasible system states including all steady states. RESULTS: We present three algorithms to compute the hierarchy of organizations for network models provided in SBML format. Two of them compute the complete organization hierarchy, while the third one uses heuristics to obtain a subset of all organizations for large models. While the constructive approach computes the hierarchy starting from the smallest organization in a bottom-up fashion, the flux-based approach employs self-maintaining flux distributions to determine organizations. A runtime comparison on 16 different network models of natural systems showed that none of the two exhaustive algorithms is superior in all cases. Studying a 'genome-scale' network model with 762 species and 1193 reactions, we demonstrate how the organization hierarchy helps to uncover the model structure and allows to evaluate the model's quality, for example by detecting components and subsystems of the model whose maintenance is not explained by the model. AVAILABILITY: All data and a Java implementation that plugs into the Systems Biology Workbench is available from http://www.minet.uni-jena.de/csb/prj/ot/tools.
Florian Centler, Christoph Kaleta, Pietro Speroni di Fenizio, Peter Dittrich
Bioinform.3