iGibbs: improving Gibbs motif sampler for proteins by sequence clustering and iterative pattern sampling.
The motif prediction problem is to predict short, conserved subsequences that are part of a family of sequences, and it is a very important biological problem. Gibbs is one of the first successful motif algorithms and it runs very fast compared with other algorithms, and its search behavior is based on the well-studied Gibbs random sampling. However, motif prediction is a very difficult problem and Gibbs may not predict true motifs in some cases. Thus, the authors explored a possibility of improving the prediction accuracy of Gibbs while retaining its fast runtime performance. In this paper, the authors considered Gibbs only for proteins, not for DNA binding sites. The authors have developed iGibbs, an integrated motif search framework for proteins that employs two previous techniques of their own: one for guiding motif search by clustering sequences and another by pattern refinement. These two techniques are combined to a new double clustering approach to guiding motif search. The unique feature of their framework is that users do not have to specify the number of motifs to be predicted when motifs occur in different subsets of the input sequences since it automatically clusters input sequences into clusters and predict motifs from the clusters. Tests on the PROSITE database show that their framework improved the prediction accuracy of Gibbs significantly. Compared with more exhaustive search methods like MEME, iGibbs predicted motifs more accurately and runs one order of magnitude faster.
Kim
Sun
S
School of Informatics, Indiana University, Indiana 47408, USA. sunkim2@indiana.edu
Wang
Zhiping
Z
Dalkilic
Mehmet
M
D000465:Algorithms; D000595:Amino Acid Sequence; D007091:Image Processing, Computer-Assisted; D008958:Models, Molecular; D010363:Pattern Recognition, Automated; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry*; D016415:Sequence Alignment
D011506:Proteins