An Approximate String Matching Based on an Exact String Matching with Constant Pattern Length
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === The string matching problem is a very important problem which is needed to solve in computer science, computational biology and other domains. The exact matching problem is defined as follows: Given a string T whose length is n and a string P whose length is m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/45738203365580501083 |