Pages that link to "Item:Q5463398"

The following pages link to Fast and flexible string matching by combining bit-parallelism and suffix automata (Q5463398):

Displaying 25 items.

• A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
• Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
• String matching with lookahead (Q496556) (← links)
• Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
• Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
• Fast exact string matching algorithms (Q846013) (← links)
• Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
• Improving practical exact string matching (Q990135) (← links)
• Average-optimal string matching (Q1044048) (← links)
• The wide window string matching algorithm (Q1770398) (← links)
• Regular expression searching on compressed text (Q1827268) (← links)
• Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
• Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
• On a compact encoding of the swap automaton (Q2446600) (← links)
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
• A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
• On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
• Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
• Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
• Parallel String Matching (Q5862565) (← links)