International Conference on Computer and Knowledge Engineering

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¹ Mahmoud Naghibzadeh² Abdorreza Savadi³

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

HV-RCE: Reducing Network Bandwidth Usage for Video Transmission via HEVC/VVC Features in Resource-Constrained Environments

Yaghoub Saberi - Mohammadreza Forghani - Sharifeh Sadat Mirkhalaf

Lempel-Ziv-based Hyper-Heuristic Solution for Longest Common Subsequence Problem

Mahdi Nasrollahi - Reza Shami Tanha - Mohsen Hooshmand

Robust Distributed Learning over Heterogeneous Adaptive Networks based on Federated BSP Model

Fatemeh Barani - MohammadHafez Yari - Abdorreza Savadi - Hadi Sadoghi Yazdi

Instance Selection from Skewed Class Distributions by Using the multi-objective optimizer

Mona Moradi - Javad Hamidzadeh

Towards Efficient Video Object Detection on Embedded Devices

Mohammad Hajizadeh - Adel Rahmani - Mohammad Sabokrou

AI-Driven Relocation Tracking in Dynamic Kitchen Environments

Arash Nasr Esfahani - Hamed Hosseini - Mehdi Tale Masouleh - Ahmad Kalhor - Hedieh Sajedi

CSI-Based Human Activity Recognition using Convolutional Neural Networks

Parisa Fard Moshiri - Mohammad Nabati - Reza Shahbazian - Seyed Ali Ghorashi

Two-step thermal-aware routing algorithm in 3D NoC

Majid Nezarat - Masoume Momeni

Enhanced Duplicate Bug Report Detection in Anonymized Environments: A Parallelized Multi-Task Learning Framework

Alireza Shorafa - Abolfazl Zarghani

Using Deep Learning for Classification of Lung Cancer on CT Images in Ardabil Province

Mohammad Ali Javadzadeh Barzaki - Jafar Abdollahi - Mohammad Negaresh - Maryam Salimi - Hadi Zolfeghari - Mohsen Mohammadi - Asma Salmani - Rona Jannati - Firouz Amani