A guided dynamic programming approach for DNA sequence similarity search
DNA sequence similarity search is an important task in computational biology applications. Similarity search procedure is executed by an alignment process between query and targeted sequences. An optimal alignment process based on the dynamic programming algorithms has shown to have 0(n x m) time an...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 出版: |
Fakulti Sains dan Teknologi
2011
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/123456789/763 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|