A NEW APPROACH TO EXACT PATTERN MATCHING
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/35/3/13620Abstract
In this paper we introduce a exible approach to design an eective algorithm for exact
pattern matching, and compare it with some of the most ecient algorithms, such as AOSO, EBOM,
FJS, FSBNDM, HASHq, LBNDM, SA, BMH-SBNDM, SBNDMq, TVSBS. These results are based
on the concept of the degree of fuzziness presented by P. T. Huy et al. in 2002. Theoretical analyses
and experimental results indicate that in practice our proposed algorithm is faster than the above
mentioned algorithms in most of the cases of patterns and alphabets.
Metrics
Metrics Loading ...
Downloads
Published
05-08-2019
How to Cite
[1]
T. H. Nguyen, “A NEW APPROACH TO EXACT PATTERN MATCHING”, JCC, vol. 35, no. 3, p. 197–216, Aug. 2019.
Issue
Section
Articles
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
