An efficient skip-search approach to swap matching
The swap matching problem consists in finding all occurrences of a pattern x of length m in a
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching
The pattern matching problem with swaps is to find all occurrences of a pattern in a text
while allowing the pattern to swap adjacent symbols. The goal is to design fast matching …
while allowing the pattern to swap adjacent symbols. The goal is to design fast matching …
Run-Length Encoded Nondeterministic KMP and Suffix Automata
E Giaquinta - Implementation and Application of Automata: 20th …, 2015 - Springer
We present a novel bit-parallel representation, based on the run-length encoding, of the
nondeterministic KMP and suffix automata for a string P with at least two distinct symbols …
nondeterministic KMP and suffix automata for a string P with at least two distinct symbols …
[PDF][PDF] A Complete Bibliography of Publications in Information Processing Letters: 2010–2019
NHF Beebe - 2024 - ctan.math.utah.edu
A Complete Bibliography of Publications in Information Processing Letters: 2010–2019
Page 1 A Complete Bibliography of Publications in Information Processing Letters: 2010–2019 …
Page 1 A Complete Bibliography of Publications in Information Processing Letters: 2010–2019 …