Please wait ...
0% Complete
Home
/
11th International Conference on Computer and Knowledge Engineering
Divide and Conquer Approach to Long Genomic Sequence Alignment
Authors :
Mahmoud Naghibzadeh
1
Samira Babaei
2
Behshid Behkmal
3
Mojtaba Hatami
4
1- Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
2- Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
3- Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
4- Computer Engineering Dept. Ferdowsi University of Mashhad Mashhad, Iran
Keywords :
genome sequence alignment, divide and conquer, longest common subsequence, big genome data
Abstract :
optimal alignment of DNA sequences is a reliable approach to discover mutations in one sequence in comparison to the other or to discover the differences between two sequences. Needleman-Wunsch is the most applicable software for optimal alignment of the sequences and Smith-Waterman is the most applicable one for local optimal alignment. Their performances are excellent with short sequences, but as the sequences become longer their performance degeneration grow exponentially to the point that it is practically impossible to align two compete human DNAs. Alignment process is essential in diagnosis of genome related diseases. Therefore, many researches are done or being conducted to find ways of performing the alignment with tolerable time and memory consumptions. One such effort is breaking the sequences into same number of parts and align corresponding parts together to produce the overall alignment. With this, there are three achievements simultaneously: run time reduction, main memory utilization reduction, and the possibility to better utilize multiprocessors, multicores and General Purpose Graphic Processing Units (GPGPUs). In this research, the method for breaking long sequences into smaller parts is based on the divide and conquer approach. The breaking points are selected along the longest common subsequence of the current sequences. The method is demonstrated to be very efficient with respect to both time and main memory utilization.
Papers List
List of archived papers
Sensitivity Reliability Analysis of Power Distribution Networks Using Fuzzy Logic
Mohammed Wadi - Wisam Elmasry - Ismail Kucuk - Hossein Shahinzadeh
Early detection of Parkinson’s disease using Convolutional Neural Networks on SPECT images
Reyhaneh Dehghan - Marjan Naderan - Seyyed Enayatallah Alavi
FAHP-OF: A New Method for Load Balancing in RPL-based Internet of Things (IoT)
Mohammad Koosha - Behnam Farzaneh - Emad Alizadeh - Shahin Farzaneh
ParsHomo: A T5-Powered Approach to High-Precision Persian Homograph Disambiguation
Hasan Jalali - Taha Mohaddesi
Non-Negative Matrix Factorization improves Residual Neural Networks
Hojjat Moayed
FaaScaler: An Automatic Vertical and Horizontal Scaler for Serverless Computing Environments
Zahra Rezaei - Saeid Abrishami - Seid Nima Moeintaghavi
Virtual Network Embedding based on Univariate Distribution Estimation
Arezoo Jahani
Optimizing Question-Answering Framework Through Integration of Text Summarization Model and Third-Generation Generative Pre-Trained Transformer
Ervin Gubin Moung - Toh Sin Tong - Maisarah Mohd Sufian - Valentino Liaw - Ali Farzamnia - Farashazillah Yahya
Reversible Data Insertion in Encryption Domain Based on Reduced Quad Difference Expansion
Alireza Ghaemi - Mohammad Zare Ehteshami - Amirhossein Ghaemi
Class-Aware Balanced Point Cloud Donwsampling for Efficient Large-Scale 3D Scene Understanding
Mohammad Yousefipour - Marjan Naderan - Morteza Jaderyan
more
Samin Hamayesh - Version 46.0.2