Jerlin C. Merlin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Planted (l, d) Motif Search is one of the well studied problems in computational biology. Two kinds of algorithms for solving this problem can be found in the literature, namely, exact and approximate. We introduce a third kind, namely, randomized algorithms with an estimate on the probability of identifying the planted motif. We present one such algorithm.(More)
  • 1