An improved gibbs sampling algorithm for finding TFBS

  • Authors:

  • Caisheng He;Xianhua Dai

  • Affiliations:

  • Department of Electronic & Communications Engineering, School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China;Department of Electronic & Communications Engineering, School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China

  • Venue:
  • CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computational methods detecting the transcription factor binding sites (TFBS) remain one of the most intriguing and challenging subjects in bioinformatics. Gibbs sampling is essentially a heuristic method, and it is easy to trap into a nonoptimal “local maximum”. To overcome this problem and to improve the accuracy and sensitivity of the algorithm, we present an improved Gibbs sampling strategy MPWMGMS to search for TFBS. We have tested MPWMGMS and other existing Gibbs sampling algorithms on simulated data and real biological data sets with regulatory elements. The results indicate that MPWMGMS has better performance than other methods to a great extent in accuracy and sensitivity of finding true TFBS.