Abstract
This research shows the process of string matching using a Boyer-Moore algorithm in the form of visual simulation by doing string searching of a pattern string, the result of visualization is recognized that Boyer-Moore algorithm will compare a n string from the right and will test to n-1 String to get the appropriate character of the desired input string.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
