Fast pattern matching method for a bitstream

Authors

DOI:

https://doi.org/10.17721/1812-5409.2020/4.5

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.

Key words: pattern matching, Faro-Lecroq, fast search, bitstream, search window.

Pages of the article in the issue: 36 - 39

Language of the article: Ukrainian

References

KLEIN S., BEN-NISSAN M.K. (2007) Accelerating Boyer Moore search on binary texts. Proceedings of International Conference on Implementation and Application of Automata, CIAA-07, p. 130–143.

FARO S., LECROQ T. (2009) An efficient matching algorithm for encoded DNA sequences and binary strings. Proceedings of International Conference on Implementation and Application of Automata, p. 106–115.

ZAVADSKYI I.O. (2019) Pattern matching in text with respect to cache memory size. Bulletin of Taras Shevchenko National University of Kyiv. Series Physics & Mathematics, no. 3, p. 69–72.

No 4 (2020)

Downloads

How to Cite

Zavadskyi, I. O. (2020). Fast pattern matching method for a bitstream. Bulletin of Taras Shevchenko National University of Kyiv. Physical and Mathematical Sciences, (4), 36–39. https://doi.org/10.17721/1812-5409.2020/4.5

Issue

No. 4 (2020)

Section

Computer Science and Informatics

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).