Proceedings Article10.1109/FSCS.1990.89533
Faster tree pattern matching
Moshe Dubiner,Zvi Galil,Edith Magen +2 more
- 22 Oct 1990
- pp 145-150
105
TL;DR: The authors improve an O(nm/sup 0.75/ polylog(m)-step algorithm for tree pattern matching by designing a simple O(n square root m polylog (m) algorithm.
read more
Abstract: Recently, R. Kosaraju (Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, p.178-83) gave an O(nm/sup 0.75/ polylog(m))-step algorithm for tree pattern matching. The authors improve this result by designing a simple O(n square root m polylog (m)) algorithm. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey on tree edit distance and related problems
TL;DR: This work surveys the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes and presents one or more of the central algorithms for solving the problem.
920
Comparing multiple RNA secondary structures using tree comparisons
Bruce A. Shapiro,Kaizhong Zhang +1 more
TL;DR: This paper presents another approach to the problem of comparing many secondary structures by utilizing a very efficient tree-matching algorithm that will compare two trees in O([T1] X [T2] X L1 X L2) in the worst case and very close to O[T1?] for average trees representing secondary structures.
349
Verifying candidate matches in sparse and wildcard matching
Richard Cole,Ramesh Hariharan +1 more
- 19 May 2002
TL;DR: The crucial new idea underlying the first three results above is that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean entries; in contrast, almost all previous pattern matching algorithms consider only boolean codes for the alphabet.
Efficient Periodicity Mining in Time Series Databases Using Suffix Trees
TL;DR: This paper presents an algorithm which can detect symbol, sequence (partial), and segment (full cycle) periodicity in time series and is noise resilient; it is generally more time-efficient and noise-resilient than existing algorithms.
134
Faster algorithms for string matching problems: matching the convolution bound
Piotr Indyk
- 08 Nov 1998
TL;DR: This paper gives a randomized O(nlogn)-time algorithm for the string matching with don't cares problem, which improves the Fischer-Paterson bound from 1974 and answers the open problem posed by Weiner and Galil.
129
References
Fast Pattern Matching in Strings
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
3.4K
Pattern Matching in Trees
TL;DR: Five new techniques for tree pattern matching are presented, analyzed for time and space complexity, and compared with previously known methods.
String-matching and other products
Michael J. Fischer,Mike Paterson +1 more
- 01 Jan 1974
TL;DR: By exploiting the formal similarity of string-matching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear.
Efficient tree pattern matching
S.R. Kosaraju
- 30 Oct 1989
TL;DR: An O(nM/sup 0.75/ polylog(m))-step algorithm for tree pattern matching problem is designed and the problems of linear string matching with don't care symbols and linear string max-min convolution are treated.
Related Papers (5)
R. Ramesh,I. V. Ramakrishnan +1 more
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974