Developing a motif finding algorithm using Suffix Tree and Hash Table

Motif searching is a widely used technique of Bioinformatics - an interdisciplinary field of Computer Science and Biology. It is implemented in various approaches to find out recurring patterns in DNA sequences that are presumed to have biological functions of humans. The motif is extensively used for drug design, human genome understanding project, and human disease research, etc. The main objective of this thesis is to develop an algorithm that would enable us to find the best motif from a DNA sequence within a short period of time. To construct a targeted algorithm, primarily a suffix tree and a hash table were used for finding the desired Motif and its frequency of occurrence in the particular DNA sequence. A remarkable result was obtained from the proposed model that requires a shorter period of time than other prevailing available algorithms. Consist of less complexity and short execution time ensures this algorithm practically viable as well as it would contribute tremendously in future research of Bioinformatics.