Parallel Motif Search using ParSeq

Modern methods in molecular biology produce a tremendous 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 experiments show that with this parallel algorithm a considerable improvement upon the sequential motif search algorithm is achieved.

[1]  E. Lusk,et al.  An abstract-device interface for implementing portable parallel-I/O interfaces , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

[2]  Alex Rapaport,et al.  Mpi-2: extensions to the message-passing interface , 1997 .

[3]  Rajeev Thakur,et al.  Users guide for ROMIO: A high-performance, portable MPI-IO implementation , 1997 .

[4]  W Rosenstiel,et al.  ParSeq: searching motifs with structural and biochemical properties. , 2004, Bioinformatics.

[5]  Dror G. Feitelson,et al.  Mpi-io: a parallel file i/o interface for mpi , 1995 .

[6]  David L. Wheeler,et al.  GenBank , 2015, Nucleic Acids Res..

[7]  Wolfgang Rosenstiel,et al.  TPO++: an object-oriented message-passing library in C++ , 2000, Proceedings 2000 International Conference on Parallel Processing.

[8]  Hideaki Sugawara,et al.  DNA Data Bank of Japan (DDBJ) in collaboration with mass sequencing teams , 2000, Nucleic Acids Res..

[9]  Evelyn Camon,et al.  The EMBL Nucleotide Sequence Database , 2000, Nucleic Acids Res..

[10]  Wolfgang Rosenstiel,et al.  Parallel I/O in an Object-Oriented Message-Passing Library , 2004, PVM/MPI.

[11]  Rajeev Thakur,et al.  Users Guide for ROMIO: A High-Performance , 1997 .

[12]  Robert B. Ross,et al.  PVFS: A Parallel File System for Linux Clusters , 2000, Annual Linux Showcase & Conference.