Demo Data from EDBT 2026 / reviewers in the wild / expert
Cedric Landerer
dblp:130/7390
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-2122-6506ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 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
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › proteomics
mass spectrometry data analysis |
0.8 | 1 | 2024 | deTELpy: Python package for high-throughput detection of amino acid substitutions in mass spectrometry datasets · Bioinform. 2024 |
Bioinformatics and computational biology
proteomics |
0.8 | 1 | 2024 | deTELpy: Python package for high-throughput detection of amino acid substitutions in mass spectrometry datasets · Bioinform. 2024 |
Bioinformatics and computational biology › genomics
computational genomics |
0.6 | 2 | 2024 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 deTELpy: Python package for high-throughput detection of amino acid substitutions in mass spectrometry datasets · Bioinform. 2024 |
Bioinformatics and computational biology › molecular evolution
codon usage analysis |
0.3 | 1 | 2018 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 |
Bioinformatics and computational biology › transcriptomics
ribosome profiling |
0.1 | 1 | 2018 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 |
Methods — techniques the papers use, named apart from their topics
mass spectrometry · 0.8batch processing pipeline · 0.8mixture model · 0.3hierarchical modeling · 0.3Bayesian MCMC · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | deTELpy: Python package for high-throughput detection of amino acid substitutions in mass spectrometry datasetsabstractMOTIVATION: Errors in the processing of genetic information during protein synthesis can lead to phenotypic mutations, such as amino acid substitutions, e.g. by transcription or translation errors. While genetic mutations can be readily identified using DNA sequencing, and mutations due to transcription errors by RNA sequencing, translation errors can only be identified proteome-wide using mass spectrometry. RESULTS: Here, we provide a Python package implementation of a high-throughput pipeline to detect amino acid substitutions in mass spectrometry datasets. Our tools enable users to process hundreds of mass spectrometry datasets in batch mode to detect amino acid substitutions and calculate codon-specific and site-specific translation error rates. deTELpy will facilitate the systematic understanding of amino acid misincorporation rates (translation error rates), and the inference of error models across organisms and under stress conditions, such as drug treatment or disease conditions. AVAILABILITY AND IMPLEMENTATION: deTELpy is implemented in Python 3 and is freely available with detailed documentation and practical examples at https://git.mpi-cbg.de/tothpetroczylab/detelpy and https://pypi.org/project/deTELpy/ and can be easily installed via pip install deTELpy. Cedric Landerer, Maxim Scheremetjew, HongKee Moon, Lena Hersemann, Ágnes Tóth-Petróczy |
Bioinform. | 1 |
| 2018 | AnaCoDa: analyzing codon data with Bayesian mixture modelsabstractSummary: AnaCoDa is an R package for estimating biologically relevant parameters of mixture models, such as selection against translation inefficiency, non-sense errors and ribosome pausing time, from genomic and high throughput datasets. AnaCoDa provides an adaptive Bayesian MCMC algorithm, fully implemented in C++ for high performance with an ergonomic R interface to improve usability. AnaCoDa employs a generic object-oriented design to allow users to extend the framework and implement their own models. Current models implemented in AnaCoDa can accurately estimate biologically relevant parameters given either protein coding sequences or ribosome foot-printing data. Optionally, AnaCoDa can utilize additional data sources, such as gene expression measurements, to aid model fitting and parameter estimation. By utilizing a hierarchical object structure, some parameters can vary between sets of genes while others can be shared. Genes may be assigned to clusters or membership may be estimated by AnaCoDa. This flexibility allows users to estimate the same model parameter under different biological conditions and categorize genes into different sets based on shared model properties embedded within the data. AnaCoDa also allows users to generate simulated data which can be used to aid model development and model analysis as well as evaluate model adequacy. Finally, AnaCoDa contains a set of visualization routines and the ability to revisit or re-initiate previous model fitting, providing researchers with a well rounded easy to use framework to analyze genome scale data. Availability and implementation: AnaCoDa is freely available under the Mozilla Public License 2.0 on CRAN (https://cran.r-project.org/web/packages/AnaCoDa/). Cedric Landerer, Alexander Cope, Russell Zaretzki, Michael A. Gilchrist |
Bioinform. | 1 |
| 2013 | Homology-based inference sets the bar high for protein function predictionabstractBACKGROUND: Any method that de novo predicts protein function should do better than random. More challenging, it also ought to outperform simple homology-based inference. METHODS: Here, we describe a few methods that predict protein function exclusively through homology. Together, they set the bar or lower limit for future improvements. RESULTS AND CONCLUSIONS: During the development of these methods, we faced two surprises. Firstly, our most successful implementation for the baseline ranked very high at CAFA1. In fact, our best combination of homology-based methods fared only slightly worse than the top-of-the-line prediction method from the Jones group. Secondly, although the concept of homology-based inference is simple, this work revealed that the precise details of the implementation are crucial: not only did the methods span from top to bottom performers at CAFA, but also the reasons for these differences were unexpected. In this work, we also propose a new rigorous measure to compare predicted and experimental annotations. It puts more emphasis on the details of protein function than the other measures employed by CAFA and may best reflect the expectations of users. Clearly, the definition of proper goals remains one major objective for CAFA. Tobias Hamp, Rebecca Kassner, Stefan Seemayer, Esmeralda Vicedo, Christian Schaefer, Dominik Achten, Florian Auer, Ariane Boehm, Tatjana Braun, Maximilian Hecht, Mark Heron, Peter Hönigschmid, Thomas A. Hopf, Stefanie Kaufmann, Michael Kiening, Denis Krompass, Cedric Landerer, Yannick Mahlich, Manfred Roos, Burkhard Rost |
BMC Bioinform. | 17 |