%0 Journal Article
%T Single pattern string exact matching algorithms based on hybrid strategy<br>基于组合策略的单模式串精确匹配算法
%A XU Xiu-lin
%A HU Ke-jin
%A <br>许秀林
%A 胡克瑾
%J 计算机应用
%D 2008
%I 
%X It is researched by comparing their time complexities of LDM, ILDM1, ILDM2 algorithm etc. with RF algorithm that only uses a smallest suffix automaton. The experiment shows that the time complexities of LDM, ILDM1 algorithms are poorer than that of RF algorithm, and there is no efficiency for the hybrid strategy in LDM, ILDM1. The experiment also finds that it is not the best strategy for middle and small alphabet that the forward finite state automaton is suspended when the length of pattern prefixes-R is not greater than half of m, the length of pattern string, in ILDM2 algorithm.
%K 模式匹配
%K LDM算法
%K 后缀自动机
%K 有限状态自动机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=0C9AA3053B71D78A4EB1BC26EF526F57&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=CA4FD0336C81A37A&sid=E1D946F217E3B046&eid=6CCE24D86D03D083&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=8