Cargando…
Fast motif recognition via application of statistical thresholds
BACKGROUND: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites in genomic data. Closely related to motif recognition is the CONSENSUS STRING decision problem that asks, given a parame...
Autores principales: | Boucher, Christina, King, James |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3009483/ https://www.ncbi.nlm.nih.gov/pubmed/20122182 http://dx.doi.org/10.1186/1471-2105-11-S1-S11 |
Ejemplares similares
-
Fast and exact quantification of motif occurrences in biological sequences
por: Prosperi, Mattia, et al.
Publicado: (2021) -
Counting motifs in dynamic networks
por: Mukherjee, Kingshuk, et al.
Publicado: (2018) -
RecMotif: a novel fast algorithm for weak motif discovery
por: Sun, He Quan, et al.
Publicado: (2010) -
Sequence-Specific Recognition of DNA by Proteins: Binding Motifs Discovered Using a Novel Statistical/Computational Analysis
por: Jakubec, David, et al.
Publicado: (2016) -
Motif statistics and spike correlations in neuronal networks
por: Hu, Yu, et al.
Publicado: (2012)