International Conference on Computer and Knowledge Engineering

Home / 11th International Conference on Computer and Knowledge Engineering

Divide and Conquer Approach to Long Genomic Sequence Alignment

Authors :

Mahmoud Naghibzadeh¹ Samira Babaei² Behshid Behkmal³ Mojtaba Hatami⁴

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

YOLOatt-Med: YOLO-Based Attention Mechanism for Medical Image Classification

Fatemeh Naserizadeh - Erfan Akbarnezhad Sany - Parsa Sinichi - Seyyed Abed Hosseini

Improving Motor Imagery Classification in BCI Systems Using EMD and Multi-Layer CNNs

Reza Arghand - Ali Chaibakhsh - Moein Radman

Leveraging the Power of Object Detection Models in Identifying Litter for a Significant Reduction in Environmental Pollution

Lim Zhen Xian - Ervin Gubin Moung - Jason Teo Tze Wi - Nordin Saad - Farashazillah Yahya - Tiong Lin Rui - Ali Farzamnia

Area-Efficient VLSI Implementation of Bit-Serial Multiplier Using Polynomial Basis over GF(2m)

Saeideh Nabipour - Javad Javidan - Gholamreza Zare Fatin

A Systematic Embedded Software Design Flow for Robotic Applications

Navid Mahdian - Seyed-Hosein Attarzadeh-Niaki - Armin Salimi-Badr

AVID: A VARIATIONAL INFERENCE DELIBERATION FOR META-LEARNING

Alireza Javaheri - Arsham Gholamzadeh Khoee - Saeed Reza Kheradpisheh - Hadi Farahani - Mohammad Ganjtabesh

Automated software design using Machine Learning With Natural Language Processing

Fahimeh Khedmatkon - Seyed Mohammad Hossein Hasheminejad - Jaleh Shoshtarian Malak

Intelligent Interpretation of Frequency Response Signatures to Diagnose Radial Deformation in Transformer Windings Using Artificial Neural Network

Reza Behkam - Hossein Karami - Mehdi Salay Naderi - Gevork B. Gharehpetian

Smart Home Connectivity: Identifying the Best IoT Application Layer Protocols

Hossein Shahinzadeh - Zohreh Azani - Sundus F. Al-Hameedawi - S. Mohammadali Zanjani - Saiedeh Mehrabani-Najafabadi - Mohammadreza Hemmati

Cross-project Defect Prediction with An Enhanced Transfer Boosting Algorithm

Nazgol Nikravesh - Mohammad Reza Keyvanpour

Samin Hamayesh - Version 42.4.1