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
Class-Aware Balanced Point Cloud Donwsampling for Efficient Large-Scale 3D Scene Understanding
Mohammad Yousefipour - Marjan Naderan - Morteza Jaderyan
Weakly Supervised Convolutional Neural Network for Automatic Gleason Grading of Prostate Cancer
Maryam Kamareh - Mohammad Sadegh Helfroush - Kamran Kazemi
Automatic Generation of XACML Code using Model-Driven Approach
Athareh Fatemian - Bahman Zamani - Marzieh Masoumi - Mehran Kamranpour - Behrouz Tork Ladani - Shekoufeh Kolahdouz Rahimi
Lossless Watermarking in Encrypted Triangular Mesh Models Based on Optimized Vertex Estimation and Error Histogram Shifting
Alireza Ghaemi - Habibollah Danyali - Kamran Kazemi - Zahra Qodrati - Amirhossein Ghaemi - Seyedeh Masoumeh Taji
Non-Negative Matrix Factorization improves Residual Neural Networks
Hojjat Moayed
Graph Attention Networks for Modeling Multi-Sensor Relationships in Early Prediction of Critical Events in ICU Patients
Amir Akhavan Saffar - Danial Eskandari Faruji - Javad Hamidzadeh
Synthetic Trajectory Sharing Indoors under Privacy Constraints
Mahdi Soltanpour - Vahideh Moghtadaiee - Mina Alishahi
City Intersection Clustering and Analysis Based on Traffic Time Series
Mohammad Aminazadeh - Fakhroddin Noorbehbahani
The process of multi class fake news dataset generation
Sajjad Rezaei - Mohsen Kahani - Behshid Behkamal
Dual-Mode Density-Aware Attention-based Hierarchical Graph Pooling
Roya Booryaee - Parsa Haddadian - Ali Kamandi
more
Samin Hamayesh - Version 46.0.2