%0 Journal Article
%T 1/p-Approximate String Matching with Section<br>分段处理的1／p概率字符串匹配
%A WU Ling QIN Zhi-guang SHI Hong-song CHEN Zhao-chong
%A <br>吴玲
%A 秦志光
%A 石竑松
%A 陈兆冲
%J 计算机科学
%D 2008
%I 
%X Most of the existing Approximate String Matching(ASM) algorithms can determine the similarity of strings by computing the minimal number of mismatching characters(edition distance) between them,while the problem that deciding whether at least 1/p of the pattern string falls into the text string with order remains unresolved since these algorithms treat the pattern string and text string equally in computing the full edition distance between them.Based on the dynamic programming string matching algorithm(DP-...
%K Approximate string matching
%K Dynamic programming
%K Section policy
%K Trace back policy<br>概率字符串匹配
%K 动态规划
%K 分段策略
%K 回溯策略
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=AEAC32001305E001F25B31123C55E87F&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=DF92D298D3FF1E6E&sid=C753EB8AC8F551B9&eid=C36EC077A8A90308&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=6