Abstract

A family of algorithms for fast pattern matching in a bitstream is described. A bitstream is assumed to be stored in a memory and divided into bytes and machine words. The proposed algorithms are based on RZ-family of algorithms for fast pattern matching in a 256-ary text and inherit such their properties as ‘1.5-byte read’, double skip loop, right-to-left text processing as well as a special technique of multiple sliding windows. Beyond that, the new algorithms provide longer average shifts than the best known Binary Faro-Lecroq algorithm and more efficient technique of match checking. Applied to a text close to random, our algorithms outperform all known analogues for all pattern lengths from 20 up to 500.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.