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

Lars Hennig

dblp:66/3232 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
0000-0002-6645-1862ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2

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 · 60% Computational social science and digital humanities · 40%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
causal inference
0.112012
Causal stability ranking · Bioinform. 2012
Bioinformatics and computational biology › gene expression analysis
biclustering
0.112006
A systematic comparison and evaluation of biclustering methods for gene expression data · Bioinform. 2006
Bioinformatics and computational biology
gene expression analysis
0.112006
A systematic comparison and evaluation of biclustering methods for gene expression data · Bioinform. 2006
Data mining › clustering
co-clustering
0.112006
A systematic comparison and evaluation of biclustering methods for gene expression data · Bioinform. 2006
Data mining
pattern mining
0.112006
A systematic comparison and evaluation of biclustering methods for gene expression data · Bioinform. 2006
Bioinformatics and computational biology
gene expression
0.012012
Causal stability ranking · Bioinform. 2012
Bioinformatics and computational biology › statistical genetics
phenotype prediction
0.012012
Causal stability ranking · Bioinform. 2012

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

regression · 0.1causal effect lower bounds · 0.1hierarchical clustering · 0.1divide-and-conquer algorithm · 0.1binary reference model · 0.1
YearPublicationVenuePosition
2012 Causal stability ranking
abstract
Genotypic causes of a phenotypic trait are typically determined via randomized controlled intervention experiments. Such experiments are often prohibitive with respect to durations and costs, and informative prioritization of experiments is desirable. We therefore consider predicting stable rankings of genes (covariates), according to their total causal effects on a phenotype (response), from observational data. Since causal effects are generally non-identifiable from observational data only, we use a method that can infer lower bounds for the total causal effect under some assumptions. We validated our method, which we call Causal Stability Ranking (CStaR), in two situations. First, we performed knock-out experiments with Arabidopsis thaliana according to a predicted ranking based on observational gene expression data, using flowering time as phenotype of interest. Besides several known regulators of flowering time, we found almost half of the tested top ranking mutants to have a significantly changed flowering time. Second, we compared CStaR to established regression-based methods on a gene expression dataset of Saccharomyces cerevisiae. We found that CStaR outperforms these established methods. Our method allows for efficient design and prioritization of future intervention experiments, and due to its generality it can be used for a broad spectrum of applications.
Daniel J. Stekhoven, Izabel Moraes, Gardar Sveinbjörnsson, Lars Hennig, Marloes H. Maathuis, Peter Bühlmann
Bioinform.4
2006 A systematic comparison and evaluation of biclustering methods for gene expression data
abstract
MOTIVATION: In recent years, there have been various efforts to overcome the limitations of standard clustering approaches for the analysis of gene expression data by grouping genes and samples simultaneously. The underlying concept, which is often referred to as biclustering, allows to identify sets of genes sharing compatible expression patterns across subsets of samples, and its usefulness has been demonstrated for different organisms and datasets. Several biclustering methods have been proposed in the literature; however, it is not clear how the different techniques compare with each other with respect to the biological relevance of the clusters as well as with other characteristics such as robustness and sensitivity to noise. Accordingly, no guidelines concerning the choice of the biclustering method are currently available. RESULTS: First, this paper provides a methodology for comparing and validating biclustering methods that includes a simple binary reference model. Although this model captures the essential features of most biclustering approaches, it is still simple enough to exactly determine all optimal groupings; to this end, we propose a fast divide-and-conquer algorithm (Bimax). Second, we evaluate the performance of five salient biclustering algorithms together with the reference model and a hierarchical clustering method on various synthetic and real datasets for Saccharomyces cerevisiae and Arabidopsis thaliana. The comparison reveals that (1) biclustering in general has advantages over a conventional hierarchical clustering approach, (2) there are considerable performance differences between the tested methods and (3) already the simple reference model delivers relevant patterns within all considered settings.
Amela Prelic, Stefan Bleuler, Philip Zimmermann 0001, Anja Wille, Peter Bühlmann, Wilhelm Gruissem, Lars Hennig, Lothar Thiele, Eckart Zitzler
Bioinform.7