An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery
Amannah Constance Izuchukwu,
Ernest Chukwuka Ukwosah
Issue:
Volume 3, Issue 4, December 2018
Pages:
67-73
Received:
29 May 2018
Accepted:
27 June 2018
Published:
7 March 2019
DOI:
10.11648/j.ijssam.20180304.11
Downloads:
Views:
Abstract: 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.
Abstract: 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 b...
Show More
