Cargando…
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The most widely used algorithms for finding motifs obtain a generative probabilistic representation of these over-represented s...
Autores principales: | Reddy, Chandan K, Weng, Yao-Chung, Chiang, Hsiao-Dong |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1687185/ https://www.ncbi.nlm.nih.gov/pubmed/17129371 http://dx.doi.org/10.1186/1748-7188-1-23 |
Ejemplares similares
-
Refinement and prediction of protein prenylation motifs
por: Maurer-Stroh, Sebastian, et al.
Publicado: (2005) -
AGeNNT: annotation of enzyme families by means of refined neighborhood networks
por: Kandlinger, Florian, et al.
Publicado: (2017) -
SMOTIF: efficient structured pattern and profile motif search
por: Zhang, Yongqiang, et al.
Publicado: (2006) -
Detecting DNA regulatory motifs by incorporating positional trends in information content
por: Kechris, Katherina J, et al.
Publicado: (2004) -
Refining the Content of the AGEC Accreditation Handbook
por: Schafer, Donna, et al.
Publicado: (2021)