Tree pattern matching to subset matching in linear time

Richard Cole, Ramesh Hariharan

Research output: Contribution to journalArticle

Abstract

In this paper, we show an O(n + m) time Turing reduction from the tree pattern matching problem to another problem called the subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yield an 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.

Original languageEnglish (US)
Pages (from-to)1056-1066
Number of pages11
JournalSIAM Journal on Computing
Volume32
Issue number4
DOIs
StatePublished - Jun 2003

Fingerprint

Pattern matching
Pattern Matching
Matching Problem
Linear Time
Subset
Deterministic Algorithm
Set theory
Monte Carlo Algorithm
Turing
Randomized Algorithms
Efficient Algorithms

Keywords

  • Subset matching
  • Tree pattern matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Tree pattern matching to subset matching in linear time. / Cole, Richard; Hariharan, Ramesh.

In: SIAM Journal on Computing, Vol. 32, No. 4, 06.2003, p. 1056-1066.

Research output: Contribution to journalArticle

Cole, Richard ; Hariharan, Ramesh. / Tree pattern matching to subset matching in linear time. In: SIAM Journal on Computing. 2003 ; Vol. 32, No. 4. pp. 1056-1066.
@article{7cdc9dea38c040f4b8485ec5640ff4ab,
title = "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 called the subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yield an 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.",
keywords = "Subset matching, Tree pattern matching",
author = "Richard Cole and Ramesh Hariharan",
year = "2003",
month = "6",
doi = "10.1137/S0097539700382704",
language = "English (US)",
volume = "32",
pages = "1056--1066",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Tree pattern matching to subset matching in linear time

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 2003/6

Y1 - 2003/6

N2 - In this paper, we show an O(n + m) time Turing reduction from the tree pattern matching problem to another problem called the subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yield an 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.

AB - In this paper, we show an O(n + m) time Turing reduction from the tree pattern matching problem to another problem called the subset matching problem. Subsequent works have given efficient deterministic and randomized algorithms for the subset matching problem. Together, these works yield an 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.

KW - Subset matching

KW - Tree pattern matching

UR - http://www.scopus.com/inward/record.url?scp=0141645226&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141645226&partnerID=8YFLogxK

U2 - 10.1137/S0097539700382704

DO - 10.1137/S0097539700382704

M3 - Article

VL - 32

SP - 1056

EP - 1066

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -