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
The Internet of Things-Enabled Smart City: An In-Depth Review of Its Domains and Applications
Amir Meydani - Ali Ramezani - Alireza Meidani
Brain Age Estimation with Twin Vision Transformer using Hippocampus Information Applicable to Alzheimer Dementia Diagnosis
Zahra Qodrati - Seyedeh Masoumeh Taji - Amirhossein Ghaemi - Habibollah Danyali - Kamran Kazemi - Alireza Ghaemi
Practical Implementation of Real-Time Waste Detection and Recycling based on Deep Learning for Delta Parallel Robot
Hasan Jalali - Shaya Garjani - Ahmad Kalhor - Mehdi Tale Masouleh - Parisa Yousefi
Real-Time Forecasting Using Mixed Frequency Time-Series Data
Armin Khayati - Mohammad Taheri - Koorush Ziarati
An influence maximization algorithm based on community detection using topological features
Zahra Aghaee - Afsaneh Fatemi
Hybrid navigation based on GPS data and SIFT-based place recognition using Biologically-inspired SLAM
Sahar Salimpour Kasebi - Hadi Seyedarabi - Javad Musevi Niya
ExaASC: A General Target-Based Stance Detection Corpus in Arabic Language
Mohammad Mehdi Jaziriyan - Ahmad Akbari - Hamed Karbasi
Innovative Customer Segmentation based on Multi-Step Sequential Deep Clustering in the Telecommunication Industry
Fatemeh Jalali Farahani - Shima Tabibian
AgeNet-AT: An End-to-End Model for Robust Joint Speaker Age Estimation and Gender Recognition Based on Attention Mechanism and Titanet
Mahsa Zamani Tarashandeh - Amirhossein Torkanloo - Mohammad Hossein Moattar
Financial Market Prediction Using Deep Neural Networks with Hardware Acceleration
Dara Rahmati - Mohammad Hadi Foroughi - Ali Bagherzadeh - Mehdi Foroughi - Saeid Gorgin
more
Samin Hamayesh - Version 41.3.1