Cargando…
Repulsive parallel MCMC algorithm for discovering diverse motifs from large sequence sets
Motivation: The motif discovery problem consists of finding recurring patterns of short strings in a set of nucleotide sequences. This classical problem is receiving renewed attention as most early motif discovery methods lack the ability to handle large data of recent genome-wide ChIP studies. New...
Autores principales: | Ikebata, Hisaki, Yoshida, Ryo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4426842/ https://www.ncbi.nlm.nih.gov/pubmed/25583120 http://dx.doi.org/10.1093/bioinformatics/btv017 |
Ejemplares similares
-
Accelerating MCMC algorithms
por: Robert, Christian P., et al.
Publicado: (2018) -
Bayesian molecular design with a chemical language model
por: Ikebata, Hisaki, et al.
Publicado: (2017) -
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
por: Hu, Jianjun, et al.
Publicado: (2006) -
Employing MCMC under the PPL framework to analyze sequence data in large pedigrees
por: Huang, Yungui, et al.
Publicado: (2013) -
Automated model calibration with parallel MCMC: Applications for a cardiovascular system model
por: Argus, Finbar, et al.
Publicado: (2022)