Motif search is the problem of identifying biologically significant parts from large datasets. Several versions of motif search have been proposed in the literature. Numerous algorithms are also available. Since the general problem of finding patterns in sequences is intractable, motif search instances that can be solved in practice are severely constrained. In this paper we propose parallel algorithms for these problems so as to relax the constraints.
展开▼
