Tree pattern matching and subset matching in deterministic O(n log3 n)-time

Richard Cole, Ramesh Hariharan, Piotr Indyk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The main goal of this paper is to give an O(n log3 n) time deterministic algorithm for the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log3 n/log log n) time randomized algorithm for these problems. Finally, we give a O(n log n(z+log n)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length z.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
Pages245-254
Number of pages10
StatePublished - 1999
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

Fingerprint

Pattern matching
Pattern Matching
Matching Problem
Deterministic Algorithm
Subset
Set theory
Randomized Algorithms
Specialization
Immediately
Interval

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Cite this

Cole, R., Hariharan, R., & Indyk, P. (1999). Tree pattern matching and subset matching in deterministic O(n log3 n)-time. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 245-254). SIAM.

Tree pattern matching and subset matching in deterministic O(n log3 n)-time. / Cole, Richard; Hariharan, Ramesh; Indyk, Piotr.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999. p. 245-254.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R, Hariharan, R & Indyk, P 1999, Tree pattern matching and subset matching in deterministic O(n log3 n)-time. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 245-254, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.
Cole R, Hariharan R, Indyk P. Tree pattern matching and subset matching in deterministic O(n log3 n)-time. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999. p. 245-254
Cole, Richard ; Hariharan, Ramesh ; Indyk, Piotr. / Tree pattern matching and subset matching in deterministic O(n log3 n)-time. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999. pp. 245-254
@inproceedings{56985583200c402eb307bdfd15518021,
title = "Tree pattern matching and subset matching in deterministic O(n log3 n)-time",
abstract = "The main goal of this paper is to give an O(n log3 n) time deterministic algorithm for the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log3 n/log log n) time randomized algorithm for these problems. Finally, we give a O(n log n(z+log n)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length z.",
author = "Richard Cole and Ramesh Hariharan and Piotr Indyk",
year = "1999",
language = "English (US)",
pages = "245--254",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

TY - GEN

T1 - Tree pattern matching and subset matching in deterministic O(n log3 n)-time

AU - Cole, Richard

AU - Hariharan, Ramesh

AU - Indyk, Piotr

PY - 1999

Y1 - 1999

N2 - The main goal of this paper is to give an O(n log3 n) time deterministic algorithm for the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log3 n/log log n) time randomized algorithm for these problems. Finally, we give a O(n log n(z+log n)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length z.

AB - The main goal of this paper is to give an O(n log3 n) time deterministic algorithm for the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log3 n/log log n) time randomized algorithm for these problems. Finally, we give a O(n log n(z+log n)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length z.

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

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

M3 - Conference contribution

AN - SCOPUS:0032794945

SP - 245

EP - 254

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -