Reducing the search space and time complexity of Needleman-Wunsch Algorithm (Global Alignment) and Smith-Waterman Algorithm (Local Algorithm) for DNA sequence alignment /
The main research in this project is to align the DNA sequences by using the Needleman-Wunsch algorithm for global alignment and Smith-Waterman algorithm for local alignment based on the Dynamic Programming algorithm.
Saved in:
Main Author: | Fatimah Noni Muhamad (Author) |
---|---|
Corporate Author: | Universiti Malaysia Perlis |
Format: | Thesis Book |
Language: | English |
Published: |
Perlis, Malaysia
School of Computer and Communication Engineering
2011.
|
Subjects: | |
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 Algorithm) for DNA sequence alignment /
by: Fatimah Noni Muhamad
Published: (2011) -
Hardware acceleration of bioinformatics sequence alignment applications
by: Hasan, Laiq
Published: (2011) -
Hardware acceleration of bioinformatics sequence alignment applications
by: Hasan, Laiq
Published: (2011) -
Bioinformatics algorithms : techniques and applications /
Published: (2008) -
An introduction to bioinformatics algorithms /
by: Jones, Neil C.
Published: (2004)