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.

Kevin P. White

dblp:86/3260 · DBLP profile ↗
← Back
12ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0001-6934-5793ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 11Systems, architecture and hardware · 1

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
4 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 56% Storage systems · 44%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
gene expression analysis
0.222014
RNA-seq differential expression studies: more sequence or more replication? · Bioinform. 2014
Discovering transcription factor regulatory targets using gene expression and binding data · Bioinform. 2012
Bioinformatics and computational biology › gene expression analysis
differential expression analysis
0.212014
RNA-seq differential expression studies: more sequence or more replication? · Bioinform. 2014
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.112012
Discovering transcription factor regulatory targets using gene expression and binding data · Bioinform. 2012
Bioinformatics and computational biology › gene regulation › transcription factor analysis
transcription factor target identification
0.112012
Discovering transcription factor regulatory targets using gene expression and binding data · Bioinform. 2012
Storage systems
data management
0.112010
An overview of the Open Science Data Cloud · HPDC 2010
Bioinformatics and computational biology › network bioinformatics › biological network analysis
biological network inference
0.012004
Probabilistic inference of molecular networks from noisy data sources · Bioinform. 2004
Bioinformatics and computational biology
protein-protein interaction prediction
0.012004
Probabilistic inference of molecular networks from noisy data sources · Bioinform. 2004
Bioinformatics and computational biology › epigenomics › ChIP-seq analysis
ChIP-seq data integration
0.012012
Discovering transcription factor regulatory targets using gene expression and binding data · Bioinform. 2012
Cloud and datacenter computing › cloud deployment model
distributed cloud
0.012010
An overview of the Open Science Data Cloud · HPDC 2010
Visualization and visual analytics › biological data visualization
genome browser
0.012009
Flynet: a genomic resource for Drosophila melanogaster transcriptional regulatory networks · Bioinform. 2009

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

