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 challen...
Main Authors: | Chunxiao Sun, Hongwei Huo, Qiang Yu, Haitao Guo, Zhigang Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | BioMed Research International |
Online Access: | http://dx.doi.org/10.1155/2015/853461 |
Similar Items
-
PairMotif: A new pattern-driven algorithm for planted (l, d) DNA motif search.
by: Qiang Yu, et al.
Published: (2012-01-01) -
SMCis: An Effective Algorithm for Discovery of Cis-Regulatory Modules.
by: Haitao Guo, et al.
Published: (2016-01-01) -
PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets
by: Qiang Yu, et al.
Published: (2016-01-01) -
Discovery of DNA Motif Utilising an Integrated Strategy Based on Random Projection and Particle Swarm Optimization
by: Hongwei Ge, et al.
Published: (2019-01-01) -
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
by: Qiang Yu, et al.
Published: (2018-06-01)