Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
The fundamental procedure of analyzing sequence content is sequence comparison. Sequence comparison can be defined as the problem of finding which parts of the sequences are similar and which parts are different, namely comparing two sequences to identify similarities and differences between them....
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 主題: | |
| 在線閱讀: | http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/31259/1/Page%201-24.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/31259/2/Full%20text.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|