The Enhanced Hybrid Algorithm for the AbdulRazzaq and Berry-Ravindran Algorithms

  • Authors

    • Atheer Akram Abdulrazzaq Businesses Informatics College, University of Information Technology and Communications
    • Nur’Aini Abdul Rashid College of Computer & Information Sciences, Princess Nourah bint Abdulrahman University
    • Ahmed Majid Taha Businesses Informatics College, University of Information Technology and Communications
    2018-08-10
    https://doi.org/10.14419/ijet.v7i3.12436
  • Exact String Matching Algorithms, E-AbdulRazzaq Algorithm, Database Type.

  • 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.

     

     

  • References

    1. [1] AbdulRazzaq AA, Abdul Rashid N A, Abu-Hashem MA & Zainol Z (20017) "New Searching Technique of Hybrid Exact String Matching lgorithm,".International Review on Computers and Software (I.RE.CO.S.), vol.11 (10), pp. 884-897.

      [2] AbdulRazzaq AA, Rashid NA, Abu-Hashem MA, & Hasan AA (2014) "A New Efficient Hybrid Exact String Matching Algorithm and Its Applications," Life Science Journal (Life Sci J), vol.11 (10), pp.474-488.

      [3] Al-Dabbagh SSM, & Barnouti. NH (2017) "A New Efficient Hybrid String Matching Algorithm to Solve the Exact String Matching Problem" British Journal of Mathematics & Computer Science, vol.20 (2), pp. 1-14. https://doi.org/10.9734/BJMCS/2017/30497.

      [4] Berry T, & Ravindran SA (1999) "fast string matching algorithm and experimental results" In Proceedings of the Prague Stringology Club Workshop`99, J. Holub and M. Simáneked, Collaborative, Report DC-99-05, pp. 1-17.

      [5] Huang Y, .Ping L, Pan X, Jiang L, & Jiang X (2008) "A Fast Improved Pattern Matching Algorithm for Biological Sequences" International Symposium on Computational Intelligence and Design, ISCID '08, IEEE, pp. 8-12.

      [6] Cai G, Nie X, & Huang Y (2009) "A Fast Hybrid Pattern Matching Algorithm for Biological Sequences" Proceedings of 2nd International Conference on Biomedical Engineering and Informatics, BMEI '09, pp. 1-5. https://doi.org/10.1109/BMEI.2009.5305645.

      [7] Karkkainen J, & Joong CN (2009) "Faster Filters for Approximate String Matching" Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX, pp. 84-90.

      [8] Klaib AF, & Osborne H (2009) "BRQS Matching Algorithm for Searching Protein Sequence Databases" Proceedings of the 2009 International Conference on Future Computer and Communication, ICFCC '09, IEEE, pp. 223-226. https://doi.org/10.1109/ICFCC.2009.40.

      [9] Kurt V (2005) "Protein Structure Prediction using Decision Lists," M.Sc. Thesis, Dept, Computational Sciences and Engineering, Koç University, İstanbul, Turkey.

      [10] Chew E, & Chen YC (2003) "Mapping Midi to the Spiral Array: Disambiguating Pitch Spellings, In H. K. Bhargava and Nong Ye, eds. Computational Modeling and Problem Solving in the Networked World" Proceedings of the 8th INFORMS Computer Society Conference, ICS2003, pp. 1-17.

      [11] Ferragina P, & Fischer J (2007) "Suffix Arrays on Words. In: Bin Ma, Kaizhong Zhang (eds.)," Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, CPM’07, pp.328-339, 2007. https://doi.org/10.1007/978-3-540-73437-6_33.

      [12] Deighton RA (2012) "Using Rabin-Karp fingerprints and LevelDB for faster searches," M.Sc. Thesis, Dept, Department of Computer Science, University of Ontario Institute of Technology (UOIT), Oshawa, Canada.

      [13] Cambouropoulos E (2001) "Automatic pitch spelling: From numbers to sharps and flats" In VIII Brazilian Symposium on Computer Music SBC&M.

      [14] Honingh A (2007) "Pitch spelling: Investigating reductions of the search space,†Proceedings SMC'07, 4th Sound and Music Computing Conference.

      [15] Kadhim HA (2012) "New Sequential and Gpu-Based Hybrid String Matching Algorithms." M.Sc. Thesis, Dept, Computer Science School, University Science Malaysia (USM), Penang, Malaysia.

      [16] Charras C & Lecroq T (2004) "Handbook of Exact String Matching Algorithms" King’s College Publications.

  • Downloads

  • How to Cite

    Akram Abdulrazzaq, A., Abdul Rashid, N., & Majid Taha, A. (2018). The Enhanced Hybrid Algorithm for the AbdulRazzaq and Berry-Ravindran Algorithms. International Journal of Engineering & Technology, 7(3), 1709-1717. https://doi.org/10.14419/ijet.v7i3.12436