An Improved BLIM Algorithm Using q-grams

碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 100 === In this thesis we present a new matching algorithm to improve the BLIM algorithm by using q-grams in the matching phase. Our analysis shows that, in the best case, the time complexity of our algorithm is O(n/m), where n is the length of sequence, and m is the...

Full description

Bibliographic Details
Main Authors: Bo-Hau Lin, 林柏豪
Other Authors: Chien-Feng Huang
Format: Others
Language:en_US
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/85648780230955149692
Description
Summary:碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 100 === In this thesis we present a new matching algorithm to improve the BLIM algorithm by using q-grams in the matching phase. Our analysis shows that, in the best case, the time complexity of our algorithm is O(n/m), where n is the length of sequence, and m is the length of pattern. The experiments show that the run time of our algorithm, when compared with the BLIM algorithm, is reduced by about 20 - 40%.