Motif search is the problem of identifying biolog-ically significant parts from large datasets. Severalversions of motif search have been proposed in the lit-erature. Numerous algorithms are also available. Sincethe general problem of finding patterns in sequences isintractable, motif search instances that can be solvedin practice are severely constrained. In this paper wepropose parallel algorithms for these problems so as torelax the constraints.
展开▼
