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 |
id |
doaj-c8a3164865904faa95bd45d99c30777c |
---|---|
record_format |
Article |
spelling |
doaj-c8a3164865904faa95bd45d99c30777c2020-11-25T03:31:19ZengLublin University of TechnologyInformatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska 2083-01572391-67612017-09-017310.5604/01.3001.0010.5214APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHINGRobert Susik0Lodz University of Technology 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. https://ph.pollub.pl/index.php/iapgos/article/view/1366text processingapproximate string matchingstring algorithmsq-gram |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Robert Susik |
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 |
author_facet |
Robert Susik |
author_sort |
Robert Susik |
title |
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_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_sort |
applying a q-gram based multiple string matching algorithm for approximate matching |
publisher |
Lublin University of Technology |
series |
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska |
issn |
2083-0157 2391-6761 |
publishDate |
2017-09-01 |
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.
|
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 |
_version_ |
1724572263597998080 |