Аннотация
In the area of bio-informatics and pattern recognition, sequence alignment and pattern matching are important operations, respectively. Finding the Longest Common Subsequence( LCS) plays an essential role in sequential alignment and pattern matching operations. The longest common subsequence problem is generally solved using the dynamic programming paradigm. It takes a considerable amount of time to solve the LCS problem for the large inputs, especially when executed sequentially. Now every computer system is equipped with multicore architectures, and this system supports parallelization. In recent years, several methods have been proposed to solve LCS, which exploits parallelism for faster execution. In this paper, we explore a hybrid parallel approach to solve the LCS problem efficiently and faster. The proposed method uses two levels of parallelism: Message Passing Interface(MPI) and OpenMPAPI. The experiment results show that the proposed method outperformed the sequential method and the OpenMP-based diagonal parallelization method.