Siberian Federal University 
- Issue
- Journal of Siberian Federal University. Engineering & Technologies. 2017 10 (1)
- Authors
- Tsarev, Roman Yu.; Tsareva, Elena A.; Chernigovskiy, Alexey S.
- Contact information
- Tsarev, Roman Yu.: Siberian Federal University 79 Svobodny, Krasnoyarsk, 660041, Russia; tsarev.sfu@mail.ru; Tsareva, Elena A.: Siberian Federal University 79 Svobodny, Krasnoyarsk, 660041, Russia; Chernigovskiy, Alexey S.: Siberian Federal University 79 Svobodny, Krasnoyarsk, 660041, Russia
- Keywords
- pattern; search; data processing; combined algorithm
- Abstract
The string search problem is a classical problem of data processing. Despite a number of existing algorithms for solving this problem, the work in this direction continues. The algorithm proposed in the article develops the theoretical basis of the string search problem by combining the algorithms of two different classes, i.e. forward and backward string searching algorithms, namely, Knuth- Morris-Pratt algorithm and Bower-Moore algorithm. The paper provides the analysis of the proposed combined algorithm and comparison of its results with the basic algorithms, confirming the efficacy of the combined string search algorithm
- Pages
- 126-135
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/31513
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).