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

Timothy S. Gardner

dblp:45/2938 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0001-5465-5828ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4

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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.112008
Predicting gene targets of perturbations via network-based filtering of mRNA expression compendia · Bioinform. 2008
Bioinformatics and computational biology › gene expression analysis › microarray data analysis
microarray gene expression analysis
0.012008
Predicting gene targets of perturbations via network-based filtering of mRNA expression compendia · Bioinform. 2008

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

sparse simultaneous equation model · 0.1network filtering · 0.1LASSO regression · 0.1
YearPublicationVenuePosition
2010 On the Choice and Number of Microarrays for Transcriptional Regulatory Network Inference
abstract
BACKGROUND: Transcriptional regulatory network inference (TRNI) from large compendia of DNA microarrays has become a fundamental approach for discovering transcription factor (TF)-gene interactions at the genome-wide level. In correlation-based TRNI, network edges can in principle be evaluated using standard statistical tests. However, while such tests nominally assume independent microarray experiments, we expect dependency between the experiments in microarray compendia, due to both project-specific factors (e.g., microarray preparation, environmental effects) in the multi-project compendium setting and effective dependency induced by gene-gene correlations. Herein, we characterize the nature of dependency in an Escherichia coli microarray compendium and explore its consequences on the problem of determining which and how many arrays to use in correlation-based TRNI. RESULTS: We present evidence of substantial effective dependency among microarrays in this compendium, and characterize that dependency with respect to experimental condition factors. We then introduce a measure neff of the effective number of experiments in a compendium, and find that corresponding to the dependency observed in this particular compendium there is a huge reduction in effective sample size i.e., neff = 14.7 versus n = 376. Furthermore, we found that the neff of select subsets of experiments actually exceeded neff of the full compendium, suggesting that the adage 'less is more' applies here. Consistent with this latter result, we observed improved performance in TRNI using subsets of the data compared to results using the full compendium. We identified experimental condition factors that trend with changes in TRNI performance and neff , including growth phase and media type. Finally, using the set of known E. coli genetic regulatory interactions from RegulonDB, we demonstrated that false discovery rates (FDR) derived from neff -adjusted p-values were well-matched to FDR based on the RegulonDB truth set. CONCLUSIONS: These results support utilization of neff as a potent descriptor of microarray compendia. In addition, they highlight a straightforward correlation-based method for TRNI with demonstrated meaningful statistical testing for significant edges, readily applicable to compendia from any species, even when a truth set is not available. This work facilitates a more refined approach to construction and utilization of mRNA expression compendia in TRNI.
Elissa J. Cosgrove, Timothy S. Gardner, Eric D. Kolaczyk
BMC Bioinform.2
2008 Predicting gene targets of perturbations via network-based filtering of mRNA expression compendia
abstract
MOTIVATION: DNA microarrays are routinely applied to study diseased or drug-treated cell populations. A critical challenge is distinguishing the genes directly affected by these perturbations from the hundreds of genes that are indirectly affected. Here, we developed a sparse simultaneous equation model (SSEM) of mRNA expression data and applied Lasso regression to estimate the model parameters, thus constructing a network model of gene interaction effects. This inferred network model was then used to filter data from a given experimental condition of interest and predict the genes directly targeted by that perturbation. RESULTS: Our proposed SSEM-Lasso method demonstrated substantial improvement in sensitivity compared with other tested methods for predicting the targets of perturbations in both simulated datasets and microarray compendia. In simulated data, for two different network types, and over a wide range of signal-to-noise ratios, our algorithm demonstrated a 167% increase in sensitivity on average for the top 100 ranked genes, compared with the next best method. Our method also performed well in identifying targets of genetic perturbations in microarray compendia, with up to a 24% improvement in sensitivity on average for the top 100 ranked genes. The overall performance of our network-filtering method shows promise for identifying the direct targets of genetic dysregulation in cancer and disease from expression profiles. AVAILABILITY: Microarray data are available at the Many Microbe Microarrays Database (M3D, http://m3d.bu.edu). Algorithm scripts are available at the Gardner Lab website (http://gardnerlab.bu.edu/SSEMLasso).
Elissa J. Cosgrove, Yingchun Zhou, Timothy S. Gardner, Eric D. Kolaczyk
Bioinform.3
2007 Inferring Regulatory Interactions between Transcriptional Factors and Genes by Propagating Known Regulatory Links
abstract
Determining transcriptional regulatory networks has been one of the most important goals in the field of functional genomics. Despite the recent advances in experimental techniques, complementary computational techniques have lagged behind. We introduce a novel computational methodology that uses DNA microarray data and known regulatory interactions to predict unknown regulatory interactions. Our method involves three steps: in the training stage, we utilize network component analysis (NCA) (Liao et al., 2003; Kao et al., 2004; Boscolo et al., 2005) to reconstruct the hidden activity profiles of transcriptional factors (TF); then we cluster TFs into functional modules according to the similarities of their reconstructed activity profiles; in the prediction stage, we infer additional TF-gene regulatory links by selecting TF profiles that best interpret genes expression profiles via a linear model. We applied the methodology to a gene expression dataset of bacterium Escherichia coli, whose partial TF-gene regulatory structure is obtained from RegulonDB (Salgado et al., 2004). Cross-validation results show that when the profiles of all TFs regulating a gene are reconstructed from NCA, we could identify 36% of the TF-gene interactions, and the prediction accuracy is 89%. And when the profiles of partial (50% or more) TFs regulating a gene can be reconstructed, we can identify 14% of the TF-gene interactions, and the accuracy rate is 69%. These represent some of the best known accuracy and coverage statistics reported in the literature so far
Qian Zhong, Riccardo Boscolo, Timothy S. Gardner, Vwani P. Roychowdhury
CIBCB3
2007 Lightweight genome viewer: portable software for browsing genomics data in its chromosomal context
abstract
BACKGROUND: Lightweight genome viewer (lwgv) is a web-based tool for visualization of sequence annotations in their chromosomal context. It performs most of the functions of larger genome browsers, while relying on standard flat-file formats and bypassing the database needs of most visualization tools. Visualization as an aide to discovery requires display of novel data in conjunction with static annotations in their chromosomal context. With database-based systems, displaying dynamic results requires temporary tables that need to be tracked for removal. RESULTS: lwgv simplifies the visualization of user-generated results on a local computer. The dynamic results of these analyses are written to transient files, which can import static content from a more permanent file. lwgv is currently used in many different applications, from whole genome browsers to single-gene RNAi design visualization, demonstrating its applicability in a large variety of contexts and scales. CONCLUSION: lwgv provides a lightweight alternative to large genome browsers for visualizing biological annotations and dynamic analyses in their chromosomal context. It is particularly suited for applications ranging from short sequences to medium-sized genomes when the creation and maintenance of a large software and database infrastructure is not necessary or desired.
Jeremiah J. Faith, Andrew J. Olson, Timothy S. Gardner, Ravi Sachidanandam
BMC Bioinform.3