Statistical significance of combinatorial regulations.
Ontology highlight
ABSTRACT:
SUBMITTER: Terada A
PROVIDER: S-EPMC3740841 | biostudies-literature | 2013 Aug
REPOSITORIES: biostudies-literature
Publications
Statistical significance of combinatorial regulations.
Terada Aika A Okada-Hatakeyama Mariko M Tsuda Koji K Sese Jun J
Proceedings of the National Academy of Sciences of the United States of America 20130723 32
More than three transcription factors often work together to enable cells to respond to various signals. The detection of combinatorial regulation by multiple transcription factors, however, is not only computationally nontrivial but also extremely unlikely because of multiple testing correction. The exponential growth in the number of tests forces us to set a strict limit on the maximum arity. Here, we propose an efficient branch-and-bound algorithm called the "limitless arity multiple-testing ...[more]
Similar Datasets
Project description:We propose a method to compare the location and variability of gene ex-pression between two groups of microarrays using a permutation test based on the pairwise distance between microarrays. The microarrays could be samples from distinct clinical or biological populations or microarrays prepared at two different levels of an experimental factor. For these tests the entire microarray or some pre-specifed subset of genes, not the individual gene, is the unit of analysis. We apply this method to compare results from two dfferent protocols for preparing labeled targets for microarray hybridization and their subsequent gene expression analysis. Keywords: Comparative genomic expression
2010-09-13 | GSE9424 | GEO
Project description:BackgroundPCR has the potential to detect and precisely quantify specific DNA sequences, but it is not yet often used as a fully quantitative method. A number of data collection and processing strategies have been described for the implementation of quantitative PCR. However, they can be experimentally cumbersome, their relative performances have not been evaluated systematically, and they often remain poorly validated statistically and/or experimentally. In this study, we evaluated the performance of known methods, and compared them with newly developed data processing strategies in terms of resolution, precision and robustness.ResultsOur results indicate that simple methods that do not rely on the estimation of the efficiency of the PCR amplification may provide reproducible and sensitive data, but that they do not quantify DNA with precision. Other evaluated methods based on sigmoidal or exponential curve fitting were generally of both poor resolution and precision. A statistical analysis of the parameters that influence efficiency indicated that it depends mostly on the selected amplicon and to a lesser extent on the particular biological sample analyzed. Thus, we devised various strategies based on individual or averaged efficiency values, which were used to assess the regulated expression of several genes in response to a growth factor.ConclusionOverall, qPCR data analysis methods differ significantly in their performance, and this analysis identifies methods that provide DNA quantification estimates of high precision, robustness and reliability. These methods allow reliable estimations of relative expression ratio of two-fold or higher, and our analysis provides an estimation of the number of biological samples that have to be analyzed to achieve a given precision.
| S-EPMC1868764 | biostudies-literature
Project description:Cluster analysis has proved to be an invaluable tool for the exploratory and unsupervised analysis of high-dimensional datasets. Among methods for clustering, hierarchical approaches have enjoyed substantial popularity in genomics and other fields for their ability to simultaneously uncover multiple layers of clustering structure. A critical and challenging question in cluster analysis is whether the identified clusters represent important underlying structure or are artifacts of natural sampling variation. Few approaches have been proposed for addressing this problem in the context of hierarchical clustering, for which the problem is further complicated by the natural tree structure of the partition, and the multiplicity of tests required to parse the layers of nested clusters. In this article, we propose a Monte Carlo based approach for testing statistical significance in hierarchical clustering which addresses these issues. The approach is implemented as a sequential testing procedure guaranteeing control of the family-wise error rate. Theoretical justification is provided for our approach, and its power to detect true clustering structure is illustrated through several simulation studies and applications to two cancer gene expression datasets.
| S-EPMC5708128 | biostudies-literature
Project description:BackgroundCausal graphs are an increasingly popular tool for the analysis of biological datasets. In particular, signed causal graphs--directed graphs whose edges additionally have a sign denoting upregulation or downregulation--can be used to model regulatory networks within a cell. Such models allow prediction of downstream effects of regulation of biological entities; conversely, they also enable inference of causative agents behind observed expression changes. However, due to their complex nature, signed causal graph models present special challenges with respect to assessing statistical significance. In this paper we frame and solve two fundamental computational problems that arise in practice when computing appropriate null distributions for hypothesis testing.ResultsFirst, we show how to compute a p-value for agreement between observed and model-predicted classifications of gene transcripts as upregulated, downregulated, or neither. Specifically, how likely are the classifications to agree to the same extent under the null distribution of the observed classification being randomized? This problem, which we call "Ternary Dot Product Distribution" owing to its mathematical form, can be viewed as a generalization of Fisher's exact test to ternary variables. We present two computationally efficient algorithms for computing the Ternary Dot Product Distribution and investigate its combinatorial structure analytically and numerically to establish computational complexity bounds.Second, we develop an algorithm for efficiently performing random sampling of causal graphs. This enables p-value computation under a different, equally important null distribution obtained by randomizing the graph topology but keeping fixed its basic structure: connectedness and the positive and negative in- and out-degrees of each vertex. We provide an algorithm for sampling a graph from this distribution uniformly at random. We also highlight theoretical challenges unique to signed causal graphs; previous work on graph randomization has studied undirected graphs and directed but unsigned graphs.ConclusionWe present algorithmic solutions to two statistical significance questions necessary to apply the causal graph methodology, a powerful tool for biological network analysis. The algorithms we present are both fast and provably correct. Our work may be of independent interest in non-biological contexts as well, as it generalizes mathematical results that have been studied extensively in other fields.
| S-EPMC3307026 | biostudies-literature
Project description:BackgroundIt is becoming increasingly important for researchers to be able to scan through large genomic regions for transcription factor binding sites or clusters of binding sites forming cis-regulatory modules. Correspondingly, there has been a push to develop algorithms for the rapid detection and assessment of cis-regulatory modules. While various algorithms for this purpose have been introduced, most are not well suited for rapid, genome scale scanning.ResultsWe introduce methods designed for the detection and statistical evaluation of cis-regulatory modules, modeled as either clusters of individual binding sites or as combinations of sites with constrained organization. In order to determine the statistical significance of module sites, we first need a method to determine the statistical significance of single transcription factor binding site matches. We introduce a straightforward method of estimating the statistical significance of single site matches using a database of known promoters to produce data structures that can be used to estimate p-values for binding site matches. We next introduce a technique to calculate the statistical significance of the arrangement of binding sites within a module using a max-gap model. If the module scanned for has defined organizational parameters, the probability of the module is corrected to account for organizational constraints. The statistical significance of single site matches and the architecture of sites within the module can be combined to provide an overall estimation of statistical significance of cis-regulatory module sites.ConclusionThe methods introduced in this paper allow for the detection and statistical evaluation of single transcription factor binding sites and cis-regulatory modules. The features described are implemented in the Search Tool for Occurrences of Regulatory Motifs (STORM) and MODSTORM software.
| S-EPMC1796902 | biostudies-literature
Project description:We propose a method to compare the location and variability of gene ex-pression between two groups of microarrays using a permutation test based on the pairwise distance between microarrays. The microarrays could be samples from distinct clinical or biological populations or microarrays prepared at two different levels of an experimental factor. For these tests the entire microarray or some pre-specifed subset of genes, not the individual gene, is the unit of analysis. We apply this method to compare results from two dfferent protocols for preparing labeled targets for microarray hybridization and their subsequent gene expression analysis. Keywords: Comparative genomic expression Overall design - Splenocytes were extracted from six sham mice and six trauma-hemorrhagic mice. Total RNA was prepared from individual mice and labeled as targets by two different methods for analysis on Affymentrix MOE 430 2+chips.
2010-09-13 | E-GEOD-9424 | biostudies-arrayexpress
Project description:Epithelial-to-mesenchymal transition (EMT), a fundamental transdifferentiation process in development, produces diverse phenotypes in different physiological or pathological conditions. Many genes involved in EMT have been identified to date, but mechanisms contributing to the phenotypic diversity and those governing the coupling between the dynamics of epithelial (E) genes and that of the mesenchymal (M) genes are unclear. In this study, we employed combinatorial perturbations to mammary epithelial cells to induce a series of EMT phenotypes by manipulating two essential EMT-inducing elements, namely TGF-β and ZEB1. By measuring transcriptional changes in more than 700 E-genes and M-genes, we discovered that the M-genes exhibit a significant diversity in their dependency to these regulatory elements and identified three groups of M-genes that are controlled by different regulatory circuits. Notably, functional differences were detected among the M-gene clusters in motility regulation and in survival of breast cancer patients. We computationally predicted and experimentally confirmed that the reciprocity and reversibility of EMT are jointly regulated by ZEB1. Our integrative analysis reveals the key roles of ZEB1 in coordinating the dynamics of a large number of genes during EMT, and it provides new insights into the mechanisms for the diversity of EMT phenotypes.
| S-EPMC6570767 | biostudies-literature
Project description:Clustering methods have led to a number of important discoveries in bioinformatics and beyond. A major challenge in their use is determining which clusters represent important underlying structure, as opposed to spurious sampling artifacts. This challenge is especially serious, and very few methods are available, when the data are very high in dimension. Statistical Significance of Clustering (SigClust) is a recently developed cluster evaluation tool for high dimensional low sample size data. An important component of the SigClust approach is the very definition of a single cluster as a subset of data sampled from a multivariate Gaussian distribution. The implementation of SigClust requires the estimation of the eigenvalues of the covariance matrix for the null multivariate Gaussian distribution. We show that the original eigenvalue estimation can lead to a test that suffers from severe inflation of type-I error, in the important case where there are a few very large eigenvalues. This paper addresses this critical challenge using a novel likelihood based soft thresholding approach to estimate these eigenvalues, which leads to a much improved SigClust. Major improvements in SigClust performance are shown by both mathematical analysis, based on the new notion of Theoretical Cluster Index, and extensive simulation studies. Applications to some cancer genomic data further demonstrate the usefulness of these improvements.
| S-EPMC4706235 | biostudies-literature
Project description:Accurately localizing molecules within the cell is one of main tasks of modern biology, and colocalization analysis is one of its principal and most often used tools. Despite this popularity, interpretation is often uncertain because colocalization between two or more images is rarely analyzed to determine whether the observed values could have occurred by chance. To address this, we have developed a robust methodology, based on Monte Carlo randomization, to measure the statistical significance of a colocalization. The method works with voxel-based, intensity-based, object-based, and nearest-neighbor metrics. We extend all of these to measure colocalization in images with three colors. We also introduce three new metrics; blob colocalization, where the blob consists of a local maximum surrounded by a three-dimensional group of voxels; cluster diameter, to measure the clustering of fluorophores in three or more images; and the intercluster distance to measure the distance between these clusters. The robustness of these metrics was tested by varying the image thresholds over a broad range, which produced no change in the statistical significance of the colocalizations. A comparison of blob colocalization with voxel and Manders colocalization metrics shows that the different measures produce consistent results with similar values for significance and nonsignificance. Using our methodology, we are able to determine not only whether the labeled molecules colocalize with a probability greater than chance, but also whether they are sequestrated into different compartments. The program, written in C++, is freely available as source, as well as in a Linux version.
| S-EPMC2941013 | biostudies-literature
Project description:MotivationGenome-wide association studies (GWAS) have discovered thousands of significant genetic effects on disease phenotypes. By considering gene expression as the intermediary between genotype and disease phenotype, expression quantitative trait loci studies have interpreted many of these variants by their regulatory effects on gene expression. However, there remains a considerable gap between genotype-to-gene expression association and genotype-to-gene expression prediction. Accurate prediction of gene expression enables gene-based association studies to be performed post hoc for existing GWAS, reduces multiple testing burden, and can prioritize genes for subsequent experimental investigation.ResultsIn this work, we develop gene expression prediction methods that relax the independence and additivity assumptions between genetic markers. First, we consider gene expression prediction from a regression perspective and develop the HAPLEXR algorithm which combines haplotype clusterings with allelic dosages. Second, we introduce the new gene expression classification problem, which focuses on identifying expression groups rather than continuous measurements; we formalize the selection of an appropriate number of expression groups using the principle of maximum entropy. Third, we develop the HAPLEXD algorithm that models haplotype sharing with a modified suffix tree data structure and computes expression groups by spectral clustering. In both models, we penalize model complexity by prioritizing genetic clusters that indicate significant effects on expression. We compare HAPLEXR and HAPLEXD with three state-of-the-art expression prediction methods and two novel logistic regression approaches across five GTEx v8 tissues. HAPLEXD exhibits significantly higher classification accuracy overall; HAPLEXR shows higher prediction accuracy on approximately half of the genes tested and the largest number of best predicted genes (r2>0.1) among all methods. We show that variant and haplotype features selected by HAPLEXR are smaller in size than competing methods (and thus more interpretable) and are significantly enriched in functional annotations related to gene regulation. These results demonstrate the importance of explicitly modeling non-dosage dependent and intragenic epistatic effects when predicting expression.Availability and implementationSource code and binaries are freely available at https://github.com/rapturous/HAPLEX.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC7355230 | biostudies-literature