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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/66121462520038468689 |