You are not currently logged in.
Access JSTOR through your library or other institution:
A Bayesian Insertion/Deletion Algorithm for Distant Protein Motif Searching via Entropy Filtering
Jun Xie, Ker-Chau Li and Minou Bina
Journal of the American Statistical Association
Vol. 99, No. 466 (Apr., 2004), pp. 409-420
Stable URL: http://www.jstor.org/stable/27590397
Page Count: 12
You can always find the topics here!Topics: Proteins, Entropy, Amino acids, Algorithms, Datasets, DNA, Basic helix loop helix transcription factors, Simulations, Humans, Bayesian networks
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Bayesian models have been developed that find ungapped motifs in multiple protein sequences. In this article, we extend the model to allow for deletions and insertions in motifs. Direct generalization of the ungapped algorithm, based on Gibbs sampling, proved unsuccessful because the configuration space became much larger. To alleviate the convergence difficulty, a two-stage procedure is introduced. At the first stage, we develop a method called entropy filtering, which quickly searchs "good" starting points for the alignment approach without the concern of deletion/insertion patterns. At the second stage, we switch to an algorithm that generates both a random vector that represents insertion/deletion patterns and a random variable of motif locations. After the two steps, gapped-motif alignments are obtained for multiple sequences. When applied to datasets that consist of helix—loop—helix proteins and high mobility group proteins, respectively, our methods show great improvements over those that produce ungapped alignments.
Journal of the American Statistical Association © 2004 American Statistical Association