Efficient computation of Hash Hirschberg protein alignment utilizing hyper threading multi-core sharing technology

被引:18
作者
Abu-Hashem, Muhannad [1 ]
Gutub, Adnan [2 ]
机构
[1] King Abdulaziz Univ, Fac Architecture & Planning, Dept Geomat, Jeddah, Saudi Arabia
[2] Umm Al Qura Univ, Coll Comp & Informat Syst, Dept Comp Engn, Mecca, Saudi Arabia
关键词
computational biology; high-performance computing; Hyper Threading; pairwise sequence alignment; parallel design; sequence alignment; shared-memory; SEQUENCE; SEARCH; ALGORITHM; ACID; GENERATION;
D O I
10.1049/cit2.12070
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to current technology enhancement, molecular databases have exponentially grown requesting faster efficient methods that can handle these amounts of huge data. Therefore, Multi-processing CPUs technology can be used including physical and logical processors (Hyper Threading) to significantly increase the performance of computations. Accordingly, sequence comparison and pairwise alignment were both found contributing significantly in calculating the resemblance between sequences for constructing optimal alignments. This research used the Hash Table-NGram-Hirschberg (HT-NGH) algorithm to represent this pairwise alignment utilizing hashing capabilities. The authors propose using parallel shared memory architecture via Hyper Threading to improve the performance of molecular dataset protein pairwise alignment. The proposed parallel hyper threading method targeted the transformation of the HT-NGH on the datasets decomposition for sequence level efficient utilization within the processing units, that is, reducing idle processing unit situations. The authors combined hyper threading within the multicore architecture processing on shared memory utilization remarking performance of 24.8% average speed up to 34.4% as the highest boosting rate. The benefit of this work improvement is shown preserving acceptable accuracy, that is, reaching 2.08, 2.88, and 3.87 boost-up as well as the efficiency of 1.04, 0.96, and 0.97, using 2, 3, and 4 cores, respectively, as attractive remarkable results.
引用
收藏
页码:278 / 291
页数:14
相关论文
共 63 条
[21]  
GenBank, 2020, NIH GEN SEQ DAT ANN
[22]   AN IMPROVED ALGORITHM FOR MATCHING BIOLOGICAL SEQUENCES [J].
GOTOH, O .
JOURNAL OF MOLECULAR BIOLOGY, 1982, 162 (03) :705-708
[23]  
Gutub AA-A., 2010, INT J SECUR IJS, V4, P46
[24]   Watermarking Images via Counting-Based Secret Sharing for Lightweight Semi-Complete Authentication [J].
Gutub, Adnan .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY AND PRIVACY, 2022, 16 (01)
[25]   Regulating watermarking semi-authentication of multimedia audio via counting-based secret sharing [J].
Gutub, Adnan .
PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2022, 28 (02) :324-332
[26]  
Gutub A, 2020, J ENG RES-KUWAIT, V8, P91
[27]   Hiding Shares of Counting-Based Secret Sharing via Arabic Text Steganography for Personal Usage [J].
Gutub, Adnan ;
Alaseri, Khaled .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2020, 45 (04) :2433-2458
[28]   Counting-based secret sharing technique for multimedia applications [J].
Gutub, Adnan ;
Al-Juaid, Nouf ;
Khan, Esam .
MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (05) :5591-5619
[29]  
Gutub AAA, 2007, KUWAIT J SCI ENG, V34, P165
[30]   MTRAP: Pairwise sequence alignment algorithm by a new measure based on transition probability between two consecutive pairs of residues [J].
Hara, Toshihide ;
Sato, Keiko ;
Ohya, Masanori .
BMC BIOINFORMATICS, 2010, 11