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

Johan Staaf

dblp:81/1707 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0001-5254-5115ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 6 · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › cancer genomics › copy number analysis
array CGH segmentation
0.122007
Continuous-index hidden Markov modelling of array CGH copy number data · Bioinform. 2007
Robust smooth segmentation approach for array CGH data analysis · Bioinform. 2007
Bioinformatics and computational biology › cancer genomics › copy number analysis
copy number alteration analysis
0.112007
Robust smooth segmentation approach for array CGH data analysis · Bioinform. 2007
Bioinformatics and computational biology › cancer genomics
copy number analysis
0.112007
Continuous-index hidden Markov modelling of array CGH copy number data · Bioinform. 2007
Bioinformatics and computational biology › genomics
genomic data analysis
0.112007
Continuous-index hidden Markov modelling of array CGH copy number data · Bioinform. 2007
Bioinformatics and computational biology
biological database
0.012004
ACID: a database for microarray clone information · Bioinform. 2004

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

iterative weighted least-squares · 0.1hidden markov model · 0.1heavy-tailed random-effect model · 0.1Monte Carlo EM algorithm · 0.1
YearPublicationVenuePosition
2021 Pan-cancer application of a lung-adenocarcinoma-derived gene-expression-based prognostic predictor
abstract
Gene-expression profiling can be used to classify human tumors into molecular subtypes or risk groups, representing potential future clinical tools for treatment prediction and prognostication. However, it is less well-known how prognostic gene signatures derived in one malignancy perform in a pan-cancer context. In this study, a gene-rule-based single sample predictor (SSP) called classifier for lung adenocarcinoma molecular subtypes (CLAMS) associated with proliferation was tested in almost 15 000 samples from 32 cancer types to classify samples into better or worse prognosis. Of the 14 malignancies that presented both CLAMS classes in sufficient numbers, survival outcomes were significantly different for breast, brain, kidney and liver cancer. Patients with samples classified as better prognosis by CLAMS were generally of lower tumor grade and disease stage, and had improved prognosis according to other type-specific classifications (e.g. PAM50 for breast cancer). In all, 99.1% of non-lung cancer cases classified as better outcome by CLAMS were comprised within the range of proliferation scores of lung adenocarcinoma cases with a predicted better prognosis by CLAMS. This finding demonstrates the potential of tuning SSPs to identify specific levels of for instance tumor proliferation or other transcriptional programs through predictor training. Together, pan-cancer studies such as this may take us one step closer to understanding how gene-expression-based SSPs act, which gene-expression programs might be important in different malignancies, and how to derive tools useful for prognostication that are efficient across organs.
Deborah F. Nacer, Helena Liljedahl, Anna Karlsson, David Lindgren, Johan Staaf
Briefings Bioinform.5
2020 Performance of gene expression-based single sample predictors for assessment of clinicopathological subgroups and molecular subtypes in cancers: a case comparison study in non-small cell lung cancer
abstract
The development of multigene classifiers for cancer prognosis, treatment prediction, molecular subtypes or clinicopathological groups has been a cornerstone in transcriptomic analyses of human malignancies for nearly two decades. However, many reported classifiers are critically limited by different preprocessing needs like normalization and data centering. In response, a new breed of classifiers, single sample predictors (SSPs), has emerged. SSPs classify samples in an N-of-1 fashion, relying on, e.g. gene rules comparing expression values within a sample. To date, several methods have been reported, but there is a lack of head-to-head performance comparison for typical cancer classification problems, representing an unmet methodological need in cancer bioinformatics. To resolve this need, we performed an evaluation of two SSPs [k-top-scoring pair classifier (kTSP) and absolute intrinsic molecular subtyping (AIMS)] for two case examples of different magnitude of difficulty in non-small cell lung cancer: gene expression-based classification of (i) tumor histology and (ii) molecular subtype. Through the analysis of ~2000 lung cancer samples for each case example (n = 1918 and n = 2106, respectively), we compared the performance of the methods for different sample compositions, training data set sizes, gene expression platforms and gene rule selections. Three main conclusions are drawn from the comparisons: both methods are platform independent, they select largely overlapping gene rules associated with actual underlying tumor biology and, for large training data sets, they behave interchangeably performance-wise. While SSPs like AIMS and kTSP offer new possibilities to move gene expression signatures/predictors closer to a clinical context, they are still importantly limited by the difficultness of the classification problem at hand.
Helena Cirenajwis, Martin Lauss, Maria Planck, Johan Vallon-Christersson, Johan Staaf
Briefings Bioinform.5
2008 Normalization of Illumina Infinium whole-genome SNP data improves copy number estimates and allelic intensity ratios
abstract
BACKGROUND: Illumina Infinium whole genome genotyping (WGG) arrays are increasingly being applied in cancer genomics to study gene copy number alterations and allele-specific aberrations such as loss-of-heterozygosity (LOH). Methods developed for normalization of WGG arrays have mostly focused on diploid, normal samples. However, for cancer samples genomic aberrations may confound normalization and data interpretation. Therefore, we examined the effects of the conventionally used normalization method for Illumina Infinium arrays when applied to cancer samples. RESULTS: We demonstrate an asymmetry in the detection of the two alleles for each SNP, which deleteriously influences both allelic proportions and copy number estimates. The asymmetry is caused by a remaining bias between the two dyes used in the Infinium II assay after using the normalization method in Illumina's proprietary software (BeadStudio). We propose a quantile normalization strategy for correction of this dye bias. We tested the normalization strategy using 535 individual hybridizations from 10 data sets from the analysis of cancer genomes and normal blood samples generated on Illumina Infinium II 300 k version 1 and 2, 370 k and 550 k BeadChips. We show that the proposed normalization strategy successfully removes asymmetry in estimates of both allelic proportions and copy numbers. Additionally, the normalization strategy reduces the technical variation for copy number estimates while retaining the response to copy number alterations. CONCLUSION: The proposed normalization strategy represents a valuable tool that improves the quality of data obtained from Illumina Infinium arrays, in particular when used for LOH and copy number variation studies.
Johan Staaf, Johan Vallon-Christersson, David Lindgren, Gunnar Juliusson, Richard Rosenquist, Mattias Höglund, Åke Borg, Markus Ringnér
BMC Bioinform.1
2007 Robust smooth segmentation approach for array CGH data analysis
abstract
MOTIVATION: Array comparative genomic hybridization (aCGH) provides a genome-wide technique to screen for copy number alteration. The existing segmentation approaches for analyzing aCGH data are based on modeling data as a series of discrete segments with unknown boundaries and unknown heights. Although the biological process of copy number alteration is discrete, in reality a variety of biological and experimental factors can cause the signal to deviate from a stepwise function. To take this into account, we propose a smooth segmentation (smoothseg) approach. METHODS: To achieve a robust segmentation, we use a doubly heavy-tailed random-effect model. The first heavy-tailed structure on the errors deals with outliers in the observations, and the second deals with possible jumps in the underlying pattern associated with different segments. We develop a fast and reliable computational procedure based on the iterative weighted least-squares algorithm with band-limited matrix inversion. RESULTS: Using simulated and real data sets, we demonstrate how smoothseg can aid in identification of regions with genomic alteration and in classification of samples. For the real data sets, smoothseg leads to smaller false discovery rate and classification error rate than the circular binary segmentation (CBS) algorithm. In a realistic simulation setting, smoothseg is better than wavelet smoothing and CBS in identification of regions with genomic alterations and better than CBS in classification of samples. For comparative analyses, we demonstrate that segmenting the t-statistics performs better than segmenting the data. AVAILABILITY: The R package smoothseg to perform smooth segmentation is available from http://www.meb.ki.se/~yudpaw.
Jian Huang 0005, Arief Gusnanto, Kathleen O'Sullivan, Johan Staaf, Åke Borg, Yudi Pawitan
Bioinform.4
2007 Continuous-index hidden Markov modelling of array CGH copy number data
abstract
MOTIVATION: In recent years, a range of techniques for analysis and segmentation of array comparative genomic hybridization (aCGH) data have been proposed. For array designs in which clones are of unequal lengths, are unevenly spaced or overlap, the discrete-index view typically adopted by such methods may be questionable or improved. RESULTS: We describe a continuous-index hidden Markov model for aCGH data as well as a Monte Carlo EM algorithm to estimate its parameters. It is shown that for a dataset from the BT-474 cell line analysed on 32K BAC tiling microarrays, this model yields considerably better model fit in terms of lag-1 residual autocorrelations compared to a discrete-index HMM, and it is also shown how to use the model for e.g. estimation of change points on the base-pair scale and for estimation of conditional state probabilities across the genome. In addition, the model is applied to the Glioblastoma Multiforme data used in the comparative study by Lai et al. (Lai,W.R. et al. (2005) Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data. Bioinformatics, 21, 3763-3370.) giving result similar to theirs but with certain features highlighted in the continuous-index setting.
Susann Stjernqvist, Tobias Rydén, Martin Sköld, Johan Staaf
Bioinform.4
2004 ACID: a database for microarray clone information
abstract
SUMMARY: Array Close Information Database is an online database for information about microarray cDNA clones. For each clone, the database contents include assigned UniGene cluster(s), location in the full-length transcript, assigned gene ontology terms and position in the genome assembly. AVAILABILITY: http://bioinfo.thep.lu.se/acid.html
Markus Ringnér, Srinivas Veerla, Samuel Andersson, Johan Staaf, Jari Häkkinen
Bioinform.4