Convergence rate of Markov chain methods for genomic motif discovery

DOI10.1214/12-AOS1075zbMath1347.62048arXiv1303.2814OpenAlexW2059273542MaRDI QIDQ1952443

Dawn B. Woodard, Jeffrey S. Rosenthal

Publication date: 30 May 2013

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2814

zbMATH Keywords

spectral gapGibbs samplerDNAmultimodalslow mixing

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Bayesian inference (62F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (4)

Reflections on Bayesian inference and Markov chain Monte Carlo ⋮ Unnamed Item ⋮ Markov chain models for cardiac rhythm dynamics in patients undergoing catheter ablation of atrial fibrillation ⋮ Convergence rate of Markov chain methods for genomic motif discovery

Uses Software

• SSS
• BioProspector

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• General state space Markov chains and MCMC algorithms
• Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny
• Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
• Sufficient conditions for torpid mixing of parallel and simulated tempering
• A note on Metropolis-Hastings kernels for general state spaces
• Comparison theorems for reversible Markov chains
• Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
• Ordering and improving the performance of Monte Carlo Markov chains.
• Geometric ergodicity of Metropolis algorithms
• Inference from iterative simulation using multiple sequences
• Computational discovery of gene regulatory binding motifs: a Bayesian perspective
• Markov chain decomposition for convergence rate analysis
• Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
• Gibbs sampling for a Bayesian hierarchical general linear model
• Convergence rate of Markov chain methods for genomic motif discovery
• On the computational complexity of MCMC-based estimators in large samples
• Logarithmic Sobolev inequalities for finite Markov chains
• Bayesian Models for Multiple Local Sequence Alignment and Gibbs Sampling Strategies
• Optimum Monte-Carlo sampling using Markov chains
• Sequential Monte Carlo Samplers
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• The Collapsed Gibbs Sampler in Bayesian Computations with Applications to a Gene Regulation Problem
• On the geometric ergodicity of hybrid samplers
• Hidden Markov Models and Disease Mapping
• On the swapping algorithm
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Weak consistency of Markov chain Monte Carlo methods
• Shotgun Stochastic Search for “Largep” Regression
• Limiting Behavior of Posterior Distributions when the Model is Incorrect

This page was built for publication: Convergence rate of Markov chain methods for genomic motif discovery