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

Terence P. Speed

dblp:30/2771 · DBLP profile ↗
← Back
29ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-5403-7998ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 29 · 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
17 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.542019
Evaluation of cross-platform and interlaboratory concordance via consensus modelling of genomic measurements · Bioinform. 2019
A genotype calling algorithm for affymetrix SNP arrays · Bioinform. 2006
Low-level analyses of microarray data · RECOMB 2003
Bioinformatics and computational biology
transcriptomics
0.522019
DECENT: differential expression with capture efficiency adjustmeNT for single-cell RNA-seq data · Bioinform. 2019
FIRMA: a method for detection of alternative splicing from exon array data · Bioinform. 2008
Bioinformatics and computational biology › gene expression analysis
differential expression analysis
0.412019
DECENT: differential expression with capture efficiency adjustmeNT for single-cell RNA-seq data · Bioinform. 2019
Bioinformatics and computational biology › single-cell analysis › single-cell RNA sequencing
single-cell RNA-seq analysis
0.412019
DECENT: differential expression with capture efficiency adjustmeNT for single-cell RNA-seq data · Bioinform. 2019
Bioinformatics and computational biology › cancer genomics
copy number analysis
0.332009
A single-array preprocessing method for estimating full-resolution raw copy numbers from all Affymetrix genotyping arrays including GenomeWideSNP 5 & 6 · Bioinform. 2009
A single-sample method for normalizing and combining full-resolution copy numbers from multiple platforms, labs and analysis methods · Bioinform. 2009
Estimation and assessment of raw copy numbers at the single locus level · Bioinform. 2008
Bioinformatics and computational biology › statistical genetics › rare variant analysis
rare variant detection
0.112012
SRMA: an R package for resequencing array data analysis · Bioinform. 2012
Bioinformatics and computational biology › biological network › network biology
signaling network inference
0.112012
Bayesian Inference of Signaling Network Topology in a Cancer Cell Line · Bioinform. 2012
Bioinformatics and computational biology
cancer biology
0.112009
Sparse combinatorial inference with an application in cancer biology · Bioinform. 2009
Bioinformatics and computational biology › cancer genomics › copy number analysis
copy number estimation
0.112009
A single-array preprocessing method for estimating full-resolution raw copy numbers from all Affymetrix genotyping arrays including GenomeWideSNP 5 & 6 · Bioinform. 2009
Bioinformatics and computational biology › transcriptomics › alternative splicing analysis
alternative splicing detection
0.112008
FIRMA: a method for detection of alternative splicing from exon array data · Bioinform. 2008
Bioinformatics and computational biology › gene expression analysis › microarray data analysis
exon array analysis
0.112008
FIRMA: a method for detection of alternative splicing from exon array data · Bioinform. 2008
Bioinformatics and computational biology › statistical genetics
genotype calling
0.112006
A genotype calling algorithm for affymetrix SNP arrays · Bioinform. 2006
Bioinformatics and computational biology › gene expression analysis
microarray data analysis
0.122009
A single-array preprocessing method for estimating full-resolution raw copy numbers from all Affymetrix genotyping arrays including GenomeWideSNP 5 & 6 · Bioinform. 2009
A single-sample method for normalizing and combining full-resolution copy numbers from multiple platforms, labs and analysis methods · Bioinform. 2009
Bioinformatics and computational biology › sequence analysis › motif discovery
DNA motif discovery
0.012004
Finding short DNA motifs using permuted markov models · RECOMB 2004
Bioinformatics and computational biology
gene expression analysis
0.012004
A benchmark for Affymetrix GeneChip expression measures · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis › motif discovery
sequence motif discovery
0.012004
Finding short DNA motifs using permuted markov models · RECOMB 2004
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.012012
Bayesian Inference of Signaling Network Topology in a Cancer Cell Line · Bioinform. 2012
Bioinformatics and computational biology
DNA microarray
0.012003
Low-level analyses of microarray data · RECOMB 2003
Bioinformatics and computational biology › gene expression analysis › microarray data analysis
microarray gene expression analysis
0.012003
A comparison of normalization methods for high density oligonucleotide array data based on variance and bias · Bioinform. 2003
Bioinformatics and computational biology › gene expression analysis › microarray data preprocessing › probe-level analysis
probe signal normalization
0.012003
A comparison of normalization methods for high density oligonucleotide array data based on variance and bias · Bioinform. 2003
Bioinformatics and computational biology › protein structure prediction › protein structural motif prediction
coiled-coil domain prediction
0.012002
An HMM model for coiled-coil domains and a comparison with PSSM-based predictions · Bioinform. 2002
Bioinformatics and computational biology › protein structure analysis › protein domain identification
protein domain prediction
0.012002
An HMM model for coiled-coil domains and a comparison with PSSM-based predictions · Bioinform. 2002
Bioinformatics and computational biology
protein sequence analysis
0.012002
An HMM model for coiled-coil domains and a comparison with PSSM-based predictions · Bioinform. 2002
Bioinformatics and computational biology › statistical genetics
single nucleotide polymorphism analysis
0.012006
A genotype calling algorithm for affymetrix SNP arrays · Bioinform. 2006
Bioinformatics and computational biology
statistical genetics
0.012006
A genotype calling algorithm for affymetrix SNP arrays · Bioinform. 2006
Bioinformatics and computational biology › genomics
genome sequencing
0.011997
Variations on a theme of Lander and Waterman (abstract) · RECOMB 1997
Bioinformatics and computational biology › statistical genetics
haplotype analysis
0.011997
An algorithm for haplotype analysis · RECOMB 1997
Bioinformatics and computational biology
population genetics
0.011997
An algorithm for haplotype analysis · RECOMB 1997
Bioinformatics and computational biology › sequence analysis
position-specific scoring matrix
0.012002
An HMM model for coiled-coil domains and a comparison with PSSM-based predictions · Bioinform. 2002

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

