A Hybrid Heuristic/Deterministic Dynamic Programing Technique for Fast Sequence Alignment

Abstract

Dynamic programming seeks to solve complex problems by breaking them down into multiple smaller problems. The solutions of these smaller problems are then combined to reach the overall solution. Deterministic algorithms have the advantage of accuracy but they need large computational power requirements. Heuristic algorithms have the advantage of speed but they provide less accuracy. This paper presents a hybrid design of dynamic programing technique that is used for sequence alignment. Our technique combines the advantages of deterministic and heuristic algorithms by delivering the optimal solution in suitable time. we implement our design on a Xilinx Zynq-7000 Artix-7 FPGA and show that our implementation improves the performance of sequence alignment by 63% for in comparison to the traditional known methods.

Authors and Affiliations

Talal Bonny

Keywords

Related Articles

Towards the Performance Investigation of Automatic Melanoma Diagnosis Applications

Melanoma is a type of skin cancer, one of the fatal diseases, that appears as an abnormal growth of skin cells and the lesion part often looks like a mole on the skin. Early detection of melanoma from skin lesion by mean...

AL-S[sup]2[/sup]m: Soft road traffic Signs map for vehicular systems

In this paper, we describe AL-S[sup]2[/sup]m, a roadmap with traffic signs to be used in vehicular systems. AL-S[sup]2[/sup]m is part of a more general system of traffic signs (TSs) management, called AL-S[sup]2[/sup], w...

Interest Reduction and PIT Minimization in Content Centric Networks

Content Centric Networking aspires to a more efficient use of the Internet through in-path caching, multi-homing, and provisions for state maintenance and intelligent forwarding at the CCN routers. However, these benefit...

A Competency-Based Ontology for Learning Design Repositories

Learning designs are central resources for educational environments because they provide the organizational structure of learning activities; they are concrete instructional methods. We characterize each learning design...

Concurrent Edge Prevision and Rear Edge Pruning Approach for Frequent Closed Itemset Mining

Past observations have shown that a frequent item set mining algorithm are purported to mine the closed ones because the finish provides a compact and a whole progress set and higher potency. Anyhow, the newest closed it...

Download PDF file
  • EP ID EP148462
  • DOI 10.14569/IJACSA.2015.060830
  • Views 96
  • Downloads 0

How To Cite

Talal Bonny (2015). A Hybrid Heuristic/Deterministic Dynamic Programing Technique for Fast Sequence Alignment. International Journal of Advanced Computer Science & Applications, 6(8), 224-232. https://www.europub.co.uk/articles/-A-148462