The second algorithm needs O(n/a+m) time in use of a(m+1) processors, where 1ZHONG ChengCHEN GuoLiang钟诚陈国良软件学报Cheng, Z., Liang, C.G.: Parallel Algorithms for Approximate String Matching on PRAM and LARPBS. Journal of Software 15(2), 159–169 (2004) MathSciNet MATH...
associated string-matching problemlocally best approximate occurrencesmaximal common substringsThe author studies approximate string-matching in connection with two string distance functions that are computable in linear time. The first function is based on the so-called q-grams. An algorithm is given ...
The 25th Workshop on Combinatorial Mathematics and Computation Theory An Approximate String Matching Algorithm Based upon the Candidate Elimination Method In this paper, we consider the approximate string matching problem. We give a method to eliminate candidate locations in text T as there can be no...
5) pattern matching 字符串匹配 1. This paper presents a high effective double hash floating pattern matching algorithm,which can be implemented on an FPGA easily. 提出了一种在FPGA上易于实现的高效双Hash浮动字符串匹配算法,其优点是消耗FPGA资源少,处理速度快,并且模式串可以方便地在线更新。 2. In...
3) large scale approximate string matching 大规模特征串近似匹配 4) approximate multiple object string matching 多目标串近似匹配 1. The experimental results on the cluster of heterogeneous personal computers show that the parallel algorithm forapproximate multiple object string matchingwith the presented op...
Recently a new variation of approximate Boyer-Moore string matching was presented for the k -mismatch problem. The variation, called FAAST, is specifically tuned for small alphabets. We further improve this algorithm gaining speedups in both preprocessing and searching. We also present three ...
Park. An improved algorithm for approximate string matching. SIAM J. Comput. , 19:989–999, 1990. MATH MathSciNetZ. Galil and K. Park, An Improved Algorithm for Approximate String Matching, SIAM J. Comput. 19(6) (1990), 989–999....
Implemented Ukkonens Approximate String Matching algorithm Nov 15, 2017 Readme.md Update build status badge Dec 19, 2022 bench.js Ran formatting Oct 19, 2023 index.js Modernise the project Dec 19, 2022 package.json Merge pull request#57from sunesimonsen/dependabot/npm_and_yarn/moch… ...
Approximate string matching based on the n-gram inverted index (simply, n-gram Matching) has been widely used. A major reason is that it is scalable for large databases since it is not a main memory algorithm. Nevertheless, n-gram Matching also has drawbacks: the query performance tends to...
Approximate stroke sequence string matching algorithm for character recognition and analysis 来自 Citeseer 喜欢 0 阅读量: 25 作者:SH Cha,YC Shin,SN Srihari 摘要: IEEE Computer Society Digital Library 关键词: Approximate String Matching Chain-code Character Recognition Handwriting Analysis Pattern Matching...