Please use this identifier to cite or link to this item:
http://umt-ir.umt.edu.my:8080/handle/123456789/763Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mohd Nordin Abdul Rahman | - |
| dc.date.accessioned | 2011-06-07T06:35:12Z | - |
| dc.date.available | 2011-06-07T06:35:12Z | - |
| dc.date.issued | 2009-03 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/763 | - |
| dc.description.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. | en_US |
| dc.publisher | Fakulti Sains dan Teknologi | en_US |
| dc.subject | QP 624 .M6 2009 | en_US |
| dc.subject | Mohd Nordin Abdul Rahman | en_US |
| dc.subject | A guided dynamic programming approach for DNA sequence similarity search | en_US |
| dc.subject | DNA | en_US |
| dc.title | A guided dynamic programming approach for DNA sequence similarity search | en_US |
| dc.type | Thesis | en_US |
| Appears in Collections: | Fakulti Sains dan Teknologi | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| QP 624 .M6 2009 Abstract.pdf | 2.87 MB | Adobe PDF | View/Open | |
| QP 624 .M6 2009 FullText.pdf Restricted Access | 71.84 MB | Adobe PDF | View/Open Request a copy |
Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated