The Boyer–Moore–Galil String Searching Strategies Revisited
SIAM Journal on Computing1986Vol. 15(1), pp. 98–105
Citations Over TimeTop 10% of 1986 papers
Abstract
Based on the Boyer–Moore–Galil approach, a new algorithm is proposed which requires a number of character comparisons bounded by 2n, regardless of the number of occurrences of the pattern in the textstring. Preprocessing is only slightly more involved and still requires a time linear in the pattern size.
Related Papers
- → Character, Action, Incident(2011)2 cited
- A Small Character, A Great Spirit(2003)
- A Discussion of Protruding the News Character,Pertinent Character and Regional Character of Supplement——Based on the Cases of Chaozhou Daily(2010)
- A Comment on the Official Seal Character Quality of "Shuowen Jiezi" (Remarks on the Character Structure)(2005)
- Briefly on the Change of Environment to Character(2007)