Pages that link to "Item:Q418159"

The following pages link to A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159):

Displaying 9 items.

• Fast and flexible packed string matching (Q405577) (← links)
• Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677) (← links)
• The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
• On a compact encoding of the swap automaton (Q2446600) (← links)
• A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
• Compact suffix automata representations for searching long patterns (Q2699978) (← links)
• A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
• Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
• Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)