The problem of approximate pattern matching on hypertext is defined and solved by Amir et al. in O(m(n log m+e)) time, where m is the length of the pattern, n is the total text size and e is the total number of edges. Their space complexity is O(mn). We present a new algorithm which is O(mk(n+e)) time and needs only O(n) extra space, where k展开▼
机译:Amir等人定义并解决了超文本上的近似模式匹配问题。以O(m(n log m + e))的时间为单位,其中m是图案的长度,n是文本的总大小,e是边缘的总数。它们的空间复杂度为O(mn)。我们提出了一种新算法,该算法的时间为O(mk(n + e)),仅需要O(n)多余的空间,其中k 展开▼