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: | |
|---|---|
| Corporate Author: | |
| 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!
|
System Under Maintenance
Our Library Management System is currently under maintenance.
Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance: