On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns

DOI10.1016/J.JDA.2011.02.001zbMATH Open1255.68092OpenAlexW2133888807MaRDI QIDQ414441FDOQ414441

Authors: Domenico Cantone, Simone Faro, Emanuele Giaquinta 

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.02.001

Recommendations

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• scientific article; zbMATH DE number 1949653

zbMATH Keywords

automatatext processingmultiple pattern matchingbit-parallelism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Matters computational. Ideas, algorithms, source code.
• Efficient string matching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Average sizes of suffix trees and DAWGs
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• New techniques for regular expression searching
• Average complexity of exact and approximate multiple string matching
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• Complete inverted files for efficient text retrieval and analysis

Cited In (8)

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Construction of Aho Corasick automaton in linear time for integer alphabets
• A Table Compression Method for Extended Aho-Corasick Automaton
• Title not available (Why is that?)
• A New Approach to Determinisation Using Bit-Parallelism
• Combinatorial Pattern Matching
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM

Uses Software

• FXT
• hfloat

This page was built for publication: On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414441)