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 |
id |
ndltd-TW-095NCNU0114007 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-095NCNU01140072016-05-25T04:14:20Z http://ndltd.ncl.edu.tw/handle/46723272181241712677 Solving the Exact String Matching Problem by Using the 2-Substring Algorithm 使用2-子字串演算法解決完整字串比對問題 Kuei-Hui Liao 廖桂慧 碩士 國立暨南國際大學 生物醫學科技研究所 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. For example, KMP algorithm、Boyer-and-Moore algorithm. In this thesis, we proposed a method to solve the exact string matching problem. We proposed a rule, called the 2-substring rule, which avoids the brute force method and can be used to solve the problem. We know the time complexity of KMP algorithm is better than Boyer-and-Moore algorithm. But the practice of Boyer-and-Moore algorithm is faster than KMP algorithm. We implement our method in practice. Our method not only is faster than KMP algorithm, Boyer and Moore algorithm, Horspool algorithm and Quick Search algorithm but also is earlier to implement. R.C.T. Lee 李家同 2007 學位論文 ; thesis 61 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立暨南國際大學 === 生物醫學科技研究所 === 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. For example, KMP algorithm、Boyer-and-Moore algorithm.
In this thesis, we proposed a method to solve the exact string matching problem. We proposed a rule, called the 2-substring rule, which avoids the brute force method and can be used to solve the problem. We know the time complexity of KMP algorithm is better than Boyer-and-Moore algorithm. But the practice of Boyer-and-Moore algorithm is faster than KMP algorithm. We implement our method in practice. Our method not only is faster than KMP algorithm, Boyer and Moore algorithm, Horspool algorithm and Quick Search algorithm but also is earlier to implement.
|
author2 |
R.C.T. Lee |
author_facet |
R.C.T. Lee Kuei-Hui Liao 廖桂慧 |
author |
Kuei-Hui Liao 廖桂慧 |
spellingShingle |
Kuei-Hui Liao 廖桂慧 Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
author_sort |
Kuei-Hui Liao |
title |
Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
title_short |
Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
title_full |
Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
title_fullStr |
Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
title_full_unstemmed |
Solving the Exact String Matching Problem by Using the 2-Substring Algorithm |
title_sort |
solving the exact string matching problem by using the 2-substring algorithm |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/46723272181241712677 |
work_keys_str_mv |
AT kueihuiliao solvingtheexactstringmatchingproblembyusingthe2substringalgorithm AT liàoguìhuì solvingtheexactstringmatchingproblembyusingthe2substringalgorithm AT kueihuiliao shǐyòng2zizìchuànyǎnsuànfǎjiějuéwánzhěngzìchuànbǐduìwèntí AT liàoguìhuì shǐyòng2zizìchuànyǎnsuànfǎjiějuéwánzhěngzìchuànbǐduìwèntí |
_version_ |
1718280692083720192 |