SWOffinder: Efficient and versatile search of CRISPR off-targets with bulges by Smith-Waterman alignment

被引:1
|
作者
Yaish, Ofir [1 ]
Malle, Amichai [1 ]
Cohen, Eliav [1 ]
Orenstein, Yaron [2 ,3 ]
机构
[1] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel
[2] Bar Ilan Univ, Dept Comp Sci, IL-5290002 Ramat Gan, Israel
[3] Bar Ilan Univ, Mina & Everard Goodman Fac Life Sci, IL-5290002 Ramat Gan, Israel
基金
以色列科学基金会;
关键词
Algorithms; Bioinformatics; Biological constraints; Techniques in genetics;
D O I
10.1016/j.isci.2023.108557
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
CRISPR/Cas9 technology is revolutionizing the field of gene editing. While this technology enables the targeting of any gene, it may also target unplanned loci, termed off-target sites (OTS), which are a few mismatches, insertions, and deletions from the target. While existing methods for finding OTS up to a given mismatch threshold are efficient, other methods considering insertions and deletions are limited by long runtimes, incomplete OTS lists, and partial support of versatile thresholds. Here, we developed SWOffinder, an efficient method based on Smith-Waterman alignment to find all OTS up to some edit distance. We implemented an original trace-back approach to find OTS under versatile criteria, such as separate limits on the number of insertions, deletions, and mismatches. Compared to state-of-the-art methods, only SWOffinder finds all OTS in the genome in just a few minutes. SWOffinder enables accurate and efficient genomic search of OTS, which will lead to safer gene editing.
引用
收藏
页数:12
相关论文
共 6 条
  • [1] A Novel Structure of the Smith-Waterman Algorithm for Efficient Sequence Alignment
    Zahid, Saad Khan
    Hasan, Laiq
    Khan, Asif Ali
    Ullah, Salim
    2015 THIRD INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION, NETWORKING, AND WIRELESS COMMUNICATIONS (DINWC), 2015, : 6 - 9
  • [2] CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
    Manavski, Svetlin A.
    Valle, Giorgio
    BMC BIOINFORMATICS, 2008, 9 (Suppl 2)
  • [3] CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
    Svetlin A Manavski
    Giorgio Valle
    BMC Bioinformatics, 9
  • [4] REDUCING THE SEARCH SPACE AND TIME COMPLEXITY OF NEEDLEMAN-WUNSCH ALGORITHM SMITH-WATERMAN ALGORITHM (LOCAL ALIGNMENT) FOR DNA SEQUENCE ALIGNMENT
    Muhamad, F. N.
    Ahmad, R. B.
    Asi, S. Mohd.
    Murad, M. N.
    JURNAL TEKNOLOGI, 2015, 77 (20): : 137 - 146
  • [5] Performance Analysis Of Needleman-Wunsch Algorithm (Global) And Smith-Waterman Algorithm (Local) In Reducing Search Space And Time For Dna Sequence Alignment
    Muhamad, F. N.
    Ahmad, R. B.
    Asi, S. M.
    Murad, M. N.
    1ST INTERNATIONAL CONFERENCE ON GREEN AND SUSTAINABLE COMPUTING (ICOGES) 2017, 2018, 1019
  • [6] Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System
    Liu, Yu
    Hong, Yang
    Lin, Chun-Yuan
    Hung, Che-Lun
    INTERNATIONAL JOURNAL OF GENOMICS, 2015, 2015