Gupta, M. (2007) Generalized hierarchical markov models for the discovery of length-constrained sequence features from genome tiling arrays. Biometrics, 63(3), pp. 797-805. (doi: 10.1111/j.1541-0420.2007.00760.x)
Full text not currently available from Enlighten.
Abstract
A generalized hierarchical Markov model for sequences that contain length-restricted features is introduced. This model is motivated by the recent development of high-density tiling array data for determining genomic elements of functional importance. Due to length constraints on certain features of interest, as well as variability in probe behavior, usual hidden Markov-type models are not always applicable. A robust Bayesian framework that can incorporate length constraints, probe variability, and bias is developed. Moreover, a novel recursion-based Monte Carlo algorithm is proposed to estimate the parameters and impute hidden states under length constraints. Application of this methodology to yeast chromosomal arrays demonstrate substantial improvement over currently existing methods in terms of sensitivity as well as biological interpretability.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Gupta, Professor Mayetri |
| Authors: | Gupta, M. |
| College/School: | College of Science and Engineering > School of Mathematics and Statistics > Statistics |
| Journal Name: | Biometrics |
| ISSN: | 0006-341X |
| ISSN (Online): | 1541-0420 |
| Published Online: | 20 March 2007 |
University Staff: Request a correction | Enlighten Editors: Update this record
Deposit and Record Details
Deposit and Record Details