On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033177 / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple pattern matching
Property / zbMATH Keywords: multiple pattern matching / rank
 
Normal rank
Property / zbMATH Keywords
 
text processing
Property / zbMATH Keywords: text processing / rank
 
Normal rank
Property / zbMATH Keywords
 
automata
Property / zbMATH Keywords: automata / rank
 
Normal rank
Property / zbMATH Keywords
 
bit-parallelism
Property / zbMATH Keywords: bit-parallelism / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: hfloat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FXT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133888807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matters Computational / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average sizes of suffix trees and DAWGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average complexity of exact and approximate multiple string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: New techniques for regular expression searching / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:06, 5 July 2024

scientific article
Language Label Description Also known as
English
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
scientific article

    Statements

    On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    multiple pattern matching
    0 references
    text processing
    0 references
    automata
    0 references
    bit-parallelism
    0 references
    0 references
    0 references

    Identifiers