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...
Saved in:
Main Author: | Mohd Nordin Abdul Rahman |
---|---|
Format: | Thesis |
Subjects: | |
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!
|
Similar Items
-
Reducing the search space and time complexity of needleman-wunsch algorithm (global alignment) and smith waterman algorithm (local alignment) for DNA sequence alignment
by: Fatimah Noni, Muhamad -
Formal specification and validation for pattern scanning
by: Julaily Aida Jusoh -
Pemencilan dan penjujukan klon-klon cDNA yang mengekodkan 9-stearoil-ACP desaturase dan B-ketoasil-ACP sintase I kelapa sawit /
by: Omar A. Rashid
Published: (1997) -
Oenjujukan dan analisis DNA selitan burkhoderia pseudomallei yang membawa gen protease putatif di dalam escherichia coli rekombinan /
by: Khairina Tajul Arifin
Published: (2000) -
Subcloning and molecular analysis of a DNA fragment of recombinant genomic clone HAS113 encoding for hyaluronan synthase from Streptococcus equi /
by: Nur Fariza Jaffar
Published: (2010)