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

被引:0
|
作者
Sarkar, Ardhendu [1 ]
Ghosh, Surajeet [1 ]
Ray, Sanchita Saha [2 ]
机构
[1] Indian Inst Engn Sci & Technol, Dept Comp Sci & Technol, Sibpur, Howrah, India
[2] St Thomas Coll Engn & Technol, Dept Informat Technol, Kolkata, India
关键词
Compact sequence alignment; Global alignment; Hardware based alignment; Memory-efficient alignment; Pair-wise sequence alignment; Sequence alignment;
D O I
10.1080/03772063.2021.1914200
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A hardware-based memory-efficient sequence alignment architecture is described in this paper. This paper expresses a comprehensive blueprint of the hardware implementation of compact sequence alignment for pair-wise global alignment technique to achieve high-throughput processing. This architecture uses SRAM and only a small amount of digital logic circuitry to perform elementary operations of sequence alignment in real time. Additionally, this alignment engine does not require any preprocessing operations like in most of the existing alignment approaches do. Furthermore, it does not call for any sort of comparison mechanism for preparing final sequence alignment by the alignment co-processor. The entire architecture is simulated and synthesized in FPGA board for numerous cases considering dissimilar pseudo-randomly generated sequence pairs with variable sequence lengths ranging from 16 to 2048 nucleotides. The proposed design exhibits compact alignment of the sequences that leads to the identification of close similarity between the sequences under test. Moreover, the proposed alignment engine takes significantly less amount of time, approximate to 64-95% less time, and approximate to 85-99% less amount of memory space than existing alignment approaches. The overall system performance is studied with respect to Millions Alignments Per Second (MAPS) and exhibits approximate to 55-75% more sequence alignments of same set of DNA sequences in a stipulated time compared to existing schemes.
引用
收藏
页码:3638 / 3649
页数:12
相关论文
共 29 条
  • [1] Reconstruction of genuine pair-wise sequence alignment
    Polyanovsky, Valery
    Roytberg, Mikhail A.
    Tumanyan, Vladimir G.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2008, 15 (04) : 379 - 391
  • [2] A comparison of four pair-wise sequence alignment methods
    Essoussi, Nadia
    Fayech, Sondes
    BIOINFORMATION, 2007, 2 (04) : 166 - 168
  • [3] MPSAGA: a matrix-based pair-wise sequence alignment algorithm for global alignment with position based sequence representation
    Lakhani, Jyoti
    Khunteta, Ajay
    Choudhary, Anupama
    Harwani, Dharmesh
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (07):
  • [4] MPSAGA: a matrix-based pair-wise sequence alignment algorithm for global alignment with position based sequence representation
    Jyoti Lakhani
    Ajay Khunteta
    Anupama Choudhary
    Dharmesh Harwani
    Sādhanā, 2019, 44
  • [5] Memory-efficient A* heuristics for multiple sequence alignment
    McNaughton, M
    Lu, P
    Schaeffer, J
    Szafron, D
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 737 - 743
  • [6] Memory efficient pair-wise genome alignment algorithm - A small-scale application with grid potential
    Ahmed, N
    Pan, Y
    Vandenberg, A
    GRID AND COOPERATIVE COMPUTING GCC 2004, PROCEEDINGS, 2004, 3251 : 777 - 782
  • [7] THE USE OF HASH TABLE FOR BUILDING THE DISTANCE MATRIX IN A PAIR-WISE SEQUENCE ALIGNMENT
    Abu-Hashem, Muhannad A.
    Rashid, Nur'aini Abdul
    Abdullah, Rosni
    Abdulrazzaq, Atheer A.
    Hasan, Awsan A.
    4TH INTERNATIONAL CONFERENCE ON SOFTWARE TECHNOLOGY AND ENGINEERING (ICSTE 2012), 2012, : 283 - +
  • [8] A memory-efficient algorithm for multiple sequence alignment with constraints
    Lu, CL
    Huang, YP
    BIOINFORMATICS, 2005, 21 (01) : 20 - 30
  • [9] DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
    Martin Schmollinger
    Kay Nieselt
    Michael Kaufmann
    Burkhard Morgenstern
    BMC Bioinformatics, 5
  • [10] DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
    Schmollinger, M
    Nieselt, K
    Kaufmann, M
    Morgenstern, B
    BMC BIOINFORMATICS, 2004, 5 (1)