Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/763
Title: A guided dynamic programming approach for DNA sequence similarity search
Authors: Mohd Nordin Abdul Rahman
Keywords: QP 624 .M6 2009
Mohd Nordin Abdul Rahman
A guided dynamic programming approach for DNA sequence similarity search
DNA
Issue Date: Mar-2009
Publisher: Fakulti Sains dan Teknologi
Abstract: 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.
URI: http://hdl.handle.net/123456789/763
Appears in Collections:Fakulti Sains dan Teknologi

Files in This Item:
File Description SizeFormat 
QP 624 .M6 2009 Abstract.pdf2.87 MBAdobe PDFView/Open
QP 624 .M6 2009 FullText.pdf
  Restricted Access
71.84 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.