Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Author: Mohd Nordin Abdul Rahman
Format: Thesis
Published: Fakulti Sains dan Teknologi 2011
Subjects:
QP 624 .M6 2009
Mohd Nordin Abdul Rahman
A guided dynamic programming approach for DNA sequence similarity search
DNA
Online Access:http://hdl.handle.net/123456789/763
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.umt.ir-763
record_format eprints
spelling my.umt.ir-7632016-03-11T20:24:59Z A guided dynamic programming approach for DNA sequence similarity search Mohd Nordin Abdul Rahman QP 624 .M6 2009 Mohd Nordin Abdul Rahman A guided dynamic programming approach for DNA sequence similarity search DNA 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 and space complexity. Heuristics algorithms can process a fast DNA sequence alignment, but generate low comparison sensitivity. 2011-06-07T06:35:12Z 2011-06-07T06:35:12Z 2009-03 Thesis http://hdl.handle.net/123456789/763 application/pdf application/pdf Fakulti Sains dan Teknologi
institution Universiti Malaysia Terengganu
building Perpustakaan Sultanah Nur Zahirah
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Terengganu
content_source UMT-IR
url_provider http://umt-ir.umt.edu.my:8080/
topic QP 624 .M6 2009
Mohd Nordin Abdul Rahman
A guided dynamic programming approach for DNA sequence similarity search
DNA
spellingShingle QP 624 .M6 2009
Mohd Nordin Abdul Rahman
A guided dynamic programming approach for DNA sequence similarity search
DNA
Mohd Nordin Abdul Rahman
A guided dynamic programming approach for DNA sequence similarity search
description 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 and space complexity. Heuristics algorithms can process a fast DNA sequence alignment, but generate low comparison sensitivity.
format Thesis
author Mohd Nordin Abdul Rahman
author_facet Mohd Nordin Abdul Rahman
author_sort Mohd Nordin Abdul Rahman
title A guided dynamic programming approach for DNA sequence similarity search
title_short A guided dynamic programming approach for DNA sequence similarity search
title_full A guided dynamic programming approach for DNA sequence similarity search
title_fullStr A guided dynamic programming approach for DNA sequence similarity search
title_full_unstemmed A guided dynamic programming approach for DNA sequence similarity search
title_sort guided dynamic programming approach for dna sequence similarity search
publisher Fakulti Sains dan Teknologi
publishDate 2011
url http://hdl.handle.net/123456789/763
_version_ 1738395544636620800
score 13.160551

Similar Items