Please wait ...
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
Chaotic multi-population ABC algorithm based on memory and levy flight for solving dynamic job shop scheduling problems
Mohammad Ali Zarif - Javad Hamidzadeh
TD-PINNs: Efficient Shared-Memory Parallelization of Physics-Informed Neural Networks for Time-Dependent PDEs
Mahdi Movahedian Moghaddam - Kourosh Parand
Adaptive Channel Estimation for MIMO-OFDM Systems in Impulsive Noise Environments
Mojtaba Hajiabadi
An Improved and Accurate Measure for Mining Correlated High-utility Itemsets
Amir Masoud Heidari Orojloo - Morteza Keshtkaran
Learning to Classify Messier Astronomical Objects with Limited Data: A Few-Shot Learning Approach
AMIRREZA ROUHBAKHSHMEGHRAZI - Shayan Nalbandian - Ghazal Alizadeh - Sheida Shadman - Shuyuan Yang - Bo Li
Improving Machine Learning Classification of Heart Disease Using the Graph-Based Techniques
Abolfazl Dibaji - Sadegh Sulaimany
A Simple Low Cost Approach to Detect Hand Gesture Based on Software Event Camera Emulation
Ali Sabet Akbarzadeh - Abedin Vahedian
An optimal workflow scheduling method in cloud-fog computing using three-objective Harris-Hawks algorithm
Ahmadreza Montazerolghaem - Maryam Khosravi - Fatemeh Rezaee
An Efficient Planning Method for Autonomous Navigation of a Wheeled-Robot based on Deep Reinforcement Learning
Ali Salimi Sadr - Mahdi Shahbazi Khojasteh - Hamed Malek - Armin Salimi-Badr
Traffic Sign Recognition Using Local Vision Transformer
Ali Farzipour - Omid Nejati Manzari - Shahriar B. Shokouhi
more
Samin Hamayesh - Version 46.0.2