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...

Descripción completa

Detalles Bibliográficos
Autores principales: Ikebata, Hisaki, Yoshida, Ryo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2015
Materias:
Original Papers
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

Internet

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