Browse
Submit Data
Databases
API
Help

Dataset Information

20 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

On the adaptive partition approach to the detection of multiple change-points.

ABSTRACT: With an adaptive partition procedure, we can partition a "time course" into consecutive non-overlapped intervals such that the population means/proportions of the observations in two adjacent intervals are significantly different at a given level . However, the widely used recursive combination or partition procedures do not guarantee a global optimization. We propose a modified dynamic programming algorithm to achieve a global optimization. Our method can provide consistent estimation results. In a comprehensive simulation study, our method shows an improved performance when it is compared to the recursive combination/partition procedures. In practice, can be determined based on a cross-validation procedure. As an application, we consider the well-known Pima Indian Diabetes data. We explore the relationship among the diabetes risk and several important variables including the plasma glucose concentration, body mass index and age.

SUBMITTER: Lai Y

PROVIDER: S-EPMC3101215 | biostudies-literature | 2011

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

On the adaptive partition approach to the detection of multiple change-points.

Lai Yinglei Y

PloS one 20110524 5

With an adaptive partition procedure, we can partition a "time course" into consecutive non-overlapped intervals such that the population means/proportions of the observations in two adjacent intervals are significantly different at a given level . However, the widely used recursive combination or partition procedures do not guarantee a global optimization. We propose a modified dynamic programming algorithm to achieve a global optimization. Our method can provide consistent estimation results. ...[more]

PMID: 21629694

Similar Datasets

THE SCREENING AND RANKING ALGORITHM FOR CHANGE-POINTS DETECTION IN MULTIPLE SAMPLES.

Project description:The chromosome copy number variation (CNV) is the deviation of genomic regions from their normal copy number states, which may associate with many human diseases. Current genetic studies usually collect hundreds to thousands of samples to study the association between CNV and diseases. CNVs can be called by detecting the change-points in mean for sequences of array-based intensity measurements. Although multiple samples are of interest, the majority of the available CNV calling methods are single sample based. Only a few multiple sample methods have been proposed using scan statistics that are computationally intensive and designed toward either common or rare change-points detection. In this paper, we propose a novel multiple sample method by adaptively combining the scan statistic of the screening and ranking algorithm (SaRa), which is computationally efficient and is able to detect both common and rare change-points. We prove that asymptotically this method can find the true change-points with almost certainty and show in theory that multiple sample methods are superior to single sample methods when shared change-points are of interest. Additionally, we report extensive simulation studies to examine the performance of our proposed method. Finally, using our proposed method as well as two competing approaches, we attempt to detect CNVs in the data from the Primary Open-Angle Glaucoma Genes and Environment study, and conclude that our method is faster and requires less information while our ability to detect the CNVs is comparable or better.

| S-EPMC5233178 | biostudies-literature

A simulation approach for change-points on phylogenetic trees.

Project description:We observe n sequences at each of m sites and assume that they have evolved from an ancestral sequence that forms the root of a binary tree of known topology and branch lengths, but the sequence states at internal nodes are unknown. The topology of the tree and branch lengths are the same for all sites, but the parameters of the evolutionary model can vary over sites. We assume a piecewise constant model for these parameters, with an unknown number of change-points and hence a transdimensional parameter space over which we seek to perform Bayesian inference. We propose two novel ideas to deal with the computational challenges of such inference. Firstly, we approximate the model based on the time machine principle: the top nodes of the binary tree (near the root) are replaced by an approximation of the true distribution; as more nodes are removed from the top of the tree, the cost of computing the likelihood is reduced linearly in n. The approach introduces a bias, which we investigate empirically. Secondly, we develop a particle marginal Metropolis-Hastings (PMMH) algorithm, that employs a sequential Monte Carlo (SMC) sampler and can use the first idea. Our time-machine PMMH algorithm copes well with one of the bottle-necks of standard computational algorithms: the transdimensional nature of the posterior distribution. The algorithm is implemented on simulated and real data examples, and we empirically demonstrate its potential to outperform competing methods based on approximate Bayesian computation (ABC) techniques.

| S-EPMC4283070 | biostudies-literature

Detecting multiple generalized change-points by isolating single ones.

