title: Detection of dispersed short tandem repeats using reversible jump Markov chain Monte Carlo.
abstract: Tandem repeats occur frequently in biological sequences. They are important for studying genome evolution and human disease. A number of methods have been designed to detect a single tandem repeat in a sliding window. In this article, we focus on the case that an unknown number of tandem repeat segments of the same pattern are dispersively distributed in a sequence. We construct a probabilistic generative model for the tandem repeats, where the sequence pattern is represented by a motif matrix. A Bayesian approach is adopted to compute this model. Markov chain Monte Carlo (MCMC) algorithms are used to explore the posterior distribution as an effort to infer both the motif matrix of tandem repeats and the location of repeat segments. Reversible jump Markov chain Monte Carlo (RJMCMC) algorithms are used to address the transdimensional model selection problem raised by the variable number of repeat segments. Experiments on both synthetic data and real data show that this new approach is powerful in detecting dispersed short tandem repeats. As far as we know, it is the first work to adopt RJMCMC algorithms in the detection of tandem repeats.
authors: Department of Information Engineering, Chinese University of Hong Kong, Shatin, New Territories, Hong Kong.
authors: Tong
authors: T
authors: Liang
authors: Xiaodan
authors: X
authors: Fan
authors: Qiwei
authors: Q
authors: Li
authors: Shuo-Yen R
authors: SY
authors: Li
mesh_terms: D000465:Algorithms; D008390:Markov Chains; D018895:Microsatellite Repeats; D009010:Monte Carlo Method; D017422:Sequence Analysis, DNA