Pattern matching with wildcards and length constraints using maximum network flow.
Abdullah N. ArslanDan HeYu HeXindong WuPublished in: J. Discrete Algorithms (2015)
Keyphrases
- pattern matching
- network flow
- integer program
- integer programming
- matching process
- network flow problem
- linear programming
- regular expressions
- minimum cost
- tree matching
- min cost
- pattern matching algorithm
- string matching
- optimization model
- matching strategy
- boyer moore
- similarity measure
- constraint programming
- constraint satisfaction