Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael A. Gilchrist
dblp:12/6255
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2018
0000-0002-6936-0771ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › molecular evolution
codon usage analysis |
0.3 | 1 | 2018 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 |
Bioinformatics and computational biology › genomics
computational genomics |
0.3 | 1 | 2018 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 |
Bioinformatics and computational biology › transcriptomics
ribosome profiling |
0.1 | 1 | 2018 | AnaCoDa: analyzing codon data with Bayesian mixture models · Bioinform. 2018 |
Bioinformatics and computational biology › protein analysis › protein-protein interaction › protein-protein interaction network analysis
protein interaction data integration |
0.0 | 1 | 2004 | A statistical framework for combining and interpreting proteomic datasets · Bioinform. 2004 |
Bioinformatics and computational biology
proteomics |
0.0 | 1 | 2004 | A statistical framework for combining and interpreting proteomic datasets · Bioinform. 2004 |
Bioinformatics and computational biology › drug discovery
high-throughput screening |
0.0 | 1 | 2004 | A statistical framework for combining and interpreting proteomic datasets · Bioinform. 2004 |
Methods — techniques the papers use, named apart from their topics
mixture model · 0.3hierarchical modeling · 0.3Bayesian MCMC · 0.3statistical framework · 0.0bayes' law · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | AnaCoDa: analyzing codon data with Bayesian mixture modelsabstractSummary: AnaCoDa is an R package for estimating biologically relevant parameters of mixture models, such as selection against translation inefficiency, non-sense errors and ribosome pausing time, from genomic and high throughput datasets. AnaCoDa provides an adaptive Bayesian MCMC algorithm, fully implemented in C++ for high performance with an ergonomic R interface to improve usability. AnaCoDa employs a generic object-oriented design to allow users to extend the framework and implement their own models. Current models implemented in AnaCoDa can accurately estimate biologically relevant parameters given either protein coding sequences or ribosome foot-printing data. Optionally, AnaCoDa can utilize additional data sources, such as gene expression measurements, to aid model fitting and parameter estimation. By utilizing a hierarchical object structure, some parameters can vary between sets of genes while others can be shared. Genes may be assigned to clusters or membership may be estimated by AnaCoDa. This flexibility allows users to estimate the same model parameter under different biological conditions and categorize genes into different sets based on shared model properties embedded within the data. AnaCoDa also allows users to generate simulated data which can be used to aid model development and model analysis as well as evaluate model adequacy. Finally, AnaCoDa contains a set of visualization routines and the ability to revisit or re-initiate previous model fitting, providing researchers with a well rounded easy to use framework to analyze genome scale data. Availability and implementation: AnaCoDa is freely available under the Mozilla Public License 2.0 on CRAN (https://cran.r-project.org/web/packages/AnaCoDa/). Cedric Landerer, Alexander Cope, Russell Zaretzki, Michael A. Gilchrist |
Bioinform. | 4 |
| 2013 | Evidence for Finely-Regulated Asynchronous Growth of Toxoplasma gondii Cysts Based on Data-Driven Model SelectionabstractToxoplasma gondii establishes a chronic infection by forming cysts preferentially in the brain. This chronic infection is one of the most common parasitic infections in humans and can be reactivated to develop life-threatening toxoplasmic encephalitis in immunocompromised patients. Host-pathogen interactions during the chronic infection include growth of the cysts and their removal by both natural rupture and elimination by the immune system. Analyzing these interactions is important for understanding the pathogenesis of this common infection. We developed a differential equation framework of cyst growth and employed Akaike Information Criteria (AIC) to determine the growth and removal functions that best describe the distribution of cyst sizes measured from the brains of chronically infected mice. The AIC strongly support models in which T. gondii cysts grow at a constant rate such that the per capita growth rate of the parasite is inversely proportional to the number of parasites within a cyst, suggesting finely-regulated asynchronous replication of the parasites. Our analyses were also able to reject the models where cyst removal rate increases linearly or quadratically in association with increase in cyst size. The modeling and analysis framework may provide a useful tool for understanding the pathogenesis of infections with other cyst producing parasites. Adam M. Sullivan, Yasuhiro Suzuki, Eri Ochiai, Stephen Crutcher, Michael A. Gilchrist |
PLoS Comput. Biol. | 6 |
| 2010 | Bias correction and Bayesian analysis of aggregate counts in SAGE librariesabstractBACKGROUND: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation process may allow for multiple tags to be generated from a given mRNA transcript. The probability of forming a tag varies with its relative location. As a result, the observed tag counts represent a biased sample of the actual transcript pool. In SAGE this bias can be avoided by ignoring all but the 3' most tag but will discard a large fraction of the observed data. Taking this bias into account should allow more of the available data to be used leading to increased statistical power. RESULTS: Three new hierarchical models, which directly embed a model for the variation in tag formation probability, are proposed and their associated Bayesian inference algorithms are developed. These models may be applied to libraries at both the tag and aggregate level. Simulation experiments and analysis of real data are used to contrast the accuracy of the various methods. The consequences of tag formation bias are discussed in the context of testing differential expression. A description is given as to how these algorithms can be applied in that context. CONCLUSIONS: Several Bayesian inference algorithms that account for tag formation effects are compared with the DPB algorithm providing clear evidence of superior performance. The accuracy of inferences when using a particular non-informative prior is found to depend on the expression level of a given gene. The multivariate nature of the approach easily allows both univariate and joint tests of differential expression. Calculations demonstrate the potential for false positive and negative findings due to variation in tag formation probabilities across samples when testing for differential expression. Russell Zaretzki, Michael A. Gilchrist, William M. Briggs, Artin Armagan |
BMC Bioinform. | 2 |
| 2007 | Modeling SAGE tag formation and its effects on data interpretation within a Bayesian frameworkabstractBACKGROUND: Serial Analysis of Gene Expression (SAGE) is a high-throughput method for inferring mRNA expression levels from the experimentally generated sequence based tags. Standard analyses of SAGE data, however, ignore the fact that the probability of generating an observable tag varies across genes and between experiments. As a consequence, these analyses result in biased estimators and posterior probability intervals for gene expression levels in the transcriptome. RESULTS: Using the yeast Saccharomyces cerevisiae as an example, we introduce a new Bayesian method of data analysis which is based on a model of SAGE tag formation. Our approach incorporates the variation in the probability of tag formation into the interpretation of SAGE data and allows us to derive exact joint and approximate marginal posterior distributions for the mRNA frequency of genes detectable using SAGE. Our analysis of these distributions indicates that the frequency of a gene in the tag pool is influenced by its mRNA frequency, the cleavage efficiency of the anchoring enzyme (AE), and the number of informative and uninformative AE cleavage sites within its mRNA. CONCLUSION: With a mechanistic, model based approach for SAGE data analysis, we find that inter-genic variation in SAGE tag formation is large. However, this variation can be estimated and, importantly, accounted for using the methods we develop here. As a result, SAGE based estimates of mRNA frequencies can be adjusted to remove the bias introduced by the SAGE tag formation process. Michael A. Gilchrist, Hong Qin 0003, Russell Zaretzki |
BMC Bioinform. | 1 |
| 2004 | A statistical framework for combining and interpreting proteomic datasetsabstractMOTIVATION: To identify accurately protein function on a proteome-wide scale requires integrating data within and between high-throughput experiments. High-throughput proteomic datasets often have high rates of errors and thus yield incomplete and contradictory information. In this study, we develop a simple statistical framework using Bayes' law to interpret such data and combine information from different high-throughput experiments. In order to illustrate our approach we apply it to two protein complex purification datasets. RESULTS: Our approach shows how to use high-throughput data to calculate accurately the probability that two proteins are part of the same complex. Importantly, our approach does not need a reference set of verified protein interactions to determine false positive and false negative error rates of protein association. We also demonstrate how to combine information from two separate protein purification datasets into a combined dataset that has greater coverage and accuracy than either dataset alone. In addition, we also provide a technique for estimating the total number of proteins which can be detected using a particular experimental technique. AVAILABILITY: A suite of simple programs to accomplish some of the above tasks is available at www.unm.edu/~compbio/software/DatasetAssess Michael A. Gilchrist, Laura Salter Kubatko |
Bioinform. | 1 |