J. Qin, S. Pinkenburg, and W. Rosenstiel (Germany)
Motif Search, Parallel, Sequence, Load Balancing, Bioin formatics
Modern methods in molecular biology produce a tremen dous amount of data. As a consequence, efficient methods have to be developed to retrieve and analyze these data. In this article, a parallel algorithm searching motifs based on ParSeq, a software tool for motif search, is put forward and its performance analyzed and discussed. Many experi ments show that with this parallel algorithm a considerable improvement upon the sequential motif search algorithm is achieved.
Important Links:
Go Back
