Fast Exact Pattern Matching by the Means of a Character Bit Representation-Reference-Cited by-同舟云学术

Fast Exact Pattern Matching by the Means of a Character Bit Representation

Published:2022-03-07 Issue:3 Volume:3 Page:
ISSN:2662-995X
Container-title:SN Computer Science
language:en
Short-container-title:SN COMPUT. SCI.

Author:

Zavadskyi Igor O.^ORCID

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s42979-022-01052-w.pdf

Reference26 articles.

1. Anisimov AV, Zavadskyi IO. Variable-length prefix codes with multiple delimiters. IEEE Trans Inf Theory. 2017;63(5):2885–95. https://doi.org/10.1109/TIT.2017.2674670.

2. Brisaboa N, Farina A, Navarro G, Esteller M. (s,c)-dense coding: an optimized compression code for natural language text databases. In: Proceedings of symposium on string processing and information retrieval. 2003;2857, pp. 122–136. Manaus, Brazil.

3. Cantone D, Faro S. Fast-search algorithms: new efficient variants of the Boyer–Moore pattern-matching algorithm. J Autom Lang Comb. 2005;10(5/6):589–608.

4. Commentz-Walter B. A string matching algorithm fast on the average. In: Proceedings of international colloquium on automata, languages, and programming; 1979;pp. 118–132.

5. Durian B, Holub J, Peltola H, Tarhio J. Tuning BNDM with q-grams. In: Finocchi I, Hershberger J, editors. Poceedings of the workshop on algorithm engineering and experiments. New York: SIAM; 2009. p. 29–37. https://doi.org/10.1137/1.9781611972894.3.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Natural-Language Text Compression Using Reverse Multi-Delimiter Codes;Cybernetics and Systems Analysis;2024-01

2. NATURAL-LANGUAGE TEXT COMPRESSION USING REVERSE MULTI-DELIMITER CODES;Kibernetyka ta Systemnyi Analiz;2024

3. Exact pattern matching. Current achievements and research;Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics;2023