Parallel Guided Dynamic Programming Approach for DNA Sequence Similarity Search

Abdul Rahman, Mohd Nordin and Mohd Saman, Md Yazid and Aziz, Ahmad and M Tap, A Osman (2009) Parallel Guided Dynamic Programming Approach for DNA Sequence Similarity Search. International Journal of Computer and Electrical Engineering, 1 (4). pp. 402-409. ISSN 1793-8163

[img] Text
Restricted to Registered users only

Download (213Kb)


Development of DNA sequence comparison technique is an active research activity in computational biology application. Commonly techniques studied are dynamic programming and heuristic algorithms. Exhaustive dynamic programming algorithm produces optimal result but requires longer time and bigger space. Heuristic algorithm gives approximate results with much faster processing. We have developed a new model that improves the speed of large scale DNA sequence similarity search and at the same time the best possible alignment result is retained. The model is known as a guided dynamic programming approach for DNA sequence similarity search (FRA-Search). Two approaches are used to complete the FRA-Search model: an automaton based exact string matching algorithm is employed to skip irrelevant database sequences from being computed for dynamic programming alignment processing and; the rough sets theory has been employed to classify and reduct the dataset. This paper discusses the parallel model for FRA-Search application. The parallel FRA-Search model is implemented on PC-based cluster system. It is developed on a single program multiple data (SPMD) architecture and MPJ Express software is used as a communication interface protocol between processors.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Institute: Faculty of Informatics & Computing
Depositing User: Dr Mohd Nordin Abdul Rahman
Date Deposited: 03 Dec 2014 03:23
Last Modified: 03 Dec 2014 03:23

Actions (login required)

View Item View Item