Abstract
Multi-pattern matching in trees is fundamental to a variety of programming language systems. A bottleneck in this connection has been the combinatorial problem of constructing the immediate subsumption tree for a simple binary pattern forest. We reduce the complexity of this problem from O(n2) time and O(n2) space to O(nlogn) time and O(n) space. Such a result was conjectured possible in 1982 by Hoffmann and O’Donnell, and in 1992 finding it was called a main open problem by Cai, Paige, and Tarjan.
Cite
CITATION STYLE
Thorup, M. (1994). Efficient preprocessing of simple binary pattern forests. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 350–358). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
