Abstract:
Motif Finding is one of the topmost concerns on the basis of characteristics
of the species and its primary concept is finding the common DNA sequence
that specifies a certain characteristics of a species. In this thesis, here we
propose a methodology of finding method using an algorithm called nondeterministic
finite automata. Our primary concern is finding the best
common sequence that follows the pattern and gives an accurate result with
minimization of errors. And following that solving complexity issue that
occurs in automaton system, we try to minimize the system time and space
complexity so that it can find pattern with less storage needed. Using nondeterministic
approach so far we provided a better solution approach with
patterns both in matched and gapped situation.
