FORAlign: accelerating gap-affine DNA pairwise sequence alignment using FOR-blocks based on Four Russians approach with linear space complexity

被引:0
|
作者
Wei, Yanming [1 ,2 ]
Zhou, Tong [2 ,3 ]
Zhai, Yixiao [2 ,3 ]
Yu, Liang [1 ]
Zou, Quan [2 ,3 ]
机构
[1] Xidian Univ, Sch Comp Sci & Technol, 266,Xinglong Sect Xifeng Rd,Changan Zone, Xian 710126, Peoples R China
[2] Univ Elect Sci & Technol China, Inst Digital Hlth, Yangtze Delta Reg Inst Quzhou, 1Chengdian Rd,Kecheng Zone, Quzhou 324003, Peoples R China
[3] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci, 2006,Xiyuan Ave,Pidu Zone, Chengdu 610054, Peoples R China
基金
中国国家自然科学基金;
关键词
sequence alignment; four Russians speedup; dynamic programming; parallel algorithm design; ALGORITHM;
D O I
10.1093/bib/bbaf061
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Pairwise sequence alignment (PSA) serves as the cornerstone in computational bioinformatics, facilitating multiple sequence alignment and phylogenetic analysis. This paper introduces the FORAlign algorithm, leveraging the Four Russians algorithm with identical upper-bound time and space complexity as the Hirschberg divide-and-conquer PSA algorithm, aimed at accelerating Hirschberg PSA algorithm in parallel. Particularly notable is its capability to achieve up to 16.79 times speedup when aligning sequences with low sequence similarity, compared to the conventional Needleman-Wunsch PSA method using non-heuristic methods. Empirical evaluations underscore FORAlign's superiority over existing wavefront alignment (WFA) series software, especially in scenarios characterized by low sequence similarity during PSA tasks. Our method is capable of directly aligning monkeypox sequences with other sequences using non-heuristic methods. The algorithm was implemented within the FORAlign library, providing functionality for PSA and foundational support for multiple sequence alignment and phylogenetic trees. The FORAlign library is freely available at https://github.com/malabz/FORAlign.
引用
收藏
页数:13
相关论文
empty
未找到相关数据