Login / Signup
An O(n2logm)-time algorithm for the boxed-mesh permutation pattern matching problem.
Sukhyeun Cho
Joong Chae Na
Jeong Seop Sim
Published in:
Theor. Comput. Sci. (2018)
Keyphrases
</>
pattern matching
string matching
boyer moore
pattern matching algorithm
matching process
approximate pattern matching
dynamic programming
computational complexity
bit parallel
tree matching
regular expressions
hamming distance
databases
distance measure
xml documents
database systems
image processing