Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

MCMC estimation of Markov models for ion channels.

ABSTRACT: Ion channels are characterized by inherently stochastic behavior which can be represented by continuous-time Markov models (CTMM). Although methods for collecting data from single ion channels are available, translating a time series of open and closed channels to a CTMM remains a challenge. Bayesian statistics combined with Markov chain Monte Carlo (MCMC) sampling provide means for estimating the rate constants of a CTMM directly from single channel data. In this article, different approaches for the MCMC sampling of Markov models are combined. This method, new to our knowledge, detects overparameterizations and gives more accurate results than existing MCMC methods. It shows similar performance as QuB-MIL, which indicates that it also compares well with maximum likelihood estimators. Data collected from an inositol trisphosphate receptor is used to demonstrate how the best model for a given data set can be found in practice.

SUBMITTER: Siekmann I

PROVIDER: S-EPMC3077709 | biostudies-literature | 2011 Apr

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

MCMC estimation of Markov models for ion channels.

Siekmann Ivo I Wagner Larry E LE Yule David D Fox Colin C Bryant David D Crampin Edmund J EJ Sneyd James J

Biophysical journal 20110401 8

Ion channels are characterized by inherently stochastic behavior which can be represented by continuous-time Markov models (CTMM). Although methods for collecting data from single ion channels are available, translating a time series of open and closed channels to a CTMM remains a challenge. Bayesian statistics combined with Markov chain Monte Carlo (MCMC) sampling provide means for estimating the rate constants of a CTMM directly from single channel data. In this article, different approaches f ...[more]

PMID: 21504728

Similar Datasets

Fast MCMC sampling for hidden Markov Models to determine copy number variations.

Project description:BACKGROUND: Hidden Markov Models (HMM) are often used for analyzing Comparative Genomic Hybridization (CGH) data to identify chromosomal aberrations or copy number variations by segmenting observation sequences. For efficiency reasons the parameters of a HMM are often estimated with maximum likelihood and a segmentation is obtained with the Viterbi algorithm. This introduces considerable uncertainty in the segmentation, which can be avoided with Bayesian approaches integrating out parameters using Markov Chain Monte Carlo (MCMC) sampling. While the advantages of Bayesian approaches have been clearly demonstrated, the likelihood based approaches are still preferred in practice for their lower running times; datasets coming from high-density arrays and next generation sequencing amplify these problems. RESULTS: We propose an approximate sampling technique, inspired by compression of discrete sequences in HMM computations and by kd-trees to leverage spatial relations between data points in typical data sets, to speed up the MCMC sampling. CONCLUSIONS: We test our approximate sampling method on simulated and biological ArrayCGH datasets and high-density SNP arrays, and demonstrate a speed-up of 10 to 60 respectively 90 while achieving competitive results with the state-of-the art Bayesian approaches. AVAILABILITY: An implementation of our method will be made available as part of the open source GHMM library from http://ghmm.org.

| S-EPMC3371636 | biostudies-literature

Change point estimation in high dimensional Markov random-field models.

Project description:This paper investigates a change-point estimation problem in the context of high-dimensional Markov random field models. Change-points represent a key feature in many dynamically evolving network structures. The change-point estimate is obtained by maximizing a profile penalized pseudo-likelihood function under a sparsity assumption. We also derive a tight bound for the estimate, up to a logarithmic factor, even in settings where the number of possible edges in the network far exceeds the sample size. The performance of the proposed estimator is evaluated on synthetic data sets and is also used to explore voting patterns in the US Senate in the 1979-2012 period.

| S-EPMC5571889 | biostudies-literature

MCMC can detect nonidentifiable models.

