Cargando…
PairMotif+: A Fast and Effective Algorithm for De Novo Motif Discovery in DNA sequences
The planted (l, d) motif search is one of the most widely studied problems in bioinformatics, which plays an important role in the identification of transcription factor binding sites in DNA sequences. However, it is still a challenging task to identify highly degenerate motifs, since current algori...
Autores principales: | Yu, Qiang, Huo, Hongwei, Zhang, Yipu, Guo, Hongzhi, Guo, Haitao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Ivyspring International Publisher
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3654438/ https://www.ncbi.nlm.nih.gov/pubmed/23678291 http://dx.doi.org/10.7150/ijbs.5786 |
Ejemplares similares
-
PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search
por: Yu, Qiang, et al.
Publicado: (2012) -
An Affinity Propagation-Based DNA Motif Discovery Algorithm
por: Sun, Chunxiao, et al.
Publicado: (2015) -
PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets
por: Yu, Qiang, et al.
Publicado: (2016) -
An Entropy-Based Position Projection Algorithm for Motif Discovery
por: Zhang, Yipu, et al.
Publicado: (2016) -
RecMotif: a novel fast algorithm for weak motif discovery
por: Sun, He Quan, et al.
Publicado: (2010)