Solving the Exact String Matching Problem by Using the 2-Substring Algorithm
碩士 === 國立暨南國際大學 === 生物醫學科技研究所 === 95 === String matching is a very important component of many problems, such as data compression, search engine, speech recognition, virus detection, computational biology, and so on. There are many efficient method proposed to solve the string matching problem. Fo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/46723272181241712677 |