An Exact String Matching Problem Using Data Encoding Scheme
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === The traditional exact string matching problem is to find all locations of a pattern string with length m in a text with length n. Here we propose a new encoding method to shorten the both lengths of pattern and text by substituting the substring between a speci...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99302180071058684639 |