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

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 terms of...

Descripción completa

Detalles Bibliográficos
Autores principales: Shikder, Rayhan, Thulasiraman, Parimala, Irani, Pourang, Hu, Pingzhao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2019
Materias:
Research Note
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6458724/
https://www.ncbi.nlm.nih.gov/pubmed/30971295
http://dx.doi.org/10.1186/s13104-019-4256-6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6458724/
https://www.ncbi.nlm.nih.gov/pubmed/30971295
http://dx.doi.org/10.1186/s13104-019-4256-6

Ejemplares similares