A guided dynamic programming approach for DNA sequence similarity search

Simple item page
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.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.identifier.urihttp://hdl.handle.net/123456789/763
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
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
QP 624 .M6 2009 Abstract.pdf
Size:
2.8 MB
Format:
Adobe Portable Document Format
Description:
Download
No Thumbnail Available
Name:
QP 624 .M6 2009 FullText.pdf
Size:
70.16 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Fakulti Sains dan Teknologi