Year: 2010
Type: article
Abstract: - There is an emerging paradigm in the field of computing towards parallelism at increasing levels. Among these, multi-core processors are fast becoming the norm in the world of modern computers. The potential enhancement in performance would allow certain fundamental procedures in molecular biology, such as biological sequence alignments of DNA and protein sequences, to be done faster, paving the way for more efficient multiple genome comparison. However, in order to harness the full power of multi-core processors, effective parallel algorithms are needed. This work aimed to develop a suitable parallel longest common subsequence (LCS) algorithm for pairwise sequence alignment. The proposed parallel LCS (PLCS) performed approximately 23-30% better than the traditional serial LCS, when using the median run-time as the measure.
Author: Pich Tantichukaitikul
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2187972332