الفهرس 
Challenges of BioinformaticsOnly 14 pages are availabe for public view
 |  | from | 107 |  |  |
| | | from | 107 | | |
Abstract
Gene expression regulation is a major challenge in biology. One aspect of such a challenge is the binding sites in DNA, called motifs. DNA motif finding still poses a great challenge for computer scientists and biologists. As a result, a large number of motif finding algorithms are already implemented. However, the literature has proven this task to be complex The present thesis tends to find a solution for the motif finding problem through rearranging data in a manner that can help obtain the targeted motif easily by adopting the dynamic programming concept. It proposes an efficient algorithm, which we call Pattern Position Motif Finding (PPMF), aiming at finding all identical string motifs, which appear in a single sequence or multi sequences at least twice or a greater number of times.