EPMA: Efficient pattern matching algorithm for DNA sequences

doi:10.1016/j.eswa.2017.03.026

Return

EPMA: Efficient pattern matching algorithm for DNA sequences

2017-09-01

PRE

Muhammad Tahir *

Muhammad Sardaraz

DOI：10.1016/j.eswa.2017.03.026

Original

Original request for help

Save

Abstract

En 中文

To solve, manage and analyze biological problems using computer technology is called bioinformatics. With the emergent evolution in computing era, the volume of biological data has increased significantly. These large amounts of data have increased the need to analyze it in reasonable space and time. DNA sequences contain basic information of species, and pattern matching between different species is an important and challenging issue to cope with. There exist generalized string matching and some specialized DNA pattern matching algorithms in the literature. There is still need to develop fast and space efficient pattern matching algorithms that consider new hardware development. In this paper, we present a novel DNA sequences pattern matching algorithm called EPMA. The proposed algorithm utilizes fixed length 2-bits binary encoding, segmentation and multi-threading. The idea is to find the pattern with multiple searcher agents concurrently. The proposed algorithm is validated with comparative experimental results, The results show that the new algorithm is a good candidate for DNA sequence pattern matching applications. The algorithm effectively utilizes modern hardware and will help researchers in the sequence alignment, short read error correction, phylogenetic inference etc. Furthermore, the proposed method can be extended to generalized string matching and their applications. (C) 2017 Elsevier Ltd. All rights reserved.

Keywords:

Strings

DNA

Binary

Multi-threading

Algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.