摘要：Cartesian tree matching is a recently introduced string matching problem in which two strings match if their corresponding Cartesian trees are the same. It is considered appropriate to find patterns regarding their shapes especially in numerical time series data. While many related problems have been addressed, developing a compact index has received relatively less attention. In this paper, we present a 3n o(n)-bit index that can count the number of occurrences of a Cartesian tree pattern in ð'ª(m) time where n and m are the text and pattern length. To the best of our knowledge, this work is the first ð'ª(n)-bit compact data structure for indexing for this problem.
关键词：String Matching; Suffix Array; FM-index; Compact Index; Cartesian Tree Matching
