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

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.

@article{Bonny2015,
  title     = {A Hybrid Heuristic/Deterministic Dynamic Programing Technique for Fast Sequence Alignment},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {6},
  number    = {8},
  year      = {2015},
  publisher = {The Science and Information Organization},
  author    = {Talal Bonny},
  doi       = {10.14569/IJACSA.2015.060830},
  url       = {https://doi.org/10.14569/IJACSA.2015.060830}
}