A. Aho and M. Corasick, Efficient string matching: An aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.

R. Baeza-yates and G. Navarro, Faster approximate string matching, Algorithmica, vol.23, pp.127-158, 1999.

S. Faro and T. Lecroq, Twenty years of bit-parallelism in string matching, Prague Stringology Club, pp.72-101, 2012.

R. Joshi and E. Pilli, Fundamentals of Network Forensics: A Research Perspective, 2016.

G. Navarro, NR-grep: A fast and flexible pattern-matching tool, Software-Practice and Experience, vol.31, pp.1265-1312, 2001.

G. Navarro and M. Raffinot, A bit-parallel approach to suffix automata: Fast extended string matching, Proceedings of the Annual Symposium on Combinatorial Pattern Matching, pp.14-33, 1998.

M. Roesch, Snort-Lightweight intrusion detection for networks, Proceedings of the Thirteenth USENIX Conference on System Administration, pp.229-238, 1999.

M. Roesch and C. Green, The Snort Project (manual-snort-org.s3-website-us-east-1.ama zonaws, vol.9, p.2017

D. Sankoff and J. Kruskal, Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, 1983.

A. Shrestha-chitrakar and S. Petrovic, Approximate search with constraints on indels with application in spam filtering, Proceedings of the Norwegian Information Security Conference, pp.22-33, 2015.

A. Shrestha-chitrakar and S. Petrovic, Constrained row-based bitparallel search in intrusion detection, Proceedings of the Norwegian Information Security Conference, pp.68-79, 2016.

A. Shrestha-chitrakar, S. Petrovic, and . Crbp-optype, A constrained approximate search algorithm for detecting similar attack patterns, pp.163-176, 2018.

S. Wu and U. Manber, Fast text searching: Allowing errors, Communications of the ACM, vol.35, issue.10, pp.83-91, 1992.