Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings.
Simone FaroStefano ScafitiPublished in: ICTCS (2021)
Keyphrases
- bit parallel
- regular expressions
- finite automata
- regular languages
- pattern matching
- string matching
- edit distance
- suffix tree
- finite state automata
- suffix array
- tree automata
- probabilistic automata
- hamming distance
- approximate string matching
- xml schema
- cellular automata
- query language
- finite state machines
- pruning algorithm
- finite state
- matching algorithm
- data sets
- pattern languages
- learning automata
- graph matching
- object oriented
- similarity measure
- finite alphabet
- databases