A Combination of Berry Ravindran Algorithm and Two Way Algorithm for Exact String Matching
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === The exact string matching problem is defined as follows: We are given a text and a pattern , . Our purpose is to find all occurrences of in . It is a classical and important problem in computer science. In this thesis, we propose a new approach to solve t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/43753477020737174183 |