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

Hannes Planatscher

dblp:85/2071 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-6536-0782ORCID · corroborated

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

Artificial intelligence and machine learning · 3Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 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
3 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
systems biology
0.612022
The systems biology simulation core library · Bioinform. 2022
Bioinformatics and computational biology
proteomics
0.212014
Identification of short terminal motifs enriched by antibodies using peptide mass fingerprinting · Bioinform. 2014
Bioinformatics and computational biology › systems biology
model exchange format
0.212022
The systems biology simulation core library · Bioinform. 2022
Bioinformatics and computational biology › systems biology › model exchange format
systems biology model exchange
0.112009
SBML2LATEX: Conversion of SBML files into human-readable reports · Bioinform. 2009

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

stochastic differential equation solver · 0.6ordinary differential equation solver · 0.6constraint-based analysis · 0.6sampling · 0.2peptide mass fingerprinting · 0.2web services · 0.1latex document generation · 0.1
YearPublicationVenuePosition
2022 The systems biology simulation core library
abstract
SUMMARY: Studying biological systems generally relies on computational modeling and simulation, e.g., model-driven discovery and hypothesis testing. Progress in standardization efforts led to the development of interrelated file formats to exchange and reuse models in systems biology, such as SBML, the Simulation Experiment Description Markup Language (SED-ML) or the Open Modeling EXchange format. Conducting simulation experiments based on these formats requires efficient and reusable implementations to make them accessible to the broader scientific community and to ensure the reproducibility of the results. The Systems Biology Simulation Core Library (SBSCL) provides interpreters and solvers for these standards as a versatile open-source API in JavaTM. The library simulates even complex bio-models and supports deterministic Ordinary Differential Equations; Stochastic Differential Equations; constraint-based analyses; recent SBML and SED-ML versions; exchange of results, and visualization of in silico experiments; open modeling exchange formats (COMBINE archives); hierarchically structured models; and compatibility with standard testing systems, including the Systems Biology Test Suite and published models from the BioModels and BiGG databases. AVAILABILITY AND IMPLEMENTATION: SBSCL is freely available at https://draeger-lab.github.io/SBSCL/ and via Maven Central. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Hemil Panchiwala, Shalin Shah, Hannes Planatscher, Mykola Zakharchuk, Matthias König 0003, Andreas Dräger
Bioinform.3
2014 Identification of short terminal motifs enriched by antibodies using peptide mass fingerprinting
abstract
Abstract Motivation: Mass spectrometry-based protein profiling has become a key technology in biomedical research and biomarker discovery. Sample preparation strategies that reduce the complexity of tryptic digests by immunoaffinity substantially increase throughput and sensitivity in proteomic mass spectrometry. The scarce availability of peptide-specific capture antibodies limits these approaches. Recently antibodies directed against short terminal motifs were found to enrich subsets of peptides with identical terminal sequences. This approach holds the promise of a significant gain in efficiency. TXP (Triple X Proteomics) and context-independent motif specific/global proteome survey binders are variants of this concept. Principally the binding motifs of such antibodies have to be elucidated after generating these antibodies. This entails a substantial effort in the lab, as it requires synthetic peptide libraries and numerous mass spectrometry experiments. Results: We present an algorithm for predicting the antibody-binding motif in a mass spectrum obtained from a tryptic digest of a common cell line after immunoprecipitation. The epitope prediction, based on peptide mass fingerprinting, reveals the most enriched terminal epitopes. The tool provides a P-value for each potential epitope, estimated by sampling random spectra from a peptide database. The second algorithm combines the predicted sequences to more complex binding motifs. A comparison with library screenings shows that the predictions made by the novel methods are reliable and reproducible indicators of the binding properties of an antibody. Availability: Mass spectrum data, predictions, sampling tables, consensus peptide databases and the applied protocols are available as Supplementary Material. TXP-Terminus Enrichment Analysis (TEA) and MATERICS (Mass-spectrometric Analysis of Terminal Epitope Enrichment in Complex Samples) are available as web services at http://webservices.nmi.de/materics. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Hannes Planatscher, Frederik Weiß, David Eisen, B. H. J. van den Berg, Andreas Zell, Thomas Joos, Oliver Poetz
Bioinform.1
2009 SBML2LATEX: Conversion of SBML files into human-readable reports
abstract
SUMMARY: The XML-based Systems Biology Markup Language (SBML) has emerged as a standard for storage, communication and interchange of models in systems biology. As a machine-readable format XML is difficult for humans to read and understand. Many tools are available that visualize the reaction pathways stored in SBML files, but many components, e.g. unit declarations, complex kinetic equations or links to MIRIAM resources, are often not made visible in these diagrams. For a broader understanding of the models, support in scientific writing and error detection, a human-readable report of the complete model is needed. We present SBML2L(A)T(E)X, a Java-based stand-alone program to fill this gap. A convenient web service allows users to directly convert SBML to various formats, including DVI, L(A)T(E)X and PDF, and provides many settings for customization. AVAILABILITY: Source code, documentation and a web service are freely available at (http://www.ra.cs.uni-tuebingen.de/software/SBML2LaTeX).
Andreas Dräger, Hannes Planatscher, Dieudonné Motsou Wouamba, Adrian Schröder, Michael Hucka, Lukas Endler, Martin Golebiewski, Wolfgang Müller 0001, Andreas Zell
Bioinform.2
2007 Benchmarking evolutionary algorithms on convenience kinetics modelsof the valine and leucine biosynthesis in C. glutamicum
abstract
An important problem in systems biology is parameter estimation for biochemical system models. Our work concentrates on the metabolic subnetwork of the valine and leucine biosynthesis in Corynebacterium glutamicum, an anaerobic actinobacterium of high biotechnological importance. Using data of an in vivo experiment measuring 13 metabolites during a glucose stimulus-response experiment we investigate the performance of various evolutionary algorithms on the parameter inference problem in biochemical modeling. Due to the inconclusive information on the reversibility of the reactions in the pathway, we develop both a reversible and an irreversible differential equation model based on the recent convenience kinetics approach. As the reversible model allows better approximation on the whole, we use it to analyze the impact of different settings on four especially promising EAs. We show that Particle Swarm Optimization as well as Differential Evolution are useful methods for parameter estimation on convenience kinetics models outperforming Genetic Algorithm and Evolution Strategy approaches and nearly reaching the quality of independent spline approximations on the raw data.
Andreas Dräger, Marcel Kronfeld, Jochen Supper, Hannes Planatscher, Jørgen B. Magnus, Marco Oldiges, Andreas Zell
IEEE Congress on Evolutionary Computation4
2007 Comparing various evolutionary algorithms on the parameter optimization of the valine and leucine biosynthesis in corynebacterium glutamicum
abstract
Parameter estimation for biochemical model systems has become an important problem in systems biology. Here we focus on the metabolic subnetwork of the valine and leucine biosynthesis in C. glutamicum. Due to the lack of indisputable information regarding reversibility of the reactions in the pathway we derived two alternative ordinary differential equation models based on the formalisms of the generalized mass-action rate law. We introduced two alternative modeling approaches for feedback inhibition and evaluated the applicability of six optimization procedures (multi start Hill Climber, binary and real valued Genetic Algorithm, standard and covariance matrix adaption Evolution Strategy as well as Simulated Annealing) to the problem of parameter fitting. The model considering irreversible reactions performed worse and was therefore rejected from further analysis. We benchmarked the impact of different mutation and crossover operators as well as the influence of the population size on the remaining system and the two best optimization procedures namely binary Genetic Algorithm and the Evolution Strategy. The GA performed best on average and found the best total result based on the relative squared error.
Andreas Dräger, Jochen Supper, Hannes Planatscher, Jørgen B. Magnus, Marco Oldiges, Andreas Zell
IEEE Congress on Evolutionary Computation3
2004 Comparing Genetic Programming and Evolution Strategies on Inferring Gene Regulatory Networks
Felix Streichert, Hannes Planatscher, Christian Spieth, Holger Ulmer, Andreas Zell
GECCO (1)2