A parameter-free statistical test for neuronal responsiveness.
Ontology highlight
ABSTRACT:
SUBMITTER: Montijn JS
PROVIDER: S-EPMC8626082 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Localization microscopy is a super-resolution imaging technique that relies on the spatial and temporal separation of blinking fluorescent emitters. These blinking events can be individually localized with a precision significantly smaller than the classical diffraction limit. This sub-diffraction localization precision is theoretically bounded by the number of photons emitted per molecule and by the sensor noise. These parameters can be estimated from the raw images. Alternatively, the resolution can be estimated from a rendered image of the localizations. Here, we show how the rendering of localization datasets can influence the resolution estimation based on decorrelation analysis. We demonstrate that a modified histogram rendering, termed bilinear histogram, circumvents the biases introduced by Gaussian or standard histogram rendering. We propose a parameter-free processing pipeline and show that the resolution estimation becomes a function of the localization density and the localization precision, on both simulated and state-of-the-art experimental datasets.
| S-EPMC8113488 | biostudies-literature
Project description:This SuperSeries is composed of the SubSeries listed below.
2011-08-10 | GSE26736 | GEO
Project description:Background Many microarray experiments search for genes with differential expression between a common “reference” group and multiple test groups, like in the case of time-course designs or of various treatments versus a control condition. In such cases, currently employed statistical approaches based on t-test or close derivatives have limited efficacy, mostly because estimation of noise is done on only two groups at time. Alternative approaches based on ANOVA correctly capture noise from all the groups, but then do not confront single test groups with the reference. We therefore conceived a statistical test for pairwise comparisons between the reference group and each test group that uses within-group variance calculated from all the groups. Results We implemented an R-Bioconductor package named Mulcom, with a statistical test derived from the Dunnett’s test, designed to compare multiple experimental groups against a common reference. In addition to the basic Dunnett’s t value, the package includes an optional minimal fold-change threshold, m. Thanks to automated, permutation-based estimation of False Discovery Rate (FDR), the package also permits fast optimization of the test, to obtain the maximum number of significant genes at a given FDR value. When applied on a time-course experiment profiled in parallel on two microarray platforms, and compared with currently used tests, Mulcom displayed higher concordance of significant genes in the two array platforms, and higher enrichment in functional annotation to categories related to the biology of the experiment. Conclusions The Mulcom package provides a fast and powerful tool for the identification of differentially expressed genes when several experimental conditions are compared with a common reference. We found that Mulcom leads to lists of differentially expressed genes that are particularly consistent across microarray platforms and enriched in significant classes of genes. In our opinion, the main reasons for these good performances are three: (i) within-group variability is estimated from all experimental groups even if only two of them are compared each time; (ii) the optional fold-change threshold m avoids false positives due to aberrantly low within-group variability; (iii) automated test optimization allows maximizing sensitivity without compromising specificity.
2011-08-10 | GSE26732 | GEO
Project description:Background Many microarray experiments search for genes with differential expression between a common “reference” group and multiple test groups, like in the case of time-course designs or of various treatments versus a control condition. In such cases, currently employed statistical approaches based on t-test or close derivatives have limited efficacy, mostly because estimation of noise is done on only two groups at time. Alternative approaches based on ANOVA correctly capture noise from all the groups, but then do not confront single test groups with the reference. We therefore conceived a statistical test for pairwise comparisons between the reference group and each test group that uses within-group variance calculated from all the groups. Results We implemented an R-Bioconductor package named Mulcom, with a statistical test derived from the Dunnett’s test, designed to compare multiple experimental groups against a common reference. In addition to the basic Dunnett’s t value, the package includes an optional minimal fold-change threshold, m. Thanks to automated, permutation-based estimation of False Discovery Rate (FDR), the package also permits fast optimization of the test, to obtain the maximum number of significant genes at a given FDR value. When applied on a time-course experiment profiled in parallel on two microarray platforms, and compared with currently used tests, Mulcom displayed higher concordance of significant genes in the two array platforms, and higher enrichment in functional annotation to categories related to the biology of the experiment. Conclusions The Mulcom package provides a fast and powerful tool for the identification of differentially expressed genes when several experimental conditions are compared with a common reference. We found that Mulcom leads to lists of differentially expressed genes that are particularly consistent across microarray platforms and enriched in significant classes of genes. In our opinion, the main reasons for these good performances are three: (i) within-group variability is estimated from all experimental groups even if only two of them are compared each time; (ii) the optional fold-change threshold m avoids false positives due to aberrantly low within-group variability; (iii) automated test optimization allows maximizing sensitivity without compromising specificity.
2011-08-10 | GSE26735 | GEO
Project description:The expansion of the world's population requires the development of high production agriculture. For this purpose, it is essential to identify target points conditioning crop responsiveness to predicted [CO2]. The aim of this study was to determine the relevance of ear sink strength in leaf protein and metabolomic profiles and its implications in photosynthetic activity and yield of durum wheat plants exposed to elevated [CO2]. For this purpose, a genotype with high harvest index (HI) (Triticum durum var. Sula) and another with low HI (Triticum durum var. Blanqueta) were exposed to elevated [CO2] (700 µmol mol(-1) versus 400 µmol mol(-1) CO2) in CO2 greenhouses. The obtained data highlighted that elevated [CO2] only increased plant growth in the genotype with the largest HI; Sula. Gas exchange analyses revealed that although exposure to 700 µmol mol(-1) depleted Rubisco content, Sula was capable of increasing the light-saturated rate of CO2 assimilation (Asat) whereas, in Blanqueta, the carbohydrate imbalance induced the down-regulation of Asat. The specific depletion of Rubisco in both genotypes under elevated [CO2], together with the enhancement of other proteins in the Calvin cycle, revealed that there was a redistribution of N from Rubisco towards RuBP regeneration. Moreover, the down-regulation of N, NO3 (-), amino acid, and organic acid content, together with the depletion of proteins involved in amino acid synthesis that was detected in Blanqueta grown at 700 µmol mol(-1) CO2, revealed that inhibition of N assimilation was involved in the carbohydrate imbalance and consequently with the down-regulation of photosynthesis and growth in these plants.
| S-EPMC3638836 | biostudies-literature
Project description:BackgroundWe present the algorithm PFClust (Parameter Free Clustering), which is able automatically to cluster data and identify a suitable number of clusters to group them into without requiring any parameters to be specified by the user. The algorithm partitions a dataset into a number of clusters that share some common attributes, such as their minimum expectation value and variance of intra-cluster similarity. A set of n objects can be clustered into any number of clusters from one to n, and there are many different hierarchical and partitional, agglomerative and divisive, clustering methodologies available that can be used to do this. Nonetheless, automatically determining the number of clusters present in a dataset constitutes a significant challenge for clustering algorithms. Identifying a putative optimum number of clusters to group the objects into involves computing and evaluating a range of clusterings with different numbers of clusters. However, there is no agreed or unique definition of optimum in this context. Thus, we test PFClust on datasets for which an external gold standard of 'correct' cluster definitions exists, noting that this division into clusters may be suboptimal according to other reasonable criteria. PFClust is heuristic in the sense that it cannot be described in terms of optimising any single simply-expressed metric over the space of possible clusterings.ResultsWe validate PFClust firstly with reference to a number of synthetic datasets consisting of 2D vectors, showing that its clustering performance is at least equal to that of six other leading methodologies - even though five of the other methods are told in advance how many clusters to use. We also demonstrate the ability of PFClust to classify the three dimensional structures of protein domains, using a set of folds taken from the structural bioinformatics database CATH.ConclusionsWe show that PFClust is able to cluster the test datasets a little better, on average, than any of the other algorithms, and furthermore is able to do this without the need to specify any external parameters. Results on the synthetic datasets demonstrate that PFClust generates meaningful clusters, while our algorithm also shows excellent agreement with the correct assignments for a dataset extracted from the CATH part-manually curated classification of protein domain structures.
| S-EPMC3747858 | biostudies-literature
Project description:Computational RNA secondary structure prediction is rather well established. However, such prediction algorithms always depend on a large number of experimentally measured parameters. Here, we study how sensitive structure prediction algorithms are to changes in these parameters. We found already that for changes corresponding to the actual experimental error to which these parameters have been determined, 30% of the structure are falsely predicted whereas the ground state structure is preserved under parameter perturbation in only 5% of all the cases. We establish that base-pairing probabilities calculated in a thermal ensemble are viable although not a perfect measure for the reliability of the prediction of individual structure elements. Here, a new measure of stability using parameter perturbation is proposed, and its limitations are discussed.
| S-EPMC548333 | biostudies-literature
Project description:This SuperSeries is composed of the following subset Series: GSE26732: Mulcom: a multiple comparison statistical test for microarray data in Bioconductor (Affymetrix) GSE26735: Mulcom: a multiple comparison statistical test for microarray data in Bioconductor (Illumina) Refer to individual Series
2011-08-09 | E-GEOD-26736 | biostudies-arrayexpress
Project description:This tutorial illustrates the use of data assimilation algorithms to estimate unobserved variables and unknown parameters of conductance-based neuronal models. Modern data assimilation (DA) techniques are widely used in climate science and weather prediction, but have only recently begun to be applied in neuroscience. The two main classes of DA techniques are sequential methods and variational methods. We provide computer code implementing basic versions of a method from each class, the Unscented Kalman Filter and 4D-Var, and demonstrate how to use these algorithms to infer several parameters of the Morris-Lecar model from a single voltage trace. Depending on parameters, the Morris-Lecar model exhibits qualitatively different types of neuronal excitability due to changes in the underlying bifurcation structure. We show that when presented with voltage traces from each of the various excitability regimes, the DA methods can identify parameter sets that produce the correct bifurcation structure even with initial parameter guesses that correspond to a different excitability regime. This demonstrates the ability of DA techniques to perform nonlinear state and parameter estimation and introduces the geometric structure of inferred models as a novel qualitative measure of estimation success. We conclude by discussing extensions of these DA algorithms that have appeared in the neuroscience literature.
| S-EPMC6085278 | biostudies-literature
Project description:In this paper the algorithm for ΔρDCCA statistical test (Guedes et al., 2018) [1] is presented. Our test begins with the simulation of four time series pairs, by an ARFIMA process. These time series has N=250 , 500, 1000, and 2000 points, see Guedes et al. (2018) [1]. The probability distribution function (PDF) is made available for all 10,000 samples, that start from the original time series, in supplementary material.
| S-EPMC6103976 | biostudies-literature