Approximate String Matching Algorithm Using Parallel Methods for Molecular Sequence Camparisons

This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity of time. The parallel program implementation has carried out in C on an available twenty processing nodes clustering architecture using a model of parallel programming systems, the MPI (message-passing interface), which is as library of subroutines. In this paper we are also concerned with reporting the speedup and efficiency measures. More precisely, we present a parallel algorithm for approximate sequence matching, showing its implementation and reporting its measures in comparison to its sequential version. We use one of the possible approaches to reduce the time spent on comparisons of molecular database sequences by distributing the data among processors, which achieves a linear speedup (time) and requires constant space memory per processor (Reis, 2001)