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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	BMC research notes Ročník 12; číslo 1; s. 220 - 6
Hlavní autori:	Shikder, Rayhan, Thulasiraman, Parimala, Irani, Pourang, Hu, Pingzhao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London BioMed Central 11.04.2019 BioMed Central Ltd Springer Nature B.V BMC
Predmet:	Algorithms Analysis Animals Base Sequence Bees - genetics Bioinformatics Biomedical and Life Sciences Biomedicine Computational biology Computational Biology - methods Deoxyribonucleic acid DNA DNA sequence alignment DNA sequencing End users Humans LCS on MPI and OpenMP Life Sciences Longest common subsequence (LCS) Medical research Medicine/Public Health Novels Nucleotide sequence Parallel algorithms for LCS Research Note Sequence Alignment Sequence Analysis, DNA - statistics & numerical data Sequence Homology, Nucleic Acid Software Strigiformes - genetics Tool for finding LCS Viruses - genetics DNA sequence alignment Parallel algorithms for LCS Tool for finding LCS LCS on MPI and OpenMP Longest common subsequence (LCS)
ISSN:	1756-0500, 1756-0500
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!