|
Parallel Pairwise Sequence Alignment Algorithm Based on Longest Common Subsequence |
|---|---|
| รหัสดีโอไอ | |
| Creator | Pich Tantichukaitikul |
| Title | Parallel Pairwise Sequence Alignment Algorithm Based on Longest Common Subsequence |
| Contributor | Sattara Hattirat, Hoyin Jonathan Chan |
| Publisher | Faculty of Information Science and Technology, Mahanakorn University of Technology |
| Publication Year | 2553 |
| Journal Title | Journal of Information Science and Technology |
| Journal Vol. | 1 |
| Journal No. | 2 |
| Page no. | 1-10 |
| Keyword | Parallel algorithm, longest common, longest common subsequence, biological sequence alignment, computational biology, multi-core processing |
| URL Website | https://tci-thaijo.org/index.php/JIST |
| Website title | Journal of Information Science and Technology |
| ISSN | 2651-1053 |
| 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. |
