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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|