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:
主要作者: | Mohd Nordin Abdul Rahman |
---|---|
格式: | Thesis |
出版: |
Fakulti Sains dan Teknologi
2011
|
主题: | |
在线阅读: | http://hdl.handle.net/123456789/763 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
An Ant Colony System for Solving DNA Sequence Design Problem in DNA Computing
由: Farhaana, Yakop, et al.
出版: (2013) -
High performance systolic array core architecture design for DNA sequencer
由: Dayana, Saiful Nurdin, et al.
出版: (2020) -
Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
由: Fatimah Noni, Muhamad
出版: (2014) -
Embedded System for Exon Predictor at DNA Sequences Using Hidden Markov Model
由: H. H. Arifin, et al.
出版: (2013) -
Formal specification and validation for pattern scanning
由: Julaily Aida Jusoh
出版: (2012)