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 |
_version_ | 1818857300427800576 |
---|---|
author | Robert Susik |
author_facet | Robert Susik |
author_sort | Robert Susik |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-19T08:38:12Z |
format | Article |
id | doaj.art-c8a3164865904faa95bd45d99c30777c |
institution | Directory Open Access Journal |
issn | 2083-0157 2391-6761 |
language | English |
last_indexed | 2024-12-19T08:38:12Z |
publishDate | 2017-09-01 |
publisher | Lublin University of Technology |
record_format | Article |
series | Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska |
spelling | doaj.art-c8a3164865904faa95bd45d99c30777c2022-12-21T20:28:59ZengLublin University of TechnologyInformatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska2083-01572391-67612017-09-017310.5604/01.3001.0010.5214APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHINGRobert Susik0Lodz University of TechnologyWe 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.https://ph.pollub.pl/index.php/iapgos/article/view/1366text processingapproximate string matchingstring algorithmsq-gram |
spellingShingle | Robert Susik APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska text processing approximate string matching string algorithms q-gram |
title | APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING |
title_full | APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING |
title_fullStr | APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING |
title_full_unstemmed | APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING |
title_short | APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING |
title_sort | applying a q gram based multiple string matching algorithm for approximate matching |
topic | text processing approximate string matching string algorithms q-gram |
url | https://ph.pollub.pl/index.php/iapgos/article/view/1366 |
work_keys_str_mv | AT robertsusik applyingaqgrambasedmultiplestringmatchingalgorithmforapproximatematching |