Current Proceedings on Technology

Yazarlar: Atheer Akram AbdulRazzaq, Nur’Aini Abdul Rashid, Awsan Abdulrahman Hasan, Muhannad A. Abu-Hashem

Konular:-

Anahtar Kelimeler:-

Özet: Exact String matching algorithms has been very significant in many applications in the last two decades. This is due to the advancement in technology that produces large volumes of data. The main factors in string matching algorithms are the number of attempts, the number of character comparison and the running time. These factors are influenced by the type of algorithm, type of data, data size and length of pattern used. In this article, we perform review for advantages and disadvantages of executing exact string matching algorithm. We conclude that the suffix automata and hybrid are the faster algorithms with the lowest number of attempts and the hashing approaches have the lower number of comparison. The bit parallelism algorithms have the similar limitations. Keyword: Exact string matching, character comparison, number of attempt, limitations;

---