Fast MCMC Sampling for Hidden Markov Models to Determine Copy Number Variations
M. Mahmud and A. Schliep
BMC Bioinformatics 2011, 12:1, 428.
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 eciency 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.
A reprint is available as PDF.
The following presentation(s) are based on this publication: Sept. 6, 2011 by Md Mahmud at Workshop on Algorithms in Bioinformatics (WABI), Saarbrücken, Germany (Contributed Talk), Nov. 21, 2011 by Alexander Schliep at NJIT, Department of Computer Science (Invited Talk), Dec. 7, 2011 by Alexander Schliep at DIMACS, Rutgers http://dimacs.rutgers.edu/Workshops/Medicine/program.html (Invited Talk).