Hybrid Gibbs-sampling algorithm for challenging motif discovery: GibbsDST.

Abstract excerpt

The difficulties of computational discovery of transcription factor binding sites (TFBS) are well represented by (l, d) planted motif challenge problems. Large d problems are difficult, particularly for profile-based motif discovery algorithms. Their local search in the profile space is apparently incompatible with subtle motifs and large mutational distances between the motif occurrences. Herein, an improved...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Amino Acid Motifs
• Share to Computer Simulation