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

Jan Budczies

dblp:90/3105 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
sequencing
0.212015
Semiconductor sequencing: how many flows do you need? · Bioinform. 2015
Bioinformatics and computational biology › cancer genomics
cancer classification
0.012004
Optimization models for cancer classification: extracting gene interaction information from microarray expression data · Bioinform. 2004
Bioinformatics and computational biology
gene expression analysis
0.012004
Optimization models for cancer classification: extracting gene interaction information from microarray expression data · Bioinform. 2004

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

maximal margin linear programming · 0.0linear programming · 0.0
YearPublicationVenuePosition
2018 Ioncopy: an R Shiny app to call copy number alterations in targeted NGS data
abstract
BACKGROUND: Somatic copy number alterations (CNAs) contribute to the clinically targetable aberrations in the tumor genome. For both routine diagnostics and biomarkers research, CNA analysis in a single assay together with somatic mutations is highly desirable. RESULTS: Ioncopy is a validated method and easy-to-use software for CNA calling from targeted NGS data. Copy number and significance of CNA are estimated for each gene in each sample. Copy number gains and losses are called after multiple testing corrections controlling FWER or FDR. CONCLUSIONS: Ioncopy facilitates calling of CNAs in a cohort of tumors tissues with or without using normal (germline) DNA controls.
Jan Budczies, Nicole Pfarr, Eva Romanovsky, Volker Endris, Albrecht Stenzinger, Carsten Denkert
BMC Bioinform.1
2015 Semiconductor sequencing: how many flows do you need?
abstract
MOTIVATION: Semiconductor sequencing directly translates chemically encoded information (A, C, G or T) into voltage signals that are detected by a semiconductor device. Changes of pH value and thereby of the electric potential in the reaction well are detected during strand synthesis from nucleotides provided in cyclic repeated flows for each type of nucleotide. To minimize time requirement and costs, it is necessary to know the number of flows that are required for complete coverage of the templates. RESULTS: We calculate the number of required flows in a random sequence model and present exact expressions for cumulative distribution function, expected value and variance. Additionally, we provide an algorithm to calculate the number of required flows for a concrete list of amplicons using a BED file of genomic positions as input. We apply the algorithm to calculate the number of flows that are required to cover six amplicon panels that are used for targeted sequencing in cancer research. The upper bounds obtained for the number of flows allow to enhance the instrument throughput from two chips to three chips per day for four of these panels. AVAILABILITY AND IMPLEMENTATION: The algorithm for calculation of the flows was implemented in R and is available as package ionflows from the CRAN repository. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Jan Budczies, Michael Bockmayr, Denise Treue, Frederick Klauschen, Carsten Denkert
Bioinform.1
2007 Robust detection and verification of linear relationships to generate metabolic networks using estimates of technical errors
abstract
BACKGROUND: The size and magnitude of the metabolome, the ratio between individual metabolites and the response of metabolic networks is controlled by multiple cellular factors. A tight control over metabolite ratios will be reflected by a linear relationship of pairs of metabolite due to the flexibility of metabolic pathways. Hence, unbiased detection and validation of linear metabolic variance can be interpreted in terms of biological control. For robust analyses, criteria for rejecting or accepting linearities need to be developed despite technical measurement errors. The entirety of all pair wise linear metabolic relationships then yields insights into the network of cellular regulation. RESULTS: The Bayesian law was applied for detecting linearities that are validated by explaining the residues by the degree of technical measurement errors. Test statistics were developed and the algorithm was tested on simulated data using 3-150 samples and 0-100% technical error. Under the null hypothesis of the existence of a linear relationship, type I errors remained below 5% for data sets consisting of more than four samples, whereas the type II error rate quickly raised with increasing technical errors. Conversely, a filter was developed to balance the error rates in the opposite direction. A minimum of 20 biological replicates is recommended if technical errors remain below 20% relative standard deviation and if thresholds for false error rates are acceptable at less than 5%. The algorithm was proven to be robust against outliers, unlike Pearson's correlations. CONCLUSION: The algorithm facilitates finding linear relationships in complex datasets, which is radically different from estimating linearity parameters from given linear relationships. Without filter, it provides high sensitivity and fair specificity. If the filter is activated, high specificity but only fair sensitivity is yielded. Total error rates are more favorable with deactivated filters, and hence, metabolomic networks should be generated without the filter. In addition, Bayesian likelihoods facilitate the detection of multiple linear dependencies between two variables. This property of the algorithm enables its use as a discovery tool and to generate novel hypotheses of the existence of otherwise hidden biological factors.
Frank Kose, Jan Budczies, Matthias Holschneider, Oliver Fiehn
BMC Bioinform.2
2004 Optimization models for cancer classification: extracting gene interaction information from microarray expression data
abstract
MOTIVATION: Microarray data appear particularly useful to investigate mechanisms in cancer biology and represent one of the most powerful tools to uncover the genetic mechanisms causing loss of cell cycle control. Recently, several different methods to employ microarray data as a diagnostic tool in cancer classification have been proposed. These procedures take changes in the expression of particular genes into account but do not consider disruptions in certain gene interactions caused by the tumor. It is probable that some genes participating in tumor development do not change their expression level dramatically. Thus, they cannot be detected by simple classification approaches used previously. For these reasons, a classification procedure exploiting information related to changes in gene interactions is needed. RESULTS: We propose a MAximal MArgin Linear Programming (MAMA) method for the classification of tumor samples based on microarray data. This procedure detects groups of genes and constructs models (features) that strongly correlate with particular tumor types. The detected features include genes whose functional relations are changed for particular cancer types. The proposed method was tested on two publicly available datasets and demonstrated a prediction ability superior to previously employed classification schemes. AVAILABILITY: The MAMA system was developed using the linear programming system LINDO http://www.lindo.com. A Perl script that specifies the optimization problem for this software is available upon request from the authors.
Alexey V. Antonov, Igor V. Tetko, Michael T. Mader, Jan Budczies, Hans-Werner Mewes
Bioinform.4