Improved approximate pattern matching on hypertext
The problem of approximate pattern matching on hypertext is defined and solved by Amir et al. in O(m(n logm+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.
KeywordsSpace Complexity Edit Distance Classical Algorithm Text Character Extra Space
Unable to display preview. Download preview PDF.
- 1.T. Akutsu. A linear time pattern matching algorithm between a string and a tree. In Proc. CPM'93, pages 1–10, 1993.Google Scholar
- 2.A. Amir, M. Lewenstein, and N. Lewenstein. Pattern matching in hypertext. In Proc. WADS'97, LNCS 1272, pages 160–173, 1997.Google Scholar
- 4.R. Baeza-Yates and C. Perleberg. Fast and practical approximate pattern matching. In Proc. CPM'92, LNCS 644, pages 185–192, 1992.Google Scholar
- 6.J. Conklin. Hypertext: An introduction and survey. IEEE Computer, 20(9):17–41, September 1987.Google Scholar
- 7.G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. Karkäinen. Episode matching. In Proc. CPM'97, LNCS 1264, pages 12–27, 1997.Google Scholar
- 9.U. Manber and S. Wu. Approximate string matching with arbitrary costs for text and hypertext. In Proc. IAPR Workshop on Structural and Syntactic Pattern Recognition, pages 22–33, Bern, Switzerland, 1992.Google Scholar
- 10.K. Park and D. Kim. String matching in hypertext. In Proc. CPM'95, pages 318–329, 1995.Google Scholar
- 12.E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proc. ESA'95, LNCS 979, 1995.Google Scholar
- 14.S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83–91, October 1992.Google Scholar