New prefix-parent, prefix-child, and global-parent representations enable faster Cartesian tree matching, and a binary filtration framework turns any exact string matching algorithm into a Cartesian tree matcher.
Information Processing Letters 83(1), 33–39 (2002)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Cartesian Tree Matching
New prefix-parent, prefix-child, and global-parent representations enable faster Cartesian tree matching, and a binary filtration framework turns any exact string matching algorithm into a Cartesian tree matcher.