0% Complete
Home
/
14th International Conference on Computer and Knowledge Engineering
Fast and Accurate Motif Discovery in Protein Sequences Using Parallel Processing with OpenMP
Authors :
Rahele Mohammadi
1
Mahmoud Naghibzadeh
2
Abdorreza Savadi
3
1- Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
2- Full Professor, Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
3- Assistant Professor, Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
Keywords :
Cell،Genome،Protein architecture،Amino acid sequence،Motif،Parallel multi-threading،Execution time reduction،Performance improvement
Abstract :
In today's rapidly advancing field of biomedical research, the demand for swift and accurate identification of mutations within biological sequences, including proteins and genomes, is essential for effective disease diagnosis and treatment. Within the realm of protein sequence analysis, recurring patterns known as motifs play a crucial role. These motifs, whether of fixed or variable lengths, often signify essential structural or functional features such as transcription factor binding sites or protein-protein interaction interfaces. Over time, several methods have emerged for detecting motifs within protein datasets. Among these, our previous work introduced the Tree-based Fast Exact Motif (TFEM) algorithm. Unlike some contemporary techniques like Sensitive Thorough Rapid Enriched Motif Elicitation (STREME), Multiple EM for Motif Elicitation (MEME), and Discriminative Regular Expression Motif Elicitation (DREME), TFEM demonstrated superior efficiency in accurately identifying motifs. However, the computational complexity of TFEM presents challenges. With a time complexity of O (n20k), where 'n' denotes the number of sequences in the input set and 'k' signifies the length of the motif under investigation, the algorithm's performance is heavily influenced by the size of the input set. To address this challenge, we propose leveraging CPU parallelization techniques, specifically Open-MP programming, to optimize the execution time of the TFEM algorithm. The evaluation results showed that parallelization in large datasets can reduce execution time up to approximately half compared to the serial algorithm.
Papers List
List of archived papers
Improving Soft Error Reliability of FPGA-based Deep Neural Networks with Reduced Approximate TMR
Anahita Hosseinkhani - Behnam Ghavami
MIPS-Core Application Specific Instruction-Set Processor for IDEA Cryptography − Comparison between Single-Cycle and Multi-Cycle Architectures
Ahmad Ahmadi - Reza Faghih Mirzaee
FAHP-OF: A New Method for Load Balancing in RPL-based Internet of Things (IoT)
Mohammad Koosha - Behnam Farzaneh - Emad Alizadeh - Shahin Farzaneh
Lempel-Ziv-based Hyper-Heuristic Solution for Longest Common Subsequence Problem
Mahdi Nasrollahi - Reza Shami Tanha - Mohsen Hooshmand
Soccer Video Event Detection Using Metric Learning
Ali Karimi - Ramin Toosi - Mohammad Ali Akhaee
Degarbayan-SC: A Colloquial Paraphrase Farsi Subtitles Dataset
Mohammad Javad Aghajani - Mohammad Ali Keyvanrad
A Smart Electrochemical Biosensor for Arsenic Detection in Water
Keyvan Asefpour Vakilian
Span-prediction of Unknown Values for Long-sequence Dialogue State Tracking
Marzieh Naghdi Dorabati - Reza Ramezani - Mohammad Ali Nematbakhsh
A New Hypercube Variant: Pruned Shuffle Connected Cube
Reza Latifi - Mahmoud Naghibzadeh
Adaptive Active Queue Management for Time Slot Channel Hopping in Industrial Internet of Things
Mehdi Zirak - Yasser Sedaghat - Mohammad Hossein Yaghmaee Moghaddam
more
Samin Hamayesh - Version 41.7.6