A Hardware-Based Memory-Efficient Solution for Pair-Wise Compact Sequence Alignment

References

• T. F. Smith and M. S. Waterman, “Identification of common molecular subsequences,” J. Mol. Biol., Vol. 147, no. 1, pp. 195–197, 1981. DOI:10.1016/0022-2836(81)90087-5.
   PubMed Web of Science ®Google Scholar
• S. B. Needleman and C. D. Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins,” J. Mol. Biol., Vol. 48, no. 3, pp. 443–453, Mar. 1970. DOI:10.1016/0022-2836(70)90057-4.
   PubMed Web of Science ®Google Scholar
• B. D. Chuong and K. Kazutaka, “Protein multiple sequence alignment,” Methods Mol. Biol., Vol. 484, pp. 379–413, 2008. DOI:10.1007/978-1-59745-398-1.
   PubMedGoogle Scholar
• S. S. Ray, A. Banerjee, A. Datta, and S. Ghosh, “A memory efficient DNA sequence alignment technique using pointing matrix,” 2016 IEEE Region 10 Conference (TENCON), Singapore, 2016, pp. 3559–3562.
   Google Scholar
• S. F. Altschul, T. L. Madden, A. A. Schäffer, J. Zhang, Z. Zhang, W. Miller, and D. J. Lipman, Gapped BLAST and PSI-BLAST: A new generation of protein database search programs,” Nucleic. Acids. Res., Vol. 25, no. 17, pp. 3389–3402, Sep. 1997. DOI:10.1093/nar/25.17.3389.
   PubMed Web of Science ®Google Scholar
• W. R. Pearson and D. J. Lipman, “Improved tools for biological sequence comparison,” Proc. Natl. Acad. Sci. USA, Vol. 85, pp. 2444–2448, 1988. DOI:10.1073/pnas.85.8.2444.
   PubMed Web of Science ®Google Scholar
• Z. Zhi-min and C. Zhong-wen, “Dynamic programming for protein sequence alignment,” Intl. J. Bio-Sci. Bio-Tech., Vol. 5, no. 2, pp. 141–150, Apr. 2013.
   Google Scholar
• X. Huang, “A space-efficient algorithm for local similarities,” Comput. Appl. Biosci., Vol. 6, no. 4, pp. 373–381, 1990. DOI:10.1093/bioinformatics/6.4.373.
   PubMedGoogle Scholar
• S. Aluru, N. Futamura, and K. Mehrotra, “Parallel biological sequence comparison using prefix computations,” in Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, San Juan, Puerto Rico, 1999, pp. 653–659. DOI:10.1016/S0743-7315(03)00010-8.
   Google Scholar
• S. Rajko and S. Aluru, “Space and time optimal parallel sequence alignments,” IEEE Trans. Parallel Distrib. Syst., Vol. 15, no. 12, pp. 1070–1081, Dec. 2004. DOI:10.1109/TPDS.2004.86.
   Web of Science ®Google Scholar
• R. B. Batista, A. Boukerche, and A. C. M. A. Melo, “A parallel strategy for biological sequence alignment in restricted memory space,” J. Parallel Distrib. Comput., Vol. 68, pp. 548–561, 2008. DOI:10.1016/j.jpdc.2007.08.007.
   Web of Science ®Google Scholar
• E. F. D. O. Sandes, A. Boukerche, and A. C. M. A. Melo, “Parallel optimal pairwise biological sequence comparison: Algorithms, platforms, and classification,” J. ACM Comput. Surv., Vol. 48, no. 4, pp. 63:1–63:36, May 2016. DOI:10.1145/2893488.
   Web of Science ®Google Scholar
• W. Liu, B. Schmidt, G. Voss, and W. Muller-Wittig, “Streaming algorithms for biological sequence alignment on GPUs,” IEEE Trans. Parallel Distrib. Syst., Vol. 18, no. 9, pp. 1270–1281, Jun. 2007. DOI:10.1109/TPDS.2007.1059.
   Web of Science ®Google Scholar
• K. Dohi, K. Benkridt, C Ling, T. Hamada, and Y. Shibata, “Highly efficient mapping of the Smith-Waterman algorithm on CUDA-compatible GPUs,” in 21st IEEE International Conference on Application-specific System, Architectures and Processors, Rennes, France, Jul. 2010, pp. 29–36. DOI:10.1109/ASAP.2010.5540796.
   Google Scholar
• T. Oliver, B. Schmidt, D. Nathan, R. Clemens, and D. Maskell, “Using reconfigurable hardware to accelarate multiple sequence alignment with ClustalW,” Bioinform. Appl. Note, Vol. 21, no. 16, pp. 3431–3432, 2005. DOI:10.1093/bioinformatics/bti508.
   PubMed Web of Science ®Google Scholar
• K. Benkrid, A. Akoglu, C. Ling, Y. Song, and X. Tian, “High performance biological pairwise sequence alignment: FPGA versus GPU versus cell BE versus GPP,” Int. J. Reconfig. Comput., Vol. 2012, pp. 1–15, 2012. DOI:10.1155/2012/752910.
   Google Scholar
• S. Lloyd and Q. O. Snell, “Hardware accelerated sequence alignment with traceback,” Int. J. Reconfig. Comput., Vol. 2009, pp. 1–10, 2009. DOI:10.1155/2009/762362.
   Google Scholar
• S. Sarkar, G. R. Kulkarni, P. P. Pande, and A. Kalyanaraman, “Network-on-chip hardware accelerators for biological sequence alignment,” IEEE Trans. Comput., Vol. 59, no. 1, pp. 29–41, Jan. 2010. DOI:10.1109/TC.2009.133.
   Web of Science ®Google Scholar
• S. S. Ray, S. Ghosh, and R. Prasad, “Low-cost hierarchical memory-based pipelined architecture for DNA sequence matching,” in 2014 Annual IEEE India Conference (INDICON), Pune, Dec. 2014, pp. 1–6. DOI:10.1109/INDICON.2014.7030681.
   Google Scholar
• S. Ghosh, S. Mandal, and S. S. Ray, “A scalable high-throughput pipeline architecture for DNA sequence alignment,” in IEEE TENCON, Macao, Nov. 2015, pp. 1–6. DOI:10.1109/TENCON.2015.7373055.
   Google Scholar
• P. K Lala and J. Parkerson, “A CAM (Content addressable memory)-based architecture for molecular sequence matching,” International Conference on Bioinformatics and Computational Biology, Las Vegas, Jul. 18–21, 2011.
   Google Scholar
• S. S. Ray, N. Srivastava, and S. Ghosh, “A hardware-based high-throughput DNA sequence alignment scheme,” IEEE INDICON 2016, India, 2016, pp. 1–6.
   Google Scholar
• S. K. Ray, D. Roy, and A. R. Shaikh, “DNA sequence alignment engine: An AM-based design,” IEEE India Conference (INDICON), Hyderabad, 2011, pp. 1–5.
   Google Scholar
• J. Chiang, M. Studniberg, J. Shaw, S. Seto, and K. Truong, “Hardware accelerator for genomic sequence alignment,” International Conference of IEEE Engineering in Medicine & Biology Society, New York, Aug. 2006, pp. 5787–5789. DOI:10.1109/IEMBS.2006.260286.
   Google Scholar