Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/763
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohd Nordin Abdul Rahman-
dc.date.accessioned2011-06-07T06:35:12Z-
dc.date.available2011-06-07T06:35:12Z-
dc.date.issued2009-03-
dc.identifier.urihttp://hdl.handle.net/123456789/763-
dc.description.abstractDNA 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.en_US
dc.publisherFakulti Sains dan Teknologien_US
dc.subjectQP 624 .M6 2009en_US
dc.subjectMohd Nordin Abdul Rahmanen_US
dc.subjectA guided dynamic programming approach for DNA sequence similarity searchen_US
dc.subjectDNAen_US
dc.titleA guided dynamic programming approach for DNA sequence similarity searchen_US
dc.typeThesisen_US
Appears in Collections:Fakulti Sains dan Teknologi

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


Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.