An OpenMP-based tool for finding longest common subsequence in bioinformatics

Finding the longest common subsequence (LCS) among sequences is NP-hard. This is an important problem in bioinformatics for DNA sequence alignment and pattern discovery. In this research, we propose new CPU-ba...

Source: BMC Research Notes - April 11, 2019 Category: Research Authors: Rayhan Shikder, Parimala Thulasiraman, Pourang Irani and Pingzhao Hu Tags: Research note Source Type: research