Article

Efficient tree pattern matching

Author:

S. R. KosarajuAuthors Info & Claims

SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Pages 178 - 183

https://doi.org/10.1109/SFCS.1989.63475

Published: 30 October 1989 Publication History

Publisher Site

Abstract

A classic open problem on tree pattern matching is whether the naive O(mn)-step algorithm for finding all the occurrences of a pattern tree of size m in a text tree of size n can be improved. An O(nM/sup 0.75/ polylog(m))-step algorithm for this tree pattern matching problem is designed. The problems of linear string matching with don't care symbols and linear string max-min convolution are treated.

Cited By

View all

Stoian MKipf A(2024)DPconv: Super-Polynomially Faster Join OrderingProceedings of the ACM on Management of Data10.1145/36988092:6(1-26)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698809
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Abboud ABackurs AHansen TVassilevska Williams VZamir O(2018)Subtree Isomorphism RevisitedACM Transactions on Algorithms10.1145/309323914:3(1-23)Online publication date: 16-Jun-2018
https://dl.acm.org/doi/10.1145/3093239
Show More Cited By

Efficient tree pattern matching
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

Tree template matching in unranked ordered trees

We consider the problem of tree template matching, a type of tree pattern matching, where the tree templates have some of their leaves denoted as ''don@?t care'', and propose a solution based on the bottom-up technique. Specifically, we transform the ...
Forward linearised tree pattern matching using tree pattern border array
Abstract
We define a tree pattern border array as a property of linearised trees analogous to border arrays from the string domain. We consider tree patterns with node wildcards and subtree wildcards. Then we use the tree pattern border array in a new ...
Constrained tree inclusion
CPM'03: Proceedings of the 14th annual conference on Combinatorial pattern matching

The tree matching problem is considered of given labeled trees P and T, determining if the pattern tree P can be obtained from the text tree T by deleting degree-one and degree-two nodes and, in the case of unordered trees, by also permuting siblings. ...

Comments

Information & Contributors

Information

Published In

SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

October 1989

586 pages

ISBN:0818619821

Publisher

IEEE Computer Society

United States

Publication History

Published: 30 October 1989

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Stoian MKipf A(2024)DPconv: Super-Polynomially Faster Join OrderingProceedings of the ACM on Management of Data10.1145/36988092:6(1-26)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698809
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Abboud ABackurs AHansen TVassilevska Williams VZamir O(2018)Subtree Isomorphism RevisitedACM Transactions on Algorithms10.1145/309323914:3(1-23)Online publication date: 16-Jun-2018
https://dl.acm.org/doi/10.1145/3093239
Abboud ABackurs AHansen TWilliams VZamir O(2016)Subtree isomorphism revisitedProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884523(1256-1271)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884523
Bille PGawrychowski PGørtz ILandau GWeimann O(2016)Longest common extensions in treesTheoretical Computer Science10.1016/j.tcs.2015.08.009638:C(98-107)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.08.009
Kociumaka TPachocki JRadoszewski JRytter WWaleń T(2014)Efficient counting of square substrings in a treeTheoretical Computer Science10.1016/j.tcs.2014.04.015544(60-73)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1016/j.tcs.2014.04.015
Kaneta YArimura HRaman R(2012)Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphismJournal of Discrete Algorithms10.1016/j.jda.2011.12.01814(119-135)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.jda.2011.12.018
Nakashima YI TInenaga SBannai HTakeda M(2012)The position heap of a trieProceedings of the 19th international conference on String Processing and Information Retrieval10.1007/978-3-642-34109-0_38(360-371)Online publication date: 21-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-34109-0_38
Christou MCrochemore MFlouri TIliopoulos CJanoušek JMelichar BPissis S(2011)Computing all subtree repeats in ordered ranked treesProceedings of the 18th international conference on String processing and information retrieval10.5555/2051073.2051106(338-343)Online publication date: 17-Oct-2011
https://dl.acm.org/doi/10.5555/2051073.2051106
Bille PGortz I(2011)The tree inclusion problemACM Transactions on Algorithms10.1145/1978782.19787937:3(1-47)Online publication date: 15-Jul-2011
https://dl.acm.org/doi/10.1145/1978782.1978793
Show More Cited By

Abstract

Cited By

Recommendations

Tree template matching in unranked ordered trees

Forward linearised tree pattern matching using tree pattern border array

Constrained tree inclusion

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations