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...
保存先:
第一著者: | Mohd Nordin Abdul Rahman |
---|---|
フォーマット: | 学位論文 |
出版事項: |
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, 等
出版事項: (2013) -
High performance systolic array core architecture design for DNA sequencer
著者:: Dayana, Saiful Nurdin, 等
出版事項: (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, 等
出版事項: (2013) -
Formal specification and validation for pattern scanning
著者:: Julaily Aida Jusoh
出版事項: (2012)