Abstract
Disclosed is a z-function-based parallel computation method for order-preserving pattern matching and order-preserving multiple pattern matching. Provided is a z-function-based parallel computation method, which includes a step of calculating a z-function which is a maximum length at which a prefix of a suffix CC starting at each position BB with respect to a character string AA of length n coincides with a prefix of a character string S. According to an embodiment of the present invention, it is possible to provide a parallel algorithm using a z-function, which can solve order-preserving pattern matching using DD threads for an EE time.
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.
