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
Subjects:	QP 624 .M6 2009 Mohd Nordin Abdul Rahman A guided dynamic programming approach for DNA sequence similarity search DNA
Online Access:	http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/1/QP%20624%20.M6%202009%20Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/2/QP%20624%20.M6%202009%20FullText.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-umt-ir.-763
record_format	uketd_dc
spelling	my-umt-ir.-7632016-03-11T20:24:59Z A guided dynamic programming approach for DNA sequence similarity search Mohd Nordin Abdul Rahman 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. Fakulti Sains dan Teknologi 2009-03 Thesis http://hdl.handle.net/123456789/763 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/3/license.txt ecca7a0b60eabbf88d99eae3662e2d50 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/1/QP%20624%20.M6%202009%20Abstract.pdf 5e396ded164894abffb5cb987a326fbb http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/2/QP%20624%20.M6%202009%20FullText.pdf b70d9b0809ab12b59e46c0968ccf31ed http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/4/QP%20624%20.M6%202009%20Abstract.pdf.txt 43b156d466b2e1ce25fb9ddec3a94055 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/5/QP%20624%20.M6%202009%20FullText.pdf.txt 79d6816c587c3b9132667c031ff90e84 QP 624 .M6 2009 Mohd Nordin Abdul Rahman A guided dynamic programming approach for DNA sequence similarity search DNA
institution	Universiti Malaysia Terengganu
collection	UMT Repository System
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
granting_institution	Fakulti Sains dan Teknologi
url	http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/1/QP%20624%20.M6%202009%20Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/763/2/QP%20624%20.M6%202009%20FullText.pdf
_version_	1747835878961577984

A guided dynamic programming approach for DNA sequence similarity search

Similar Items