APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one (called partitioning into exact search). Presented s...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Lublin University of Technology
2017-09-01
|
Series: | Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska |
Subjects: | |
Online Access: | https://ph.pollub.pl/index.php/iapgos/article/view/1366 |