Discovery of Conserved Sequence Patterns Using a Stochastic Dictionary Model
From MaRDI portal
Recommendations
- Detection of subtle variations as consensus motifs
- Discovering almost any hidden motif from multiple sequences
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
- A transdimensional Bayesian model for pattern recognition in DNA sequences
- A Gibbs sampling algorithm for variable-length motif discovery
Cited in
(14)- The evolution of stochastic regular motifs for protein sequences
- Computational discovery of gene regulatory binding motifs: a Bayesian perspective
- Self-organizing neural networks to support the discovery of DNA-binding motifs
- Discovering short linear protein motif based on selective training of profile hidden Markov models
- Heterogeneity in DNA multiple alignments: modeling, inference, and applications in motif finding
- A Gibbs sampling algorithm for variable-length motif discovery
- A transdimensional Bayesian model for pattern recognition in DNA sequences
- Computational Biology: Toward Deciphering Gene Regulatory Information in Mammalian Genomes
- scientific article; zbMATH DE number 1898281 (Why is no real title available?)
- Sampling motifs on phylogenetic trees
- Generalized Hierarchical Markov Models for the Discovery of Length‐Constrained Sequence Features from Genome Tiling Arrays
- A Bayesian hidden Markov model for motif discovery through joint modeling of genomic sequence and ChIP-chip data
- Context dependent models for discovery of transcription factor binding sites
- A note on independence assumption on binding sites in biological sequence analysis
This page was built for publication: Discovery of Conserved Sequence Patterns Using a Stochastic Dictionary Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4468523)
