Tree pattern matching to subset matching in linear time

Abstract. In this paper, we show an O(n + m) time Turing reduction from the tree pattern matching problem to another problem calledthe subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yieldan O � n log 2 m + m � time deterministic algorithm and an O(n log n + m) time Monte Carlo algorithm for the tree pattern matching problem