Project description:Continuous-time Markov models have been considered the best representation for the stochastic dynamics of ion channels for more than thirty years. For most single-channel data sets, several open and closed states are required for accurately representing the dynamics. However, each data point only shows if the channel is open or closed but not in which state it is. Consequently, some model structures are inherently overparameterized and therefore, in principle, unsuitable for representing any data--those models are called "nonidentifiable". As of this writing, it seems to be poorly understood which continuous-time Markov models are identifiable and which are not, therefore the unconscious use of a nonidentifiable model is a considerable concern. To address this problem, an improved variant of a recently published Markov-chain Monte Carlo method is presented. The algorithm is tested using test data as well as experimental data. We demonstrate that, opposed to a widely used maximum-likelihood estimator, it gives clear warning signs when a nonidentifiable model is used for fitting. Furthermore, for test data that was generated from a nonidentifiable model, the Markov-chain Monte Carlo results recover much more information from the data than maximum-likelihood estimation.

| S-EPMC3514526 | biostudies-literature

Accurate Estimation of Protein Folding and Unfolding Times: Beyond Markov State Models.

Project description:Because standard molecular dynamics (MD) simulations are unable to access time scales of interest in complex biomolecular systems, it is common to "stitch together" information from multiple shorter trajectories using approximate Markov state model (MSM) analysis. However, MSMs may require significant tuning and can yield biased results. Here, by analyzing some of the longest protein MD data sets available (>100 μs per protein), we show that estimators constructed based on exact non-Markovian (NM) principles can yield significantly improved mean first-passage times (MFPTs) for protein folding and unfolding. In some cases, MSM bias of more than an order of magnitude can be corrected when identical trajectory data are reanalyzed by non-Markovian approaches. The NM analysis includes "history" information, higher order time correlations compared to MSMs, that is available in every MD trajectory. The NM strategy is insensitive to fine details of the states used and works well when a fine time-discretization (i.e., small "lag time") is used.

| S-EPMC5022777 | biostudies-literature

Improved state change estimation in dynamic functional connectivity using hidden semi-Markov models.

Project description:The study of functional brain networks has grown rapidly over the past decade. While most functional connectivity (FC) analyses estimate one static network structure for the entire length of the functional magnetic resonance imaging (fMRI) time series, recently there has been increased interest in studying time-varying changes in FC. Hidden Markov models (HMMs) have proven to be a useful modeling approach for discovering repeating graphs of interacting brain regions (brain states). However, a limitation lies in HMMs assuming that the sojourn time, the number of consecutive time points in a state, is geometrically distributed. This may encourage inaccurate estimation of the time spent in a state before switching to another state. We propose a hidden semi-Markov model (HSMM) approach for inferring time-varying brain networks from fMRI data, which explicitly models the sojourn distribution. Specifically, we propose using HSMMs to find each subject's most probable series of network states and the graphs associated with each state, while properly estimating and modeling the sojourn distribution for each state. We perform a simulation study, as well as an analysis on both task-based fMRI data from an anxiety-inducing experiment and resting-state fMRI data from the Human Connectome Project. Our results demonstrate the importance of model choice when estimating sojourn times and reveal their potential for understanding healthy and diseased brain mechanisms.

| S-EPMC6504179 | biostudies-literature

Genomic profile of transporters and ion channels

Project description:Genomic profile of transporters and ion channels in differentiated or undifferentiated Caco-2 cells grown for 5 days, 1 week, 2 weeks or 3 weeks in flasks or filters Keywords: ordered

2004-05-08 | GSE1368 | GEO

APT-MCMC, a C++/Python implementation of Markov Chain Monte Carlo for parameter identification.

Project description:The inverse problem associated with fitting parameters of an ordinary differential equation (ODE) system to data is nonlinear and multimodal, which is of great challenge to gradient-based optimizers. Markov Chain Monte Carlo (MCMC) techniques provide an alternative approach to solving these problems and can escape local minima by design. APT-MCMC was created to allow users to setup ODE simulations in Python and run as compiled C++ code. It combines affine-invariant ensemble of samplers and parallel tempering MCMC techniques to improve the simulation efficiency. Simulations use Bayesian inference to provide probability distributions of parameters, which enable analysis of multiple minima and parameter correlation. Benchmark tests result in a 20×-60× speedup but 14% increase in memory usage against emcee, a similar MCMC package in Python. Several MCMC hyperparameters were analyzed: number of temperatures, ensemble size, step size, and swap attempt frequency. Heuristic tuning guidelines are provided for setting these hyperparameters.

