On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees.
Jan TrávnícekJan JanousekBorivoj MelicharLoek CleophasPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- pattern matching
- boyer moore
- tree matching
- pattern matching algorithm
- tree structure
- sliding window
- approximate pattern matching
- bit parallel
- search algorithm
- matching process
- dynamic programming
- regular expressions
- classification trees
- hamming distance
- data sets
- string matching
- binary tree
- matching algorithm
- computational complexity
- suffix tree
- coding scheme
- maximum weight
- data structure
- decision trees
- databases