Abstract
Given a text T and a pattern P, the order-preserving pattern matching (OPPM for short) problem is to find all substrings of T which have the same relative orders as P. Recently, approximate OPPM that allows errors have been studied such as OPPM with k-mismatches. In this paper we define the OPPM with scaling which is a novel criteria for approximate OPPM by considering the relative orders of cusps and the scale of lengths of strings between them. Also we present an algorithm to solve the OPPM problem with scaling in O(n+mlogm) time, which is the same time bound as the best known exact OPPM algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
