A NEW APPROACH TO EXACT PATTERN MATCHING

Authors

  • Truong Huy Nguyen School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Vietnam

DOI:

https://doi.org/10.15625/1813-9663/35/3/13620

Abstract

In this paper we introduce a exible approach to design an eective algorithm for exact
pattern matching, and compare it with some of the most ecient algorithms, such as AOSO, EBOM,
FJS, FSBNDM, HASHq, LBNDM, SA, BMH-SBNDM, SBNDMq, TVSBS. These results are based
on the concept of the degree of fuzziness presented by P. T. Huy et al. in 2002. Theoretical analyses
and experimental results indicate that in practice our proposed algorithm is faster than the above
mentioned algorithms in most of the cases of patterns and alphabets.

Downloads

Download data is not yet available.

Downloads

Published

2019-08-05

Issue

Section

Articles