An OpenMP-based tool for finding longest common subsequence in bioinformatics
Abstract Objective 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-based parallel implementations that can provide significant advantages in...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2019-04-01
|
| Series: | BMC Research Notes |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13104-019-4256-6 |