z-logo
open-access-imgOpen Access
Performance Analysis Of Needleman-Wunsch Algorithm (Global) And Smith-Waterman Algorithm (Local) In Reducing Search Space And Time For Dna Sequence Alignment
Author(s) -
F. N. Muhamad,
Robiah Ahmad,
SM Asi,
Muhamad Nasir Murad
Publication year - 2018
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1019/1/012085
Subject(s) - smith–waterman algorithm , dynamic programming , algorithm , computer science , multiple sequence alignment , sequence (biology) , sequence alignment , speedup , alignment free sequence analysis , representation (politics) , parallel computing , biochemistry , chemistry , genetics , biology , politics , political science , law , peptide sequence , gene

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here