Abstract: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. An experimental study of this algorithm has yielded promising results.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.