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 …

We consider the planted (I, d) motif search problem, which consists of finding a substring of
length I that occurs in a set of input sequences {si,..., sn} with up to d errors, a problem that …

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 …

Personalized diagnosis of chronic disease requires capturing the continual pattern across
the biological sequence. This repeating pattern in medical science is called “Motif”. Motifs …

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 …

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 …

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 …

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 …

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 …

We propose a new algorithm, PMS6, for the (l, d)-motif discovery problem in which we are to
find all strings of length l that appear in every string of a given set of strings with at most d …