An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery

摘要

Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.