DNA sequence alignment datasets based on NW algorithm

Citation Author(s):
Amr
Rashed
Lecturer with the Computer Engineering Department, Faculty of Computers and Information Technology, Taif University, Saudi Arabia
Submitted by:
Amr Rashed
Last updated:
Tue, 05/17/2022 - 22:18
DOI:
10.21227/45dr-8p86
Data Format:
Research Article Link:
Links:
License:
0
0 ratings - Please login to submit your rating.

Abstract 

This study presented six datasets for DNA/RNA sequence alignment for one of the most common alignment algorithms, namely, the Needleman–Wunsch (NW) algorithm. This research proposed a fast and parallel implementation of the NW algorithm by using machine learning techniques. This study is an extension and improved version of our previous work . The current implementation achieves 99.7% accuracy using a multilayer perceptron with ADAM optimizer and up to 2912 giga cell updates per second on two real DNA sequences with a of length 4.1 M nucleotides. Our implementation is valid for extremely long sequences by using the divide-and-conquer strategy.

Instructions: 

these datasets are illustrated in a manuscript submitted to IEEE OPEN ACCESS entitled “Parallel Implementation of the Needleman–Wunsch Algorithm Using Machine Learning Algorithms”.

Comments

Good

Submitted by Muhammad Khan on Fri, 05/21/2021 - 06:44

Thank you

Submitted by Amr Rashed on Tue, 09/07/2021 - 05:37