Performance analysis of Needleman-Wunsch Algorithm (Global) and Smith-Waterman Algorithm (Local) in reducing search space and time for dna sequence alignment

Muhamad, F.N. and Ahmad, R.B. and Asi, S.M. and Murad, M.N. (2018) Performance analysis of Needleman-Wunsch Algorithm (Global) and Smith-Waterman Algorithm (Local) in reducing search space and time for dna sequence alignment. In: 1st International Conference on Green and Sustainable Computing, ICoGeS 2017, 25-27 Nov 2017, Kuching, Sarawak.

[img] Image
FH03-FIK-18-14489.jpg
Restricted to Registered users only

Download (144kB)
Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 19 Nov 2020 04:13
Last Modified: 19 Nov 2020 04:13
URI: http://eprints.unisza.edu.my/id/eprint/1653

Actions (login required)

View Item View Item