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!
|
| Summary: | 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. |
|---|---|
| Physical Description: | 217 pages illustrations 30 cm |
| Bibliography: | Includes bibliographical references (pages 191-196). |