{"title":"The Negative Effect of Traditional Loops Style on the Performance of Algorithms","authors":"Mahmoud Moh'd Mhashi","volume":8,"journal":"International Journal of Computer and Information Engineering","pagesStart":2415,"pagesEnd":2423,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/901","abstract":"
A new algorithm called Character-Comparison to Character-Access (CCCA) is developed to test the effect of both: 1) converting character-comparison and number-comparison into character-access and 2) the starting point of checking on the performance of the checking operation in string searching. An experiment is performed using both English text and DNA text with different sizes. The results are compared with five algorithms, namely, Naive, BM, Inf_Suf_Pref, Raita, and Cycle. With the CCCA algorithm, the results suggest that the evaluation criteria of the average number of total comparisons are improved up to 35%. Furthermore, the results suggest that the clock time required by the other algorithms is improved in range from 22.13% to 42.33% by the new CCCA algorithm.<\/p>\r\n","references":"[1] M.S. Ager, O. Danvy, and H.K. Rohde. Fast partial evaluation of pattern\r\nmatching in strings. ACM\/SIGPLAN Workshop Partial Evaluation and\r\nSemantic-Based Program Manipulation, San Diego, California, USA,\r\npp. 3 - 9, 2003.W.-K. Chen, Linear Networks and Systems (Book style).\r\nBelmont, CA: Wadsworth, 1993, pp. 123-135.\r\n[2] K. Fredriksson and S. Grabowski: Practical and Optimal String\r\nMatching. Proceedings of SPIRE'2005, Lecture Notes in Computer\r\nScience 3772, pp. 374-385, Springer Verlag, 2005.\r\n[3] M. Hernandez, and D. Rosenblueth. Disjunctive partial deduction of a\r\nright-to-left string-matching algorithm. Information Processing Letters,\r\nVol 87, pp. 235-241, 2003.\r\n[4] A. Apostolico, and R. R.Giancarlo, \"The Boyer-Moore-Galil string\r\nsearching strategies revisited\", SIAM J. Comput. Vol. 15, no. 1, pp. 98-\r\n105, 1986.\r\n[5] M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci.,\r\nVol. 45, pp. 63-86, 1986.\r\n[6] M. Crochemore, D. Perrin, Two-way string-matching, J. ACM, Vol. 38,\r\npp. 651-675, 1991.\r\n[7] Z. Galil, R. Giancarlo, On the exact complexity of string matching:\r\nupper bounds, SIAM J. Comput. Vol. 21, pp. 407-437, 1992.\r\n[8] P. D. Smith, Experiments with a very fast substring search algorithm,\r\nSP&E Vol. 21, no. 10, pp. 1065-1074, 1991.\r\n[9] D. M. Sunday, A very fast substring search algorithm, Communications\r\nof the ACM Vol. 33, no. 8, pp. 132-142, 1990.\r\n[10] Z. Liu, X. Du, N. Ishii, An improved adaptive string searching\r\nalgorithm, Software-Practice and Experience Vol. 28, no. 2, pp. 191-\r\n198, 1998.\r\n[11] P. Fenwick, Fast string matching for multiple searches, Software-\r\nPractice and Experience Vol. 31, no. 9, pp. 815-833, 2001.\r\n[12] M. Mhashi, A Fast String Matching Algorithm using Double-Length\r\nSkip Distances. Dirasat Journal, University of Jordan, Jordan Vol. 30,\r\nno. 1, pp. 84-92, 2003.\r\n[13] P. Fenwick, Some perils of performance prediction: a case study on\r\npattern matching. Software-Practice and Experience Vol. 31, no. 9, pp.\r\n835-843, 2001.\r\n[14] A. Al-jaber, M. Mhashi, A modified double skip algorithm in string\r\nsearching, AMSE(Association for the advancement of modelling &\r\nSimulation Techniques in Enterprises) Periodicals Vol.8, no. 4, pp. 1-16,\r\n2003.\r\n[15] F. Franek, C. Jennings, W.F. Smyth: A Simple Fast Hybrid Pattern-\r\nMatching Algorithm. In A. Apostolico, M. Crochemore, K. Park (Eds.):\r\nCombinatorial Pattern Matching, Lecture Notes in Computer Science\r\n3537. Springer, pp. 288-297, 2005.\r\n[16] M. Mhashi, The effect of multiple reference characters on detecting\r\nmatches in string searching algorithms, Software Practice & Experience\r\nVol. 35, no. 13, pp. 1299-1315, 2005.M. Young, The Techincal Writers\r\nHandbook. Mill Valley, CA: University Science, 1989.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 8, 2007"}