chromatin immunoprecipitation analysis · 0.2cost-effectiveness metric · 0.2unsupervised machine learning · 0.1expectation-maximization · 0.1yeast two-hybrid · 0.0probabilistic model · 0.0literature mining · 0.0
YearPublicationVenuePosition
2020 DRAMS: A tool to detect and re-align mixed-up samples for integrative studies of multi-omics data
abstract
Studies of complex disorders benefit from integrative analyses of multiple omics data. Yet, sample mix-ups frequently occur in multi-omics studies, weakening statistical power and risking false findings. Accurately aligning sample information, genotype, and corresponding omics data is critical for integrative analyses. We developed DRAMS (https://github.com/Yi-Jiang/DRAMS) to Detect and Re-Align Mixed-up Samples to address the sample mix-up problem. It uses a logistic regression model followed by a modified topological sorting algorithm to identify the potential true IDs based on data relationships of multi-omics. According to tests using simulated data, the more types of omics data used or the smaller the proportion of mix-ups, the better that DRAMS performs. Applying DRAMS to real data from the PsychENCODE BrainGVEX project, we detected and corrected 201 (12.5% of total data generated) mix-ups. Of the 21 mix-ups involving errors of racial identity, DRAMS re-assigned all data to the correct racial group in the 1000 Genomes project. In doing so, quantitative trait loci (QTL) (FDR<0.01) increased by an average of 1.62-fold. The use of DRAMS in multi-omics studies will strengthen statistical power of the study and improve quality of the results. Even though very limited studies have multi-omics data in place, we expect such data will increase quickly with the needs of DRAMS.
Gina Giase, Kay Grennan, Annie W. Shieh, Lide Han, Quan Wang 0004, Rui Chen 0021, Kevin P. White, Chao Chen 0041, Bingshan Li, Chunyu Liu 0001
PLoS Comput. Biol.11
2014 RNA-seq differential expression studies: more sequence or more replication?
abstract
MOTIVATION: RNA-seq is replacing microarrays as the primary tool for gene expression studies. Many RNA-seq studies have used insufficient biological replicates, resulting in low statistical power and inefficient use of sequencing resources. RESULTS: We show the explicit trade-off between more biological replicates and deeper sequencing in increasing power to detect differentially expressed (DE) genes. In the human cell line MCF7, adding more sequencing depth after 10 M reads gives diminishing returns on power to detect DE genes, whereas adding biological replicates improves power significantly regardless of sequencing depth. We also propose a cost-effectiveness metric for guiding the design of large-scale RNA-seq DE studies. Our analysis showed that sequencing less reads and performing more biological replication is an effective strategy to increase power and accuracy in large-scale differential expression RNA-seq studies, and provided new insights into efficient experiment design of RNA-seq studies. AVAILABILITY AND IMPLEMENTATION: The code used in this paper is provided on: http://home.uchicago.edu/∼jiezhou/replication/. The expression data is deposited in the Gene Expression Omnibus under the accession ID GSE51403.
Kevin P. White
Bioinform.3
2014 Bionimbus: a cloud for managing, analyzing and sharing large genomics datasets
abstract
BACKGROUND: As large genomics and phenotypic datasets are becoming more common, it is increasingly difficult for most researchers to access, manage, and analyze them. One possible approach is to provide the research community with several petabyte-scale cloud-based computing platforms containing these data, along with tools and resources to analyze it. METHODS: Bionimbus is an open source cloud-computing platform that is based primarily upon OpenStack, which manages on-demand virtual machines that provide the required computational resources, and GlusterFS, which is a high-performance clustered file system. Bionimbus also includes Tukey, which is a portal, and associated middleware that provides a single entry point and a single sign on for the various Bionimbus resources; and Yates, which automates the installation, configuration, and maintenance of the software infrastructure required. RESULTS: Bionimbus is used by a variety of projects to process genomics and phenotypic data. For example, it is used by an acute myeloid leukemia resequencing project at the University of Chicago. The project requires several computational pipelines, including pipelines for quality control, alignment, variant calling, and annotation. For each sample, the alignment step requires eight CPUs for about 12 h. BAM file sizes ranged from 5 GB to 10 GB for each sample. CONCLUSIONS: Most members of the research community have difficulty downloading large genomics datasets and obtaining sufficient storage and computer resources to manage and analyze the data. Cloud computing platforms, such as Bionimbus, with data commons that contain large genomics datasets, are one choice for broadening access to research data in genomics.
Allison P. Heath, Matthew Greenway, Ray Powell, Jonathan Spring, Rafael D. Suarez, David Hanley, Chai Bandlamudi, Megan E. McNerney, Kevin P. White, Robert L. Grossman
J. Am. Medical Informatics Assoc.9
2012 Discovering transcription factor regulatory targets using gene expression and binding data
abstract
MOTIVATION: Identifying the target genes regulated by transcription factors (TFs) is the most basic step in understanding gene regulation. Recent advances in high-throughput sequencing technology, together with chromatin immunoprecipitation (ChIP), enable mapping TF binding sites genome wide, but it is not possible to infer function from binding alone. This is especially true in mammalian systems, where regulation often occurs through long-range enhancers in gene-rich neighborhoods, rather than proximal promoters, preventing straightforward assignment of a binding site to a target gene. RESULTS: We present EMBER (Expectation Maximization of Binding and Expression pRofiles), a method that integrates high-throughput binding data (e.g. ChIP-chip or ChIP-seq) with gene expression data (e.g. DNA microarray) via an unsupervised machine learning algorithm for inferring the gene targets of sets of TF binding sites. Genes selected are those that match overrepresented expression patterns, which can be used to provide information about multiple TF regulatory modes. We apply the method to genome-wide human breast cancer data and demonstrate that EMBER confirms a role for the TFs estrogen receptor alpha, retinoic acid receptors alpha and gamma in breast cancer development, whereas the conventional approach of assigning regulatory targets based on proximity does not. Additionally, we compare several predicted target genes from EMBER to interactions inferred previously, examine combinatorial effects of TFs on gene regulation and illustrate the ability of EMBER to discover multiple modes of regulation. AVAILABILITY: All code used for this work is available at http://dinner-group.uchicago.edu/downloads.html.
Mark Maienschein-Cline, Kevin P. White, Roger Sciammas, Aaron R. Dinner
Bioinform.3
2011 Determinants of Antigenicity and Specificity in immune response for Protein Sequences
abstract
BACKGROUND: Target specific antibodies are pivotal for the design of vaccines, immunodiagnostic tests, studies on proteomics for cancer biomarker discovery, identification of protein-DNA and other interactions, and small and large biochemical assays. Therefore, it is important to understand the properties of protein sequences that are important for antigenicity and to identify small peptide epitopes and large regions in the linear sequence of the proteins whose utilization result in specific antibodies. RESULTS: Our analysis using protein properties suggested that sequence composition combined with evolutionary information and predicted secondary structure, as well as solvent accessibility is sufficient to predict successful peptide epitopes. The antigenicity and the specificity in immune response were also found to depend on the epitope length. We trained the B-Cell Epitope Oracle (BEOracle), a support vector machine (SVM) classifier, for the identification of continuous B-Cell epitopes with these protein properties as learning features. The BEOracle achieved an F1-measure of 81.37% on a large validation set. The BEOracle classifier outperformed the classical methods based on propensity and sophisticated methods like BCPred and Bepipred for B-Cell epitope prediction. The BEOracle classifier also identified peptides for the ChIP-grade antibodies from the modENCODE/ENCODE projects with 96.88% accuracy. High BEOracle score for peptides showed some correlation with the antibody intensity on Immunofluorescence studies done on fly embryos. Finally, a second SVM classifier, the B-Cell Region Oracle (BROracle) was trained with the BEOracle scores as features to predict the performance of antibodies generated with large protein regions with high accuracy. The BROracle classifier achieved accuracies of 75.26-63.88% on a validation set with immunofluorescence, immunohistochemistry, protein arrays and western blot results from Protein Atlas database. CONCLUSIONS: Together our results suggest that antigenicity is a local property of the protein sequences and that protein sequence properties of composition, secondary structure, solvent accessibility and evolutionary conservation are the determinants of antigenicity and specificity in immune response. Moreover, specificity in immune response could also be accurately predicted for large protein regions without the knowledge of the protein tertiary structure or the presence of discontinuous epitopes. The dataset prepared in this work and the classifier models are available for download at https://sites.google.com/site/oracleclassifiers/.
Wenjun Wu 0001, Nicolas N. Negre, Kevin P. White, Parantu K. Shah
BMC Bioinform.4
2010 An overview of the Open Science Data Cloud
abstract
The Open Science Data Cloud is a distributed cloud based infrastructure for managing, analyzing, archiving and sharing scientific datasets. We introduce the Open Science Data Cloud, give an overview of its architecture, provide an update on its current status, and briefly describe some research areas of relevance.
Robert L. Grossman, Yunhong Gu, Joe Mambretti, Michal Sabala, Alex Szalay, Kevin P. White
HPDC6
2009 Flynet: a genomic resource for Drosophila melanogaster transcriptional regulatory networks
abstract
MOTIVATION: The highly coordinated expression of thousands of genes in an organism is regulated by the concerted action of transcription factors, chromatin proteins and epigenetic mechanisms. High-throughput experimental data for genome wide in vivo protein-DNA interactions and epigenetic marks are becoming available from large projects, such as the model organism ENCyclopedia Of DNA Elements (modENCODE) and from individual labs. Dissemination and visualization of these datasets in an explorable form is an important challenge. RESULTS: To support research on Drosophila melanogaster transcription regulation and make the genome wide in vivo protein-DNA interactions data available to the scientific community as a whole, we have developed a system called Flynet. Currently, Flynet contains 101 datasets for 38 transcription factors and chromatin regulator proteins in different experimental conditions. These factors exhibit different types of binding profiles ranging from sharp localized peaks to broad binding regions. The protein-DNA interaction data in Flynet was obtained from the analysis of chromatin immunoprecipitation experiments on one color and two color genomic tiling arrays as well as chromatin immunoprecipitation followed by massively parallel sequencing. A web-based interface, integrated with an AJAX based genome browser, has been built for queries and presenting analysis results. Flynet also makes available the cis-regulatory modules reported in literature, known and de novo identified sequence motifs across the genome, and other resources to study gene regulation. AVAILABILITY: Flynet is available at https://www.cistrack.org/flynet/.
Parantu K. Shah, Nicolas N. Negre, Oleksiy Karpenko, Kevin P. White, Robert L. Grossman
Bioinform.7
2005 Case Report: A High Productivity/Low Maintenance Approach to High-performance Computation for Biomedicine: Four Case Studies
abstract
The rapid advances in high-throughput biotechnologies such as DNA microarrays and mass spectrometry have generated vast amounts of data ranging from gene expression to proteomics data. The large size and complexity involved in analyzing such data demand a significant amount of computing power. High-performance computation (HPC) is an attractive and increasingly affordable approach to help meet this challenge. There is a spectrum of techniques that can be used to achieve computational speedup with varying degrees of impact in terms of how drastic a change is required to allow the software to run on an HPC platform. This paper describes a high- productivity/low-maintenance (HP/LM) approach to HPC that is based on establishing a collaborative relationship between the bioinformaticist and HPC expert that respects the former's codes and minimizes the latter's efforts. The goal of this approach is to make it easy for bioinformatics researchers to continue to make iterative refinements to their programs, while still being able to take advantage of HPC. The paper describes our experience applying these HP/LM techniques in four bioinformatics case studies: (1) genome-wide sequence comparison using Blast, (2) identification of biomarkers based on statistical analysis of large mass spectrometry data sets, (3) complex genetic analysis involving ordinal phenotypes, (4) large-scale assessment of the effect of possible errors in analyzing microarray data. The case studies illustrate how the HP/LM approach can be applied to a range of representative bioinformatics applications and how the approach can lead to significant speedup of computationally intensive bioinformatics applications, while making only modest modifications to the programs themselves.
Nicholas Carriero, Michael V. Osier, Kei-Hoi Cheung, Perry L. Miller, Mark Gerstein, Hongyu Zhao 0003, Baolin Wu, Scott A. Rifkin, Joseph T. Chang, Heping Zhang, Kevin P. White, Kenneth R. Williams, Martin H. Schultz
J. Am. Medical Informatics Assoc.11
2004 Probabilistic inference of molecular networks from noisy data sources
abstract
Information on molecular networks, such as networks of interacting proteins, comes from diverse sources that contain remarkable differences in distribution and quantity of errors. Here, we introduce a probabilistic model useful for predicting protein interactions from heterogeneous data sources. The model describes stochastic generation of protein-protein interaction networks with real-world properties, as well as generation of two heterogeneous sources of protein-interaction information: research results automatically extracted from the literature and yeast two-hybrid experiments. Based on the domain composition of proteins, we use the model to predict protein interactions for pairs of proteins for which no experimental data are available. We further explore the prediction limits, given experimental data that cover only part of the underlying protein networks. This approach can be extended naturally to include other types of biological data sources.
Ivan Iossifov, Michael Krauthammer, Carol Friedman, Vasileios Hatzivassiloglou, Joel S. Bader, Kevin P. White, Andrey Rzhetsky
Bioinform.6
2004 Case Report: Exploring the Portability of Informatics Capabilities from a Clinical Application to a Bioscience Application
abstract
This report describes XDesc (eXperiment Description), a pilot project that serves as a case study exploring the degree to which an informatics capability developed in a clinical application can be ported for use in the biosciences. In particular, XDesc uses the Entity-Attribute-Value database implementation (including a great deal of metadata-based functionality) developed in TrialDB, a clinical research database, for use in describing the samples used in microarray experiments stored in the Yale Microarray Database (YMD). XDesc was linked successfully to both TrialDB and YMD, and was used to describe the data in three different microarray research projects involving Drosophila. In the process, a number of new desirable capabilities were identified in the bioscience domain. These were implemented on a pilot basis in XDesc, and subsequently "folded back" into TrialDB itself, enhancing its capabilities for dealing with clinical data. This case study provides a concrete example of how informatics research and development in clinical and bioscience domains has the potential for synergy and for cross-fertilization.
Mark A. Shifman, Ranjana Srivastava, Cynthia Brandt, Tong-Ruei Li, Kevin P. White, Perry L. Miller
J. Am. Medical Informatics Assoc.5
2002 YMD: a microarray database for large-scale gene expression analysis
Kei-Hoi Cheung, Kevin P. White, Janet Hager, Mark Gerstein, Valerie Reinke, Kenneth Nelson, Peter Masiar, Ranjana Srivastava, Yuli Li, Hongyu Zhao 0003, David B. Allison, Michael Snyder 0001, Perry L. Miller, Kenneth R. Williams
AMIA2
2002 A dynamic approach to mapping coordinates between microplates and microarrays
abstract
The retrieval of useful data from spotted microarray slides requires keeping track of which microplate wells and DNA sample corresponds to each spot on each array slide. Existing approaches are closely coupled with the type of arrayer in use and are computer operating-system-specific. To support the microarray researcher community at large who use different arrayers and computer platforms, increased flexibility, generality, and portability of these approaches are required. In this paper, we describe a general algorithm that correlates the well positions of DNA samples in each microplate to the positions of the spots on each array slide. Based on this algorithm, we have implemented a flexible and platform-independent program named MicroArray Convolutor (MAC) that provides a Web solution allowing the user to: (a) import a text file that identifies the DNA samples and their well locations, (b) select a transformation method that converts data in 96-well plate format into 384-well plate format, and (c) specify the output format of the array lists dependant on the configuration of the array platform as well as the downstream analysis software chosen for the array. MAC and its source code can be accessed via the following Web address: http://ymd.med.yale.edu/kei-cgi/kc_mac_dev8.pl.
Kei-Hoi Cheung, Janet Hager, Kenneth Nelson, Kevin P. White, Yuli Li, Michael Snyder 0001, Kenneth R. Williams, Perry L. Miller
J. Biomed. Informatics4