Improved Approximate Pattern Matching on Hypertext

The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + 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 < m is the number of allowed errors in the pattern. If the graph is acyclic, our time complexity drops to O(m(n+ e)), improving Amir's results.

• Type: Conference
• Year: 1998
• Where: LATIN
• Authors: Gonzalo Navarro
• Keywords: Amir Et Al, Information Management, LATIN 1998, Pattern Matching, Total Text Size