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
Density Estimation Helps Adversarial Robustness
Afsaneh Hasanebrahimi - Bahareh Kaviani Baghbaderani - Reshad Hosseini - Ahmad Kalhor
Graph Representation Learning Towards Patents Network Analysis
Mohammad Heydari - Babak Teimourpour
BERT transformers Multitask learning Sarcasm and Sentiment classification (BMSS)
Fatemeh Molavi - Jamshid Bagherzadeh Mohasefi
ROCT-Net: A new ensemble deep convolutional model with improved spatial resolution learning for detecting common diseases from retinal OCT images
Mohammad Rahimzadeh - Mahmoud Reza Mohammadi
Diagnosis of Depression Based on New Features Extractive from the Frequency Space of the EEG
Melika Changizi - Saeid Rashidi
Improving Soft Error Reliability of FPGA-based Deep Neural Networks with Reduced Approximate TMR
Anahita Hosseinkhani - Behnam Ghavami
Investigating the Behavior of Generation Z Customers in Online Banking Services (Case Study of a Bank of Iran)
Elham Mahmoudabadi - Esmaeil Mollaahmadi
A Vision-Based Method for Human Activity Recognition Using Local Binary Pattern
Babak Goodarzi - Reza Javidan - Mohammad Sadegh Rezaei
GroupRec: Group Recommendation by Numerical Characteristics of Groups in Telegram
Davod Karimpour - Mohammad Ali Zare Chahooki - Ali Hashemi
Optimizing MR Image Registration for Accurate Brain Volume Measurement in Children with Autism Spectrum Disorder
Shiva Sanati - Mahdi Saadatmand
more
Samin Hamayesh - Version 41.5.3