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...
| 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 |
| Summary: | 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 solution allows relatively fast search multiple patterns in text with given k-differences(or mismatches). This paper presents comparison of solution based on MAG algorithm, and [4]. Experiments on DNA, English, Proteins and XML texts with up to k errors show that the new proposed algorithm achieves relatively good results in practical use.
|
|---|---|
| ISSN: | 2083-0157 2391-6761 |