Performance analysis of Needleman-Wunsch Algorithm (Global) and Smith-Waterman Algorithm (Local) in reducing search space and time for dna sequence alignment
Saved in:
Main Authors: | Muhamad, F.N., Ahmad, R.B., Asi, S.M., Murad, M.N. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://eprints.unisza.edu.my/1653/1/FH03-FIK-18-14489.jpg http://eprints.unisza.edu.my/1653/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
by: Fatimah Noni, Muhamad
Published: (2014) -
An Enhanced Flower Pollination Algorithm For Multiple Sequence Alignment
by: Hussein, Ahmad Moh’d Aziz Issa
Published: (2020) -
A Multidimensional Search Space Using Interactive Genetic Algorithm
by: Farooq, H., et al.
Published: (2010) -
Anchor Point Approach For Initial
Population Of Bat Algorithm For
Protein Multiple Sequence Alignment
by: Boraik Ali, Aziz Nasser
Published: (2016) -
Modified Parameters of Harmony Search Algorithm for Better Searching
by: Nur Farraliza, Mansor, et al.
Published: (2017)