An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === In this thesis, we discuss the exact string matching problem and approximate string matching problem. We avoid using a brute-force algorithm to solve the string matching problem. We improve the Bad Character Rule of Boyer and Moore Algorithm and compare it wit...
Main Authors: | Y. K. Shieh, 謝一功 |
---|---|
Other Authors: | R. C. T. Lee |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/66121462520038468689 |
Similar Items
-
SQL Injection Attack Scanner Using Boyer-Moore String Matching Algorithm
by: Ali, FM, et al.
Published: (2017) -
A Boyer-Moore Based Multiple Pattern Matching Algorithm
by: Tsung-LinHsieh, et al.
Published: (2012) -
A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm
by: Ali, F.H.M, et al.
Published: (2015) -
A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm
by: Ali, FHM, et al.
Published: (2015) -
Boyer-Moore String Matching Algorithm and SHA512 Implementation for Jpeg/exif File Fingerprint Compilation in DSA
by: Rachmad Fitriyanto, et al.
Published: (2020-06-01)