A Gibbs sampling algorithm for variable-length motif discovery
From MaRDI portal
Publication:3171083
zbMATH Open1237.62170MaRDI QIDQ3171083FDOQ3171083
Authors: Sishui Wang, Xiaolin Chen 
Publication date: 29 September 2011
Recommendations
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
- Discovering almost any hidden motif from multiple sequences
- A more elaborate mixture model for motif discovery of the biological sequences
- Discovery of Conserved Sequence Patterns Using a Stochastic Dictionary Model
- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
Applications of statistics to biology and medical sciences; meta analysis (62P10) General biology and biomathematics (92B05)
Cited In (6)
- Sampling motifs on phylogenetic trees
- A more elaborate mixture model for motif discovery of the biological sequences
- A Bayesian Insertion/Deletion Algorithm for Distant Protein Motif Searching via Entropy Filtering
- Motif Yggdrasil: Sampling from a Tree Mixture Model
- Title not available (Why is that?)
- Discovery of Conserved Sequence Patterns Using a Stochastic Dictionary Model
This page was built for publication: A Gibbs sampling algorithm for variable-length motif discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171083)
