An Affinity Propagation-Based DNA Motif Discovery Algorithm
The planted (l, d) motif search (PMS) is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs) in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challe...
Main Authors: | Sun, Chunxiao, Huo, Hongwei, Yu, Qiang, Guo, Haitao, Sun, Zhigang |
---|---|
Format: | Online |
Language: | English |
Published: |
Hindawi Publishing Corporation
2015
|
Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4547008/ |
Similar Items
-
PairMotif+: A Fast and Effective Algorithm for De Novo Motif Discovery in DNA sequences
by: Yu, Qiang, et al.
Published: (2013) -
SMCis: An Effective Algorithm for Discovery of Cis-Regulatory Modules
by: Guo, Haitao, et al.
Published: (2016) -
PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search
by: Yu, Qiang, et al.
Published: (2012) -
PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets
by: Yu, Qiang, et al.
Published: (2016) -
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
by: Qiang Yu, et al.
Published: (2018-06-01)