Using Abstraction Methods to Improve String Matching Algorithms | ||
| Journal of University of Babylon | ||
| Article 1, Volume 22, Issue 1, January 2014, Pages 249-257 | ||
| Authors | ||
| Raaid N. Alabaedy; Mehdi Ebadi Manaa; Adib M. Monzer Habbal | ||
| Abstract | ||
| Enhancing or upgrading the existing algorithms needs big efforts to implement the existing one and after to on the problem or the limitation in these algorithms. As such, we need to enhance or upgrade this algorithm or its step to be efficient. Many updating revised algorithms for string matching have been done in many areas. All the work relies on of how enhance the time matching to be efficient. This work introduces a good tool to enhance the existing Boyer-Moore algorithm. On the other hand, we have designed two new algorithms for string matching called RAM1 & RAM2 and developed the existing one called "enhance_BMA". The new algorithm depends on abstraction string method in Java's tool, which helps to find great results even in the worst case of matching. Finally, most of the Object-Oriented programming concepts have been achieved in this work. We propose in this paper new algorithm using Java tool which we called it RAM1 & RAM2. The existing Boyer-Moore has problems when the pattern length is long. This leads to increase the time complexity which causes unstably for this algorithm. On the other hand, we enhance the Boyer-Moore Algorithm (BMA) for a large given pattern in the text by using abstraction methods. | ||
| Keywords | ||
| KEYWORDS; Boyer; Moore Algorithm; efficient time; Abstraction methods; JAVA tools | ||
|
Statistics Article View: 80 PDF Download: 4 |
||