A faster closure algorithm for pattern matching in partial-order event data.
Matthew NicholsDavid TaylorPublished in: ICPADS (2007)
Keyphrases
- pattern matching
- boyer moore
- partial order
- data sets
- pattern matching algorithm
- matching process
- matching algorithm
- string matching
- approximate pattern matching
- computational complexity
- dynamic programming
- matching strategy
- hamming distance
- lattice structure
- np hard
- regular expressions
- distance measure
- data points
- total order
- xml documents