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 |
| id |
ndltd-TW-096NCNU0392026 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-096NCNU03920262016-05-16T04:09:54Z http://ndltd.ncl.edu.tw/handle/66121462520038468689 An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm 以Boyer-Moore演算法為基礎改良之近似字串比對演算法 Y. K. Shieh 謝一功 碩士 國立暨南國際大學 資訊工程學系 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 with the Horspool Algorithm. And we find that the improved method include the information of the Horspool Algorithm. Therefore, we combine the improved method with the Horspool Algorithm. The combinative method has a better efficiency in searching phase. R. C. T. Lee 李家同 2008 學位論文 ; thesis 76 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立暨南國際大學 === 資訊工程學系 === 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 with the Horspool Algorithm. And we find that the improved method include the information of the Horspool Algorithm. Therefore, we combine the improved method with the Horspool Algorithm. The combinative method has a better efficiency in searching phase.
|
| author2 |
R. C. T. Lee |
| author_facet |
R. C. T. Lee Y. K. Shieh 謝一功 |
| author |
Y. K. Shieh 謝一功 |
| spellingShingle |
Y. K. Shieh 謝一功 An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| author_sort |
Y. K. Shieh |
| title |
An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| title_short |
An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| title_full |
An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| title_fullStr |
An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| title_full_unstemmed |
An Improved Approximate String Matching Algorithm Based upon the Boyer-Moore Algorithm |
| title_sort |
improved approximate string matching algorithm based upon the boyer-moore algorithm |
| publishDate |
2008 |
| url |
http://ndltd.ncl.edu.tw/handle/66121462520038468689 |
| work_keys_str_mv |
AT ykshieh animprovedapproximatestringmatchingalgorithmbasedupontheboyermoorealgorithm AT xièyīgōng animprovedapproximatestringmatchingalgorithmbasedupontheboyermoorealgorithm AT ykshieh yǐboyermooreyǎnsuànfǎwèijīchǔgǎiliángzhījìnshìzìchuànbǐduìyǎnsuànfǎ AT xièyīgōng yǐboyermooreyǎnsuànfǎwèijīchǔgǎiliángzhījìnshìzìchuànbǐduìyǎnsuànfǎ AT ykshieh improvedapproximatestringmatchingalgorithmbasedupontheboyermoorealgorithm AT xièyīgōng improvedapproximatestringmatchingalgorithmbasedupontheboyermoorealgorithm |
| _version_ |
1718269054194548736 |