Project description:We introduce a new approach, called Isolate-Detect (ID), for the consistent estimation of the number and location of multiple generalized change-points in noisy data sequences. Examples of signal changes that ID can deal with are changes in the mean of a piecewise-constant signal and changes, continuous or not, in the linear trend. The number of change-points can increase with the sample size. Our method is based on an isolation technique, which prevents the consideration of intervals that contain more than one change-point. This isolation enhances ID's accuracy as it allows for detection in the presence of frequent changes of possibly small magnitudes. In ID, model selection is carried out via thresholding, or an information criterion, or SDLL, or a hybrid involving the former two. The hybrid model selection leads to a general method with very good practical performance and minimal parameter choice. In the scenarios tested, ID is at least as accurate as the state-of-the-art methods; most of the times it outperforms them. ID is implemented in the R packages IDetect and breakfast, available from CRAN.Supplementary informationThe online version contains supplementary material available at 10.1007/s00184-021-00821-6.

| S-EPMC8142888 | biostudies-literature

Multiple climate change-driven tipping points for coastal systems.

Project description:As the climate evolves over the next century, the interaction of accelerating sea level rise (SLR) and storms, combined with confining development and infrastructure, will place greater stresses on physical, ecological, and human systems along the ocean-land margin. Many of these valued coastal systems could reach "tipping points," at which hazard exposure substantially increases and threatens the present-day form, function, and viability of communities, infrastructure, and ecosystems. Determining the timing and nature of these tipping points is essential for effective climate adaptation planning. Here we present a multidisciplinary case study from Santa Barbara, California (USA), to identify potential climate change-related tipping points for various coastal systems. This study integrates numerical and statistical models of the climate, ocean water levels, beach and cliff evolution, and two soft sediment ecosystems, sandy beaches and tidal wetlands. We find that tipping points for beaches and wetlands could be reached with just 0.25 m or less of SLR (~ 2050), with > 50% subsequent habitat loss that would degrade overall biodiversity and ecosystem function. In contrast, the largest projected changes in socioeconomic exposure to flooding for five communities in this region are not anticipated until SLR exceeds 0.75 m for daily flooding and 1.5 m for storm-driven flooding (~ 2100 or later). These changes are less acute relative to community totals and do not qualify as tipping points given the adaptive capacity of communities. Nonetheless, the natural and human built systems are interconnected such that the loss of natural system function could negatively impact the quality of life of residents and disrupt the local economy, resulting in indirect socioeconomic impacts long before built infrastructure is directly impacted by flooding.

| S-EPMC8324862 | biostudies-literature

Adaptive Processes Change as Multiple Functions Evolve.

Project description:Epistasis influences the gene-environment interactions that shape bacterial fitness through antibiotic exposure, which can ultimately affect the availability of certain resistance phenotypes to bacteria. The substitutions present within blaTEM-50 confer both cephalosporin and β-lactamase inhibitor resistance. We wanted to compare the evolution of blaTEM-50 with that of another variant, blaTEM-85, which differs in that blaTEM-85 contains only substitutions that contribute to cephalosporin resistance. Differences between the landscapes and epistatic interactions of these TEM variants are important for understanding their separate evolutionary responses to antibiotics. We hypothesized the substitutions within blaTEM-50 would result in more epistatic interactions than for blaTEM-85 As expected, we found more epistatic interactions between the substitutions present in blaTEM-50 than in blaTEM-85 Our results suggest that selection from many cephalosporins is required to achieve the full potential resistance to cephalosporins but that a single β-lactam and inhibitor combination will drive evolution of the full potential resistance phenotype. Surprisingly, we also found significantly positive increases in growth rates as antibiotic concentration increased for some of the strains expressing blaTEM-85 precursor genotypes but not the blaTEM-50 variants. This result further suggests that additive interactions more effectively optimize phenotypes than epistatic interactions, which means that exposure to numerous cephalosporins actually increases the ability of a TEM enzyme to confer resistance to any single cephalosporin.

| S-EPMC8097417 | biostudies-literature

Detection of Velocity and Diffusion Coefficient Change Points in Single-Particle Trajectories.

Project description:The position-time trajectory of a biological subject moving in a complex environment contains rich information about how it interacts with the local setting. Whether the subject be an animal or an intracellular endosomal vesicle, the two primary modes of biological locomotion are directional movement and random walk, respectively characterized by velocity and diffusion coefficient. This contribution introduces a method to quantitatively divide a single-particle trajectory into segments that exhibit changes in the diffusion coefficient, velocity, or both. With the determination of these two physical parameters given by the maximum likelihood estimators, the relative precisions are given as explicit functions of the number of data points and total trajectory time. The method is based on rigorous statistical tests and does not require any presumed kinetics scheme. Results of extensive characterizations, extensions to 2D and 3D trajectories, and applications to common scenarios are also discussed.

| S-EPMC6051264 | biostudies-other

Density Estimation via Discrepancy Based Adaptive Sequential Partition.

Project description:Given iid observations from an unknown absolute continuous distribution defined on some domain Ω, we propose a nonparametric method to learn a piecewise constant function to approximate the underlying probability density function. Our density estimate is a piecewise constant function defined on a binary partition of Ω. The key ingredient of the algorithm is to use discrepancy, a concept originates from Quasi Monte Carlo analysis, to control the partition process. The resulting algorithm is simple, efficient, and has a provable convergence rate. We empirically demonstrate its efficiency as a density estimation method. We also show how it can be utilized to find good initializations for k-means.

| S-EPMC6640859 | biostudies-literature

Partition: a surjective mapping approach for dimensionality reduction.

Project description:MotivationLarge amounts of information generated by genomic technologies are accompanied by statistical and computational challenges due to redundancy, badly behaved data and noise. Dimensionality reduction (DR) methods have been developed to mitigate these challenges. However, many approaches are not scalable to large dimensions or result in excessive information loss.ResultsThe proposed approach partitions data into subsets of related features and summarizes each into one and only one new feature, thus defining a surjective mapping. A constraint on information loss determines the size of the reduced dataset. Simulation studies demonstrate that when multiple related features are associated with a response, this approach can substantially increase the number of true associations detected as compared to principal components analysis, non-negative matrix factorization or no DR. This increase in true discoveries is explained both by a reduced multiple-testing challenge and a reduction in extraneous noise. In an application to real data collected from metastatic colorectal cancer tumors, more associations between gene expression features and progression free survival and response to treatment were detected in the reduced than in the full untransformed dataset.Availability and implementationFreely available R package from CRAN, https://cran.r-project.org/package=partition.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC8215926 | biostudies-literature

Differential expression of multiple kallikreins in a viral model of multiple sclerosis points to unique roles in the innate and adaptive immune response.

Project description:Recent studies provide a functional link between kallikrein 6 (Klk6) and the development and progression of disease in patients with multiple sclerosis (MS) and in its murine models. To evaluate the involvement of additional kallikrein family members, we compared Klk6 expression with four other kallikreins (Klk1, Klk7, Klk8, and Klk10) in the brain and spinal cord of mice infected with Theiler's murine encephalomyelitis virus, an experimental model of progressive MS. The robust upregulation of Klk6 and Klk8 in the brain during the acute phase of viral encephalitis and in the spinal cord during disease development and progression points to their participation in inflammation, demyelination, and progressive axon degeneration. More limited changes in Klk1, Klk7, and Klk10 were also observed. In addition, Klk1, Klk6, and Klk10 were dynamically regulated in T cells in vitro as a recall response to viral antigen and in activated monocytes, pointing to their activities in the development of adaptive and innate immune function. Together, these results point to overlapping and unique roles for multiple kallikreins in the development and progression of virus-mediated central nervous system inflammatory demyelinating disease, including activities in the development of the adaptive and innate immune response, in demyelination, and in progressive axon degeneration.

| S-EPMC4144048 | biostudies-literature

rbrothers: R Package for Bayesian Multiple Change-Point Recombination Detection.

Project description:Phylogenetic recombination detection is a fundamental task in bioinformatics and evolutionary biology. Most of the computational tools developed to attack this important problem are not integrated into the growing suite of R packages for statistical analysis of molecular sequences. Here, we present an R package, rbrothers, that makes a Bayesian multiple change-point model, one of the most sophisticated model-based phylogenetic recombination tools, available to R users. Moreover, we equip the Bayesian change-point model with a set of pre- and post- processing routines that will broaden the application domain of this recombination detection framework. Specifically, we implement an algorithm that forms the set of input trees required by multiple change-point models. We also provide functionality for checking Markov chain Monte Carlo convergence and creating estimation result summaries and graphics. Using rbrothers, we perform a comparative analysis of two Salmonella enterica genes, fimA and fimH, that encode major and adhesive subunits of the type 1 fimbriae, respectively. We believe that rbrothers, available at R-Forge: http://evolmod.r-forge.r-project.org/, will allow researchers to incorporate recombination detection into phylogenetic workflows already implemented in R.

| S-EPMC3694826 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data