保序匹配
Order Preserving Matching
摘要：
我们引入了一个新的字符串匹配问题，称为保序匹配的数字字符串中的模式匹配的文本，如果文本包含一个子串的相对顺序与模式相一致。保序匹配适用于许多场景，如股票价格分析和音乐旋律匹配，其中应该匹配顺序关系而不是字符串本身。解决保序匹配与数字字符串的顺序关系的表示有关。我们定义了前缀表示和最近邻表示，这导致有效的算法保序匹配。我们提出了有效的算法为单一和多模式的情况下。对于单模式的情况，我们给出了一个O（nlog m）时间的算法，并进一步优化，以获得O（n + mlog m）时间。对于多模式的情况下，我们给出了一个O（n log m）的时间算法。
英文摘要：
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders coincide with those of the pattern. Order-preserving matching is applicable to many scenarios such as stock price analysis and musical melody matching in which the order relations should be matched instead of the strings themselves. Solving order-preserving matching has to do with representations of order relations of a numeric string. We define prefix representation and nearest neighbor representation, which lead to efficient algorithms for order-preserving matching. We present efficient algorithms for single and multiple pattern cases. For the single pattern case, we give an O(n log m) time algorithm and optimize it further to obtain O(n + m log m) time. For the multiple pattern case, we give an O(n log m) time algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