statistical inference · 0.5row-linear model · 0.4consensus modelling · 0.4capture efficiency modeling · 0.4ASTM Standard E691 · 0.4variable selection · 0.1statistical algorithm · 0.1multi-array normalization · 0.1empirical bayes · 0.1dynamic bayesian network · 0.1
YearPublicationVenuePosition
2025 The current landscape and emerging challenges of benchmarking single-cell methods
abstract
With the rapid development of computational methods for single-cell sequencing data, benchmarking serves as a valuable resource. As the number of benchmarking studies surges, it is timely to assess the current state of the field. We conducted a systematic literature search and assessed 282 papers, including all 130 benchmark-only papers from the search and an additional 152 method development papers containing benchmarking. This collective effort provides the most comprehensive quantitative summary of the current landscape of single-cell benchmarking studies. We examine performances across nine broad categories, including often ignored aspects such as role of datasets, robustness of methods and downstream evaluation. Our analysis highlights challenges such as how to effectively combine knowledge across multiple benchmarking studies and in what ways can the community recognize the risk and prevent benchmarking fatigue. This paper highlights the importance of adopting a community-led research paradigm to tackle these challenges and establish best practice standards.
Lijia Yu, Marni Torkel, Yingxin Lin, Pengyi Yang, Terence P. Speed, Shila Ghazanfar, Jean Y. H. Yang
Briefings Bioinform.7
2020 Finding a suitable library size to call variants in RNA-Seq
abstract
BACKGROUND: RNA sequencing allows the study of both gene expression changes and transcribed mutations, providing a highly effective way to gain insight into cancer biology. When planning the sequencing of a large cohort of samples, library size is a fundamental factor affecting both the overall cost and the quality of the results. Here we specifically address how overall library size influences the detection of somatic mutations in RNA-seq data in two acute myeloid leukaemia datasets. RESULTS : We simulated shallower sequencing depths by downsampling 45 acute myeloid leukaemia samples (100 bp PE) that are part of the Leucegene project, which were originally sequenced at high depth. We compared the sensitivity of six methods of recovering validated mutations on the same samples. The methods compared are a combination of three popular callers (MuTect, VarScan, and VarDict) and two filtering strategies. We observed an incremental loss in sensitivity when simulating libraries of 80M, 50M, 40M, 30M and 20M fragments, with the largest loss detected with less than 30M fragments (below 90%, average loss of 7%). The sensitivity in recovering insertions and deletions varied markedly between callers, with VarDict showing the highest sensitivity (60%). Single nucleotide variant sensitivity is relatively consistent across methods, apart from MuTect, whose default filters need adjustment when using RNA-Seq. We also analysed 136 RNA-Seq samples from the TCGA-LAML cohort (50 bp PE) and assessed the change in sensitivity between the initial libraries (average 59M fragments) and after downsampling to 40M fragments. When considering single nucleotide variants in recurrently mutated myeloid genes we found a comparable performance, with a 6% average loss in sensitivity using 40M fragments. CONCLUSIONS: Between 30M and 40M 100 bp PE reads are needed to recover 90-95% of the initial variants on recurrently mutated myeloid genes. To extend this result to another cancer type, an exploration of the characteristics of its mutations and gene expression patterns is suggested.
Anna Quaglieri, Christoffer Flensburg, Terence P. Speed, Ian J. Majewski
BMC Bioinform.3
2019 Evaluation of cross-platform and interlaboratory concordance via consensus modelling of genomic measurements
abstract
MOTIVATION: A synoptic view of the human genome benefits chiefly from the application of nucleic acid sequencing and microarray technologies. These platforms allow interrogation of patterns such as gene expression and DNA methylation at the vast majority of canonical loci, allowing granular insights and opportunities for validation of original findings. However, problems arise when validating against a "gold standard" measurement, since this immediately biases all subsequent measurements towards that particular technology or protocol. Since all genomic measurements are estimates, in the absence of a "gold standard" we instead empirically assess the measurement precision and sensitivity of a large suite of genomic technologies via a consensus modelling method called the row-linear model. This method is an application of the American Society for Testing and Materials Standard E691 for assessing interlaboratory precision and sources of variability across multiple testing sites. Both cross-platform and cross-locus comparisons can be made across all common loci, allowing identification of technology- and locus-specific tendencies. RESULTS: We assess technologies including the Infinium MethylationEPIC BeadChip, whole genome bisulfite sequencing (WGBS), two different RNA-Seq protocols (PolyA+ and Ribo-Zero) and five different gene expression array platforms. Each technology thus is characterised herein, relative to the consensus. We showcase a number of applications of the row-linear model, including correlation with known interfering traits. We demonstrate a clear effect of cross-hybridisation on the sensitivity of Infinium methylation arrays. Additionally, we perform a true interlaboratory test on a set of samples interrogated on the same platform across twenty-one separate testing laboratories. AVAILABILITY AND IMPLEMENTATION: A full implementation of the row-linear model, plus extra functions for visualisation, are found in the R package consensus at https://github.com/timpeters82/consensus. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Timothy J. Peters, Hugh J. French, Stephen T. Bradford, Ruth Pidsley, Clare Stirzaker, Hilal Varinli, Shalima Nair, Wenjia Qu, Jenny Song, Katherine A. Giles, Aaron L. Statham, Helen Speirs, Terence P. Speed, Susan J. Clark
Bioinform.13
2019 DECENT: differential expression with capture efficiency adjustmeNT for single-cell RNA-seq data
abstract
MOTIVATION: Dropout is a common phenomenon in single-cell RNA-seq (scRNA-seq) data, and when left unaddressed it affects the validity of the statistical analyses. Despite this, few current methods for differential expression (DE) analysis of scRNA-seq data explicitly model the process that gives rise to the dropout events. We develop DECENT, a method for DE analysis of scRNA-seq data that explicitly and accurately models the molecule capture process in scRNA-seq experiments. RESULTS: We show that DECENT demonstrates improved DE performance over existing DE methods that do not explicitly model dropout. This improvement is consistently observed across several public scRNA-seq datasets generated using different technological platforms. The gain in improvement is especially large when the capture process is overdispersed. DECENT maintains type I error well while achieving better sensitivity. Its performance without spike-ins is almost as good as when spike-ins are used to calibrate the capture model. AVAILABILITY AND IMPLEMENTATION: The method is implemented as a publicly available R package available from https://github.com/cz-ye/DECENT. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Chengzhong Ye, Terence P. Speed, Agus Salim
Bioinform.2
2019 Maps of variability in cell lineage trees
abstract
New approaches to lineage tracking have allowed the study of differentiation in multicellular organisms over many generations of cells. Understanding the phenotypic variability observed in these lineage trees requires new statistical methods. Whereas an invariant cell lineage, such as that for the nematode Caenorhabditis elegans, can be described by a lineage map, defined as the pattern of phenotypes overlaid onto the binary tree, a traditional lineage map is static and does not describe the variability inherent in the cell lineages of higher organisms. Here, we introduce lineage variability maps which describe the pattern of second-order variation in lineage trees. These maps can be undirected graphs of the partial correlations between every lineal position, or directed graphs showing the dynamics of bifurcated patterns in each subtree. We show how to infer these graphical models for lineages of any depth from sample sizes of only a few pedigrees. This required developing the generalized spectral analysis for a binary tree, the natural framework for describing tree-structured variation. When tested on pedigrees from C. elegans expressing a marker for pharyngeal differentiation potential, the variability maps recover essential features of the known lineage map. When applied to highly-variable pedigrees monitoring cell size in T lymphocytes, the maps show that most of the phenotype is set by the founder naive T cell. Lineage variability maps thus elevate the concept of the lineage map to the population level, addressing questions about the potency and dynamics of cell lineages and providing a way to quantify the progressive restriction of cell fate with increasing depth in the tree.
Damien G. Hicks, Terence P. Speed, Mohammed Yassin, Sarah M. Russell
PLoS Comput. Biol.2
2015 Systematic noise degrades gene co-expression signals but can be corrected
abstract
BACKGROUND: In the past decade, the identification of gene co-expression has become a routine part of the analysis of high-dimensional microarray data. Gene co-expression, which is mostly detected via the Pearson correlation coefficient, has played an important role in the discovery of molecular pathways and networks. Unfortunately, the presence of systematic noise in high-dimensional microarray datasets corrupts estimates of gene co-expression. Removing systematic noise from microarray data is therefore crucial. Many cleaning approaches for microarray data exist, however these methods are aimed towards improving differential expression analysis and their performances have been primarily tested for this application. To our knowledge, the performances of these approaches have never been systematically compared in the context of gene co-expression estimation. RESULTS: Using simulations we demonstrate that standard cleaning procedures, such as background correction and quantile normalization, fail to adequately remove systematic noise that affects gene co-expression and at times further degrade true gene co-expression. Instead we show that a global version of removal of unwanted variation (RUV), a data-driven approach, removes systematic noise but also allows the estimation of the true underlying gene-gene correlations. We compare the performance of all noise removal methods when applied to five large published datasets on gene expression in the human brain. RUV retrieves the highest gene co-expression values for sets of genes known to interact, but also provides the greatest consistency across all five datasets. We apply the method to prioritize epileptic encephalopathy candidate genes. CONCLUSIONS: Our work raises serious concerns about the quality of many published gene co-expression analyses. RUV provides an efficient and flexible way to remove systematic noise from high-dimensional microarray datasets when the objective is gene co-expression analysis. The RUV method as applicable in the context of gene-gene correlation estimation is available as a BioconductoR-package: RUVcorr.
Saskia Freytag, Johann Gagnon-Bartsch, Terence P. Speed, Melanie Bahlo
BMC Bioinform.3
2014 Combining calls from multiple somatic mutation-callers
abstract
BACKGROUND: Accurate somatic mutation-calling is essential for insightful mutation analyses in cancer studies. Several mutation-callers are publicly available and more are likely to appear. Nonetheless, mutation-calling is still challenging and there is unlikely to be one established caller that systematically outperforms all others. Therefore, fully utilizing multiple callers can be a powerful way to construct a list of final calls for one's research. RESULTS: Using a set of mutations from multiple callers that are impartially validated, we present a statistical approach for building a combined caller, which can be applied to combine calls in a wider dataset generated using a similar protocol. Using the mutation outputs and the validation data from The Cancer Genome Atlas endometrial study (6,746 sites), we demonstrate how to build a statistical model that predicts the probability of each call being a somatic mutation, based on the detection status of multiple callers and a few associated features. CONCLUSION: The approach allows us to build a combined caller across the full range of stringency levels, which outperforms all of the individual callers.
Su Yeon Kim, Laurent Jacob, Terence P. Speed
BMC Bioinform.3
2013 Comparing somatic mutation-callers: Beyond Venn diagrams
abstract
BACKGROUND: Somatic mutation-calling based on DNA from matched tumor-normal patient samples is one of the key tasks carried by many cancer genome projects. One such large-scale project is The Cancer Genome Atlas (TCGA), which is now routinely compiling catalogs of somatic mutations from hundreds of paired tumor-normal DNA exome-sequence data. Nonetheless, mutation calling is still very challenging. TCGA benchmark studies revealed that even relatively recent mutation callers from major centers showed substantial discrepancies. Evaluation of the mutation callers or understanding the sources of discrepancies is not straightforward, since for most tumor studies, validation data based on independent whole-exome DNA sequencing is not available, only partial validation data for a selected (ascertained) subset of sites. RESULTS: To provide guidelines to comparing outputs from multiple callers, we have analyzed two sets of mutation-calling data from the TCGA benchmark studies and their partial validation data. Various aspects of the mutation-calling outputs were explored to characterize the discrepancies in detail. To assess the performances of multiple callers, we introduce four approaches utilizing the external sequence data to varying degrees, ranging from having independent DNA-seq pairs, RNA-seq for tumor samples only, the original exome-seq pairs only, or none of those. CONCLUSIONS: Our analyses provide guidelines to visualizing and understanding the discrepancies among the outputs from multiple callers. Furthermore, applying the four evaluation approaches to the whole exome data, we illustrate the challenges and highlight the various circumstances that require extra caution in assessing the performances of multiple callers.
Su Yeon Kim, Terence P. Speed
BMC Bioinform.2
2012 Bayesian Inference of Signaling Network Topology in a Cancer Cell Line
abstract
MOTIVATION: Protein signaling networks play a key role in cellular function, and their dysregulation is central to many diseases, including cancer. To shed light on signaling network topology in specific contexts, such as cancer, requires interrogation of multiple proteins through time and statistical approaches to make inferences regarding network structure. RESULTS: In this study, we use dynamic Bayesian networks to make inferences regarding network structure and thereby generate testable hypotheses. We incorporate existing biology using informative network priors, weighted objectively by an empirical Bayes approach, and exploit a connection between variable selection and network inference to enable exact calculation of posterior probabilities of interest. The approach is computationally efficient and essentially free of user-set tuning parameters. Results on data where the true, underlying network is known place the approach favorably relative to existing approaches. We apply these methods to reverse-phase protein array time-course data from a breast cancer cell line (MDA-MB-468) to predict signaling links that we independently validate using targeted inhibition. The methods proposed offer a general approach by which to elucidate molecular networks specific to biological context, including, but not limited to, human cancers. AVAILABILITY: http://mukherjeelab.nki.nl/DBN (code and data).
Steven M. Hill, Yiling Lu, Jennifer Molina, Laura Heiser, Paul T. Spellman, Terence P. Speed, Joe W. Gray, Gordon B. Mills, Sach Mukherjee
Bioinform.6
2012 SRMA: an R package for resequencing array data analysis
abstract
UNLABELLED: Sequencing by hybridization to oligonucleotides has evolved into an inexpensive, reliable and fast technology for targeted sequencing. Hundreds of human genes can now be sequenced within a day using a single hybridization to a resequencing microarray. However, several issues inherent to these arrays (e.g. cross-hybridization, variable probe/target affinity) cause sequencing errors and have prevented more widespread applications. We developed an R package for resequencing microarray data analysis that integrates a novel statistical algorithm, sequence robust multi-array analysis (SRMA), for rare variant detection with high sensitivity (false negative rate, FNR 5%) and accuracy (false positive rate, FPR 1×10⁻⁵). The SRMA package consists of five modules for quality control, data normalization, single array analysis, multi-array analysis and output analysis. The entire workflow is efficient and identifies rare DNA single nucleotide variations and structural changes such as gene deletions with high accuracy and sensitivity. AVAILABILITY: http://cran.r-project.org/, http://odin.mdacc.tmc.edu/~wwang7/SRMAIndex.html
Nianxiang Zhang, Martin O'Hely, Terence P. Speed, Curt Scharfe, Wenyi Wang 0001
Bioinform.4
2011 An integrative bioinformatic predictor of protein sub-cellular localisation in malaria
abstract
Background The malarial parasite Plasmodium falciparum remains a leading international cause of mortality, with almost a million deaths each year. Determination of protein subcellular localisation remains a challenge in Plasmodium parasites due to their evolutionary distance from wellstudied model organisms, and limited efficiency of appropriate molecular tools. However, abundant large scale systems biology information exist for several Plasmodium species as well as other apicomplexan parasites, including full genomic DNA sequences, plus data sets relating to the transcriptome, protein expression and interactions, polymorphisms and phyletic profiles. To date, most bioinformatic predictors of sub-cellular localisation use sequence information exclusively without consideration for other data sets.
Ben J. Woodcroft, Robert Radloff, Lee M. Yeoh, Kristie-Lee Scanlon, Maria A. Doyle, Giel G. van Dooren, Geoffrey I. McFadden, Christopher J. Tonkin, Terence P. Speed, Stuart A. Ralph
BMC Bioinform.9
2010 TumorBoost: Normalization of allele-specific tumor copy numbers from a single pair of tumor-normal genotyping microarrays
abstract
BACKGROUND: High-throughput genotyping microarrays assess both total DNA copy number and allelic composition, which makes them a tool of choice for copy number studies in cancer, including total copy number and loss of heterozygosity (LOH) analyses. Even after state of the art preprocessing methods, allelic signal estimates from genotyping arrays still suffer from systematic effects that make them difficult to use effectively for such downstream analyses. RESULTS: We propose a method, TumorBoost, for normalizing allelic estimates of one tumor sample based on estimates from a single matched normal. The method applies to any paired tumor-normal estimates from any microarray-based technology, combined with any preprocessing method. We demonstrate that it increases the signal-to-noise ratio of allelic signals, making it significantly easier to detect allelic imbalances. CONCLUSIONS: TumorBoost increases the power to detect somatic copy-number events (including copy-neutral LOH) in the tumor from allelic signals of Affymetrix or Illumina origin. We also conclude that high-precision allelic estimates can be obtained from a single pair of tumor-normal hybridizations, if TumorBoost is combined with single-array preprocessing methods such as (allele-specific) CRMA v2 for Affymetrix or BeadStudio's (proprietary) XY-normalization method for Illumina. A bounded-memory implementation is available in the open-source and cross-platform R package aroma.cn, which is part of the Aroma Project (http://www.aroma-project.org/).
Henrik Bengtsson, Pierre Neuvial, Terence P. Speed
BMC Bioinform.3
2009 A single-sample method for normalizing and combining full-resolution copy numbers from multiple platforms, labs and analysis methods
abstract
MOTIVATION: The rapid expansion of whole-genome copy number (CN) studies brings a demand for increased precision and resolution of CN estimates. Recent studies have obtained CN estimates from more than one platform for the same set of samples, and it is natural to want to combine the different estimates in order to meet this demand. Estimates from different platforms show different degrees of attenuation of the true CN changes. Similar differences can be observed in CNs from the same platform run in different labs, or in the same lab, with different analytical methods. This is the reason why it is not straightforward to combine CN estimates from different sources (platforms, labs and analysis methods). RESULTS: We propose a single-sample multi source normalization that brings full-resolution CN estimates to the same scale across sources. The normalized CNs are such that for any underlying CN level, their mean level is the same regardless of the source, which make them better suited for being combined across sources, e.g. existing segmentation methods may be used to identify aberrant regions. We use microarray-based CN estimates from 'The Cancer Genome Atlas' (TCGA) project to illustrate and validate the method. We show that the normalized and combined data better separate two CN states at a given resolution. We conclude that it is possible to combine CNs from multiple sources such that the resolution becomes effectively larger, and when multiple platforms are combined, they also enhance the genome coverage by complementing each other in different regions. AVAILABILITY: A bounded-memory implementation is available in aroma.cn.
Henrik Bengtsson, Amrita Ray, Paul T. Spellman, Terence P. Speed
Bioinform.4
2009 A single-array preprocessing method for estimating full-resolution raw copy numbers from all Affymetrix genotyping arrays including GenomeWideSNP 5 & 6
abstract
MOTIVATION: High-resolution copy-number (CN) analysis has in recent years gained much attention, not only for the purpose of identifying CN aberrations associated with a certain phenotype, but also for identifying CN polymorphisms. In order for such studies to be successful and cost effective, the statistical methods have to be optimized. We propose a single-array preprocessing method for estimating full-resolution total CNs. It is applicable to all Affymetrix genotyping arrays, including the recent ones that also contain non-polymorphic probes. A reference signal is only needed at the last step when calculating relative CNs. RESULTS: As with our method for earlier generations of arrays, this one controls for allelic crosstalk, probe affinities and PCR fragment-length effects. Additionally, it also corrects for probe sequence effects and co-hybridization of fragments digested by multiple enzymes that takes place on the latest chips. We compare our method with Affymetrix's CN5 method and the dChip method by assessing how well they differentiate between various CN states at the full resolution and various amounts of smoothing. Although CRMA v2 is a single-array method, we observe that it performs as well as or better than alternative methods that use data from all arrays for their preprocessing. This shows that it is possible to do online analysis in large-scale projects where additional arrays are introduced over time.
Henrik Bengtsson, Pratyaksha Wirapati, Terence P. Speed
Bioinform.3
2009 Sparse combinatorial inference with an application in cancer biology
abstract
MOTIVATION: Combinatorial effects, in which several variables jointly influence an output or response, play an important role in biological systems. In many settings, Boolean functions provide a natural way to describe such influences. However, biochemical data using which we may wish to characterize such influences are usually subject to much variability. Furthermore, in high-throughput biological settings Boolean relationships of interest are very often sparse, in the sense of being embedded in an overall dataset of higher dimensionality. This motivates a need for statistical methods capable of making inferences regarding Boolean functions under conditions of noise and sparsity. RESULTS: We put forward a statistical model for sparse, noisy Boolean functions and methods for inference under the model. We focus on the case in which the form of the underlying Boolean function, as well as the number and identity of its inputs are all unknown. We present results on synthetic data and on a study of signalling proteins in cancer biology.
Sach Mukherjee, Steven Pelech, Richard M. Neve, Wen-Lin Kuo, Safiyyah Ziyad, Paul T. Spellman, Joe W. Gray, Terence P. Speed
Bioinform.8
2009 Differential splicing using whole-transcript microarrays
abstract
BACKGROUND: The latest generation of Affymetrix microarrays are designed to interrogate expression over the entire length of every locus, thus giving the opportunity to study alternative splicing genome-wide. The Exon 1.0 ST (sense target) platform, with versions for Human, Mouse and Rat, is designed primarily to probe every known or predicted exon. The smaller Gene 1.0 ST array is designed as an expression microarray but still interrogates expression with probes along the full length of each well-characterized transcript. We explore the possibility of using the Gene 1.0 ST platform to identify differential splicing events. RESULTS: We propose a strategy to score differential splicing by using the auxiliary information from fitting the statistical model, RMA (robust multichip analysis). RMA partitions the probe-level data into probe effects and expression levels, operating robustly so that if a small number of probes behave differently than the rest, they are downweighted in the fitting step. We argue that adjacent poorly fitting probes for a given sample can be evidence of differential splicing and have designed a statistic to search for this behaviour. Using a public tissue panel dataset, we show many examples of tissue-specific alternative splicing. Furthermore, we show that evidence for putative alternative splicing has a strong correspondence between the Gene 1.0 ST and Exon 1.0 ST platforms. CONCLUSION: We propose a new approach, FIRMAGene, to search for differentially spliced genes using the Gene 1.0 ST platform. Such an analysis complements the search for differential expression. We validate the method by illustrating several known examples and we note some of the challenges in interpreting the probe-level data.Software implementing our methods is freely available as an R package.
Mark D. Robinson, Terence P. Speed
BMC Bioinform.2
2008 Estimation and assessment of raw copy numbers at the single locus level
abstract
MOTIVATION: Although copy-number aberrations are known to contribute to the diversity of the human DNA and cause various diseases, many aberrations and their phenotypes are still to be explored. The recent development of single-nucleotide polymorphism (SNP) arrays provides researchers with tools for calling genotypes and identifying chromosomal aberrations at an order-of-magnitude greater resolution than possible a few years ago. The fundamental problem in array-based copy-number (CN) analysis is to obtain CN estimates at a single-locus resolution with high accuracy and precision such that downstream segmentation methods are more likely to succeed. RESULTS: We propose a preprocessing method for estimating raw CNs from Affymetrix SNP arrays. Its core utilizes a multichip probe-level model analogous to that for high-density oligonucleotide expression arrays. We extend this model by adding an adjustment for sequence-specific allelic imbalances such as cross-hybridization between allele A and allele B probes. We focus on total CN estimates, which allows us to further constrain the probe-level model to increase the signal-to-noise ratio of CN estimates. Further improvement is obtained by controlling for PCR effects. Each part of the model is fitted robustly. The performance is assessed by quantifying how well raw CNs alone differentiate between one and two copies on Chromosome X (ChrX) at a single-locus resolution (27kb) up to a 200kb resolution. The evaluation is done with publicly available HapMap data. AVAILABILITY: The proposed method is available as part of an open-source R package named aroma.affymetrix. Because it is a bounded-memory algorithm, any number of arrays can be analyzed.
Henrik Bengtsson, Rafael A. Irizarry, Benilton S. Carvalho, Terence P. Speed
Bioinform.4
2008 FIRMA: a method for detection of alternative splicing from exon array data
abstract
MOTIVATION: Analyses of EST data show that alternative splicing is much more widespread than once thought. The advent of exon and tiling microarrays means that researchers now have the capacity to experimentally measure alternative splicing on a genome wide level. New methods are needed to analyze the data from these arrays. RESULTS: We present a method, finding isoforms using robust multichip analysis (FIRMA), for detecting differential alternative splicing in exon array data. FIRMA has been developed for Affymetrix exon arrays, but could in principle be extended to other exon arrays, tiling arrays or splice junction arrays. We have evaluated the method using simulated data, and have also applied it to two datasets: a panel of 11 human tissues and a set of 10 pairs of matched normal and tumor colon tissue. FIRMA is able to detect exons in several genes confirmed by reverse transcriptase PCR. AVAILABILITY: R code implementing our methods is contributed to the package aroma.affymetrix.
E. Purdom, Ken M. Simpson, Mark D. Robinson, J. G. Conboy, A. V. Lapuk, Terence P. Speed
Bioinform.6
2007 A comparison of Affymetrix gene expression arrays
abstract
BACKGROUND: Affymetrix GeneChips are an important tool in many facets of biological research. Recently, notable design changes to the chips have been made. In this study, we use publicly available data from Affymetrix to gauge the performance of three human gene expression arrays: Human Genome U133 Plus 2.0 (U133), Human Exon 1.0 ST (HuEx) and Human Gene 1.0 ST (HuGene). RESULTS: We studied probe-, exon- and gene-level reproducibility of technical and biological replicates from each of the 3 platforms. The U133 array has larger feature sizes so it is no surprise that probe-level variances are smaller, however the larger number of probes per gene on the HuGene array seems to produce gene-level summaries that have similar variances. The gene-level summaries of the HuEx array are less reproducible than the other two, despite having the largest average number of probes per gene. Greater than 80% of the content on the HuEx arrays is expressed at or near background. Biological variation seems to have a smaller effect on U133 data. Comparing the overlap of differentially expressed genes, we see a high overall concordance among all 3 platforms, with HuEx and HuGene having greater overlap, as expected given their design. We performed an analysis of detection rates and area under ROC curves using an experiment made up of several mixtures of 2 human tissues. Though it appears that the HuEx array has worse performance in terms of detection rates, all arrays have similar ability to separate differentially expressed and non-differentially expressed genes. CONCLUSION: Despite noticeable differences in the probe-level reproducibility, gene-level reproducibility and differential expression detection are quite similar across the three platforms. The HuEx array, an all-encompassing array, has the flexibility of measuring all known or predicted exonic content. However, the HuEx array induces poorer reproducibility for genes with fewer exons. The HuGene measures just the well-annotated genome content and appears to perform well. The U133 array, though not able to measure across the full length of a transcript, appears to perform as well as the newer designs on the set of genes common to all 3 platforms.
Mark D. Robinson, Terence P. Speed
BMC Bioinform.2
2007 A dynamic programming approach for the alignment of signal peaks in multiple gas chromatography-mass spectrometry experiments
abstract
BACKGROUND: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples are profiled, including replicates of the same sample and/or different sample states, one needs to account for retention time drifts between experiments. This can be achieved either by the alignment of chromatographic profiles prior to peak detection, or by matching signal peaks after they have been extracted from chromatogram data matrices. Automated retention time correction is particularly important in non-targeted profiling studies. RESULTS: A new approach for matching signal peaks based on dynamic programming is presented. The proposed approach relies on both peak retention times and mass spectra. The alignment of more than two peak lists involves three steps: (1) all possible pairs of peak lists are aligned, and similarity of each pair of peak lists is estimated; (2) the guide tree is built based on the similarity between the peak lists; (3) peak lists are progressively aligned starting with the two most similar peak lists, following the guide tree until all peak lists are exhausted. When two or more experiments are performed on different sample states and each consisting of multiple replicates, peak lists within each set of replicate experiments are aligned first (within-state alignment), and subsequently the resulting alignments are aligned themselves (between-state alignment). When more than two sets of replicate experiments are present, the between-state alignment also employs the guide tree. We demonstrate the usefulness of this approach on GC-MS metabolic profiling experiments acquired on wild-type and mutant Leishmania mexicana parasites. CONCLUSION: We propose a progressive method to match signal peaks across multiple GC-MS experiments based on dynamic programming. A sensitive peak similarity function is proposed to balance peak retention time and peak mass spectra similarities. This approach can produce the optimal alignment between an arbitrary number of peak lists, and models explicitly within-state and between-state peak alignment. The accuracy of the proposed method was close to the accuracy of manually-curated peak matching, which required tens of man-hours for the analyzed data sets. The proposed approach may offer significant advantages for processing of high-throughput metabolomics data, especially when large numbers of experimental replicates and multiple sample states are analyzed.
Mark D. Robinson, David P. De Souza, Woon Wai Keen, Eleanor C. Saunders, Malcolm J. McConville, Terence P. Speed, Vladimir A. Likic
BMC Bioinform.6
2006 A genotype calling algorithm for affymetrix SNP arrays
abstract
Abstract Motivation: A classification algorithm, based on a multi-chip, multi-SNP approach is proposed for Affymetrix SNP arrays. Current procedures for calling genotypes on SNP arrays process all the features associated with one chip and one SNP at a time. Using a large training sample where the genotype labels are known, we develop a supervised learning algorithm to obtain more accurate classification results on new data. The method we propose, RLMM, is based on a robustly fitted, linear model and uses the Mahalanobis distance for classification. The chip-to-chip non-biological variance is reduced through normalization. This model-based algorithm captures the similarities across genotype groups and probes, as well as across thousands of SNPs for accurate classification. In this paper, we apply RLMM to Affymetrix 100 K SNP array data, present classification results and compare them with genotype calls obtained from the Affymetrix procedure DM, as well as to the publicly available genotype calls from the HapMap project. Availability: The RLMM software is implemented in R and is available from Bioconductor or from the first author at [email protected]. Contact: [email protected] Supplementary information:
Nusrat Rabbee, Terence P. Speed
Bioinform.2
2004 Finding short DNA motifs using permuted markov models
abstract
Many short DNA motifs such as transcription factor binding sites (TFBS) and splice sites exhibit strong local as well as non-local dependence. We introduce permuted variable length Markov models (PVLMM) which could capture the potentially important dependencies among positions, and apply them to the problem of detecting splice and TFB sites. They have been satisfactory from the viewpoint of prediction performance, and also give ready biological interpretations of the sequence dependence observed. The issue of model selection is also studied.
Xiaoyue Zhao, Terence P. Speed
RECOMB3
2004 A benchmark for Affymetrix GeneChip expression measures
abstract
Abstract Motivation: The defining feature of oligonucleotide expression arrays is the use of several probes to assay each targeted transcript. This is a bonanza for the statistical geneticist, who can create probeset summaries with specific characteristics. There are now several methods available for summarizing probe level data from the popular Affymetrix GeneChips, but it is difficult to identify the best method for a given inquiry. Results: We have developed a graphical tool to evaluate summaries of Affymetrix probe level data. Plots and summary statistics offer a picture of how an expression measure performs in several important areas. This picture facilitates the comparison of competing expression measures and the selection of methods suitable for a specific investigation. The key is a benchmark data set consisting of a dilution study and a spike-in study. Because the truth is known for these data, we can identify statistical features of the data for which the expected outcome is known in advance. Those features highlighted in our suite of graphs are justified by questions of biological interest and motivated by the presence of appropriate data. Availability: In conjunction with the release of a graphics toolbox as part of the Bioconductor project (http://www.bioconductor.org), a webtool is available at http://affycomp.biostat.jhsph.edu. Supplemental material is available at http://www.biostat.jhsph.edu/~ririzarr/papers/suppaffycomp.pdf
Leslie Cope, Rafael A. Irizarry, Harris A. Jaffee, Zhijin Wu, Terence P. Speed
Bioinform.5
2003 Low-level analyses of microarray data
abstract
No abstract available.
Terence P. Speed
RECOMB1
2003 A comparison of normalization methods for high density oligonucleotide array data based on variance and bias
abstract
MOTIVATION: When running experiments that involve multiple high density oligonucleotide arrays, it is important to remove sources of variation between arrays of non-biological origin. Normalization is a process for reducing this variation. It is common to see non-linear relations between arrays and the standard normalization provided by Affymetrix does not perform well in these situations. RESULTS: We present three methods of performing normalization at the probe intensity level. These methods are called complete data methods because they make use of data from all arrays in an experiment to form the normalizing relation. These algorithms are compared to two methods that make use of a baseline array: a one number scaling based algorithm and a method that uses a non-linear normalizing relation by comparing the variability and bias of an expression measure. Two publicly available datasets are used to carry out the comparisons. The simplest and quickest complete data method is found to perform favorably. AVAILABILITY: Software implementing all three of the complete data normalization methods is available as part of the R package Affy, which is a part of the Bioconductor project http://www.bioconductor.org. SUPPLEMENTARY INFORMATION: Additional figures may be found at http://www.stat.berkeley.edu/~bolstad/normalize/index.html
Benjamin M. Bolstad, Rafael A. Irizarry, Magnus Åstrand, Terence P. Speed
Bioinform.4
2002 An HMM model for coiled-coil domains and a comparison with PSSM-based predictions
abstract
MOTIVATION: Large-scale sequence data require methods for the automated annotation of protein domains. Many of the predictive methods are based either on a Position Specific Scoring Matrix (PSSM) of fixed length or on a window-less Hidden Markov Model (HMM). The performance of the two approaches is tested for Coiled-Coil Domains (CCDs). The prediction of CCDs is used frequently, and its optimization seems worthwhile. RESULTS: We have conceived MARCOIL, an HMM for the recognition of proteins with a CCD on a genomic scale. A cross-validated study suggests that MARCOIL improves predictions compared to the traditional PSSM algorithm, especially for some protein families and for short CCDs. The study was designed to reveal differences inherent in the two methods. Potential confounding factors such as differences in the dimension of parameter space and in the parameter values were avoided by using the same amino acid propensities and by keeping the transition probabilities of the HMM constant during cross-validation. AVAILABILTY: The prediction program and the databases are available at http://www.wehi.edu.au/bioweb/Mauro/Marcoil
Mauro Delorenzi, Terence P. Speed
Bioinform.2
2001 Analysis of CDNA Microarray Images
abstract
Microarrays are part of a new class of biotechnologies that allow the monitoring of expression levels for thousands of genes simultaneously. Image analysis is an important aspect of microarray experiments, one that can have a potentially large impact on subsequent analyses, such as clustering or the identification of differentially expressed genes. This paper reviews a number of existing image analysis methods used on cDNA microarray data. In particular, it describes and discusses the different segmentation and background adjustment methods. It was found that in some cases background adjustment can substantially reduce the precision--that is, increase the variability of low-intensity spot values. In contrast, the choice of segmentation procedure seems to have a smaller impact.
Jean Y. H. Yang, Michael J. Buckley, Terence P. Speed
Briefings Bioinform.3
1997 An algorithm for haplotype analysis
abstract
This paper proposes an algorithm for haplotype analysis based on a Monte Carlo method.Hap lotype configurations are generated according to the distribution of joint haplotypes of individuals in a pedigree given their phenotype data, via a Markov chain Monte Carlo algorithm.The hap lotype configuration which maximizes this conditional probability distribution can thus be estimated.In addition, the set of haplotype configurations with relatively high probabilities can also be estimated as possible alternatives to the most probable one.This flexibility enables geneticists to choose the haplotype configurations which are most reasonable to them, allowing them to include their knowledge of the data under analysis.
Shili Lin, Terence P. Speed
RECOMB2
1997 Variations on a theme of Lander and Waterman (abstract)
abstract
No abstract available.
Terence P. Speed
RECOMB1