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 …

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 …

Motif search is a fundamental problem in bioinformatics with an important application in
locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms …

Background Given a set of tn-length DNA sequences, q satisfying 0< q≤ 1, and l and d
satisfying 0≤ d< l< n, the quorum planted motif search (qPMS) finds l-length strings that …

A comprehensive understanding of transcription factor binding sites (TFBSs) is a key
problem in contemporary biology, which is a critical issue in gene regulation. Identifying a …

The primary aim of identifying the binding motifs in gene regulation is to understand the
transcriptional regulation molecular mechanism systematically. In this study, the (ℓ, d) motif …

Background Weak motif discovery in DNA sequences is an important but unresolved
problem in computational biology. Previous algorithms that aimed to solve the problem …

In recent years, there has been an increasing interest in planted (l, d) motif search (PMS)
with applications to discovering significant segments in biological sequences. However …

Motivation: Motifs in DNA sequences often appear in degenerate form, so there has been an
increased interest in computational algorithms for weak motif discovery. Probabilistic …

The planted motif search problem is a classical problem in bioinformatics that seeks to
identify meaningful patterns in biological sequences. As an NP-complete problem, current …