On a compact encoding of the swap automaton (Q2446600): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Pattern Matching with Swaps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Overlap 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: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pattern Matching with Swaps for Short Patterns in Linear Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Algorithm for Efficient Pattern Matching with Swaps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach / rank | |||
Normal rank |
Latest revision as of 10:53, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a compact encoding of the swap automaton |
scientific article |
Statements
On a compact encoding of the swap automaton (English)
0 references
17 April 2014
0 references
combinatorial problems
0 references
string algorithms
0 references
automata theory
0 references
word-level parallelism
0 references
0 references