Open AccessThe Enhanced Hybrid Algorithm for the AbdulRazzaq and Berry-Ravindran Algorithms
Author(s) -
Atheer Akram AbdulRazzaq,
Nur’Aini Abdul Rashid,
Ahmed Taha
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i3.12436
Subject(s) - algorithm , string searching algorithm , character (mathematics) , computer science , string (physics) , field (mathematics) , commentz walter algorithm , xml , matching (statistics) , bit array , pattern matching , mathematics , artificial intelligence , type (biology) , statistics , geometry , pure mathematics , mathematical physics , operating system , ecology , biology
Exact string matching is one of the critical issues in the field of computer science. This study proposed a hybrid string matching algorithm called E- AbdulRazzaq. This algorithm used the best properties of two original algorithms; AbdulRazzaq and Berry-Ravindran Algorithms. The proposed algorithm showed an efficient performance in the number of attempts and number of character comparison when compared the original and recent to the standard algorithms. The proposed algorithm was applied in several types of databases, which are DNA sequences, Protein sequences, XML structures, Pitch characters, English texts, and Source codes. The Pitch database was the best match for E-AbdulRazzaq with the number of attempts involving long and short patterns, while the DNA database was the worst match. No data is specified as the best or worst with the E-AbdulRazzaq algorithm in terms of the character comparisons. The E-AbdulRazzaq algorithms ranked first in most databases when using short and long patterns, in terms of number of attempts and character comparisons.