@article{Susik_2017, title={APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING}, volume={7}, url={https://ph.pollub.pl/index.php/iapgos/article/view/1366}, DOI={10.5604/01.3001.0010.5214}, abstractNote={<p>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.</p>}, number={3}, journal={Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska}, author={Susik, Robert}, year={2017}, month={Sep.}, pages={47–50} }