compressed indexapproximate中文摘要讓L = {T1, T2, ..., Tl} 為一字串的集合, 其總長度為n, 以及P = P0P2...Pm1為一長度為m的樣本,且L 和P都建立在一固定的字母表A上.Approximate library man-agement problem 是在容許某種程度的錯誤下, 找出P發生在L中的位置.本論文提出此以前無人關注的動態問題...
Approximate String Matching with Address Bit Errors A string S ∈Σ m can be viewed as a set of pairs S = { (σ i , i) : i ∈ { 0,..., m 1} }. We consider approximate pattern matching problems arising from... A Amir,Y Aumann,O Kapah,... - 《Theoretical Computer Science...
2) approximate string match 相似字符串匹配 1. The purposes of it were to improve the efficiency of searching a string in a large-scale database by the means of approximate string matching and to provide a means to search a string with wildcards. 其目的在于提高基于相似字符串匹配的查询在...
Our approximate string matching approach to recognize gestures The Kinect SDK identifies the position of 20 body joints in a 3D space (x,y,z), thus generating a virtual representation of the human body called “stick model”. These positions are updated 30 times per second, so when we observ...
Sung, W.-K.: Indexed approximate string matching. In: Encyclopedia of Algorithms. Springer, Heidelberg (2008)Sung W K. Indexed approximate string matching [M]. Berlin, Germany: Springer,2008:408-411.Sung, W.-K.: Indexed approximate string matching. In: Encyclopedia of Algorithms, pp. 408...
1) approximate string matching 文字录入 1. This paper sketches the current study situation of auto scoring system of the computer,introduces the realization principles ofapproximate string matchingalgorithms in detail and discusses its key applications in auto scoring of the text inputti. ...
Finally, wepresent a prototype stroke directional and pressuresequence string extractor used on the writeridentification. The importance of this study is theattempt to give a definition of distance between twocharacters based on the two types of strings. !17Document Recognition and Retrieval VIIAuthors...
APPROXIMATE STRING MATCHING: A SIMPLER FASTER ALGORITHM. We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substr... Cole,Richard,Hariharan,... - 《Siam Journal on Computing》 被引量: 102发表...
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 substring S starting from those locations such that the edit distance between S and pattern P is smaller than or equal to a specified error boun...
which mainly aims to find the pattern string in the text and database and allows k differences between the pattern string and its occurring forms in the text.For the problem of approximate string matching,though a number of algorithms have been proposed,there are fewer studies which focus on ...