[HTML][HTML] Review of different sequence motif finding algorithms
The DNA motif discovery is a primary step in many systems for studying gene function. Motif
discovery plays a vital role in identification of Transcription Factor Binding Sites (TFBSs) that …
discovery plays a vital role in identification of Transcription Factor Binding Sites (TFBSs) that …
A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq data
NTL Tran, CH Huang - Biology direct, 2014 - Springer
ChIP-Seq (chromatin immunoprecipitation sequencing) has provided the advantage for
finding motifs as ChIP-Seq experiments narrow down the motif finding to binding site …
finding motifs as ChIP-Seq experiments narrow down the motif finding to binding site …
A modified Henry gas solubility optimization for solving motif discovery problem
The DNA motif discovery (MD) problem is the main challenge of genome biology, and its
importance is directly proportional to increasing sequencing technologies. MD plays a vital …
importance is directly proportional to increasing sequencing technologies. MD plays a vital …
Finding motifs in biological sequences using the micron automata processor
Finding approximately conserved sequences, called motifs, across multiple DNA or protein
sequences is an important problem in computational biology. In this paper, we consider the …
sequences is an important problem in computational biology. In this paper, we consider the …
Efficient and accurate discovery of patterns in sequence data sets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a
large class of applications, such as biological DNA and protein motif mining, require efficient …
large class of applications, such as biological DNA and protein motif mining, require efficient …
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
Background Motifs are patterns found in biological sequences that are vital for
understanding gene function, human disease, drug design, etc. They are helpful in finding …
understanding gene function, human disease, drug design, etc. They are helpful in finding …
Efficient sequential and parallel algorithms for planted motif search
M Nicolae, S Rajasekaran - BMC bioinformatics, 2014 - Springer
Background Motif searching is an important step in the detection of rare events occurring in
a set of DNA or protein sequences. One formulation of the problem is known as (l, d)-motif …
a set of DNA or protein sequences. One formulation of the problem is known as (l, d)-motif …
A new exhaustive method and strategy for finding motifs in ChIP-enriched regions
ChIP-seq, which combines chromatin immunoprecipitation (ChIP) with next-generation
parallel sequencing, allows for the genome-wide identification of protein-DNA interactions …
parallel sequencing, allows for the genome-wide identification of protein-DNA interactions …
qPMS9: an efficient algorithm for quorum planted motif search
M Nicolae, S Rajasekaran - Scientific reports, 2015 - nature.com
Discovering patterns in biological sequences is a crucial problem. For example, the
identification of patterns in DNA sequences has resulted in the determination of open …
identification of patterns in DNA sequences has resulted in the determination of open …
qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences
Detection of rare events happening in a set of DNA/protein sequences could lead to new
biological discoveries. One kind of such rare events is the presence of patterns called motifs …
biological discoveries. One kind of such rare events is the presence of patterns called motifs …