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:
Main Author: | Mohd Nordin Abdul Rahman |
---|---|
Format: | Thesis |
Published: |
Fakulti Sains dan Teknologi
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/123456789/763 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Ant Colony System for Solving DNA Sequence Design Problem in DNA Computing
by: Farhaana, Yakop, et al.
Published: (2013) -
High performance systolic array core architecture design for DNA sequencer
by: Dayana, Saiful Nurdin, et al.
Published: (2020) -
Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
by: Fatimah Noni, Muhamad
Published: (2014) -
Embedded System for Exon Predictor at DNA Sequences Using Hidden Markov Model
by: H. H. Arifin, et al.
Published: (2013) -
Formal specification and validation for pattern scanning
by: Julaily Aida Jusoh
Published: (2012)