Solving Planted Motif Problem on GPU

Abstract

(l, d) planted motif problem is defined as: Given a sequence of n DNA sequences, each of length L, find M , the set of sequences(or motifs) of length l which have at-least one dneighbor in each of the n sequences. Planted motif problem is an important and well-studied problem in computational biology. Motif finding is useful for developing methods to obtain… (More)

Topics

5 Figures and Tables