| S-EPMC6698905 | biostudies-literature

Well-tempered MCMC simulations for population pharmacokinetic models.

Project description:A full Bayesian statistical treatment of complex pharmacokinetic or pharmacodynamic models, in particular in a population context, gives access to powerful inference, including on model structure. Markov Chain Monte Carlo (MCMC) samplers are typically used to estimate the joint posterior parameter distribution of interest. Among MCMC samplers, the simulated tempering algorithm (TMCMC) has a number of advantages: it can sample from sharp multi-modal posteriors; it provides insight into identifiability issues useful for model simplification; it can be used to compute accurate Bayes factors for model choice; the simulated Markov chains mix quickly and have assured convergence in certain conditions. The main challenge when implementing this approach is to find an adequate scale of auxiliary inverse temperatures (perks) and associated scaling constants. We solved that problem by adaptive stochastic optimization and describe our implementation of TMCMC sampling in the GNU MCSim software. Once a grid of perks is obtained, it is easy to perform posterior-tempered MCMC sampling or likelihood-tempered MCMC (thermodynamic integration, which bridges the joint prior and the posterior parameter distributions, with assured convergence of a single sampling chain). We compare TMCMC to other samplers and demonstrate its efficient sampling of multi-modal posteriors and calculation of Bayes factors in two stylized case-studies and two realistic population pharmacokinetic inference problems, one of them involving a large PBPK model.

| S-EPMC8082542 | biostudies-literature

Markov state models of proton- and pore-dependent activation in a pentameric ligand-gated ion channel.

Project description:Ligand-gated ion channels conduct currents in response to chemical stimuli, mediating electrochemical signaling in neurons and other excitable cells. For many channels, the details of gating remain unclear, partly due to limited structural data and simulation timescales. Here, we used enhanced sampling to simulate the pH-gated channel GLIC, and construct Markov state models (MSMs) of gating. Consistent with new functional recordings, we report in oocytes, our analysis revealed differential effects of protonation and mutation on free-energy wells. Clustering of closed- versus open-like states enabled estimation of open probabilities and transition rates, while higher-order clustering affirmed conformational trends in gating. Furthermore, our models uncovered state- and protonation-dependent symmetrization. This demonstrates the applicability of MSMs to map energetic and conformational transitions between ion-channel functional states, and how they reproduce shifts upon activation or mutation, with implications for modeling neuronal function and developing state-selective drugs.

| S-EPMC8635979 | biostudies-literature

Using independent open-to-closed transitions to simplify aggregated Markov models of ion channel gating kinetics.

Project description:Deducing plausible reaction schemes from single-channel current traces is time-consuming and difficult. The goal is to find the simplest scheme that fits the data, but there are many ways to connect even a small number of states (>2 million schemes with four open and four closed states). Many schemes make identical predictions. An exhaustive search over model space does not address the many equivalent schemes that will result. We have found a canonical form that can express all reaction schemes for binary channels. This form has the minimal number of rate constants for any rank (number of independent open-closed transitions), unlike other canonical forms such as the well established "uncoupled" scheme. Because all of the interconductance transitions in the new form are independent, we refer to it as the manifest interconductance rank (MIR) form. In the case of four open and four closed states, there are four MIR form schemes, corresponding to ranks 1-4. For many models proposed in the literature for specific ion channels, the equivalent MIR form has dramatically fewer links than the uncoupled form. By using the MIR form we prove that all rank 1 topologies with a given number of open and closed states make identical predictions in steady state, thus narrowing the search space for simple models. Moreover, we prove that fitting to canonical form preserves detailed balance. We also propose an efficient hierarchical algorithm for searching for the simplest possible model consistent with a given data set.

| S-EPMC1088360 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

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