Abstract
In this paper, a Faster algorithm: BMF is proposed, which sets improvements in the time complexity of the BM algorithm. The BMF algorithm defines a new pre-calculation function to increase in the skips of pattern significantly. Experiments indicate that the time complexity is reduced by 63% at most. Therefore, the improved algorithm could provide significant improvement in pattern matching performance when using in an IDS.
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
