A Gibbs sampling algorithm for variable-length motif discovery
From MaRDI portal
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
Cited in
(6)- scientific article; zbMATH DE number 1615291 (Why is no real title available?)
- Motif Yggdrasil: Sampling from a Tree Mixture Model
- A more elaborate mixture model for motif discovery of the biological sequences
- Discovery of Conserved Sequence Patterns Using a Stochastic Dictionary Model
- Sampling motifs on phylogenetic trees
- A Bayesian Insertion/Deletion Algorithm for Distant Protein Motif Searching via Entropy Filtering
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)