Advertisement
Published in:
2005 | OriginalPaper | Chapter
An Improved Gibbs Sampling Algorithm for Finding TFBS
Authors : Caisheng He, Xianhua Dai
Published in: Computational Intelligence and Security
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.