Abstract

The Pattern Matching with Swaps problem is a variation of the classical pattern matching problem in which a match is allowed to include disjoint local swaps In 2009, Cantone and Faro devised a new dynamic programming algorithm for this problem that runs in time O(nm), where n is the length of the text and m is the length of the pattern In this paper, first, we present an improved dynamic programming formulation of the approach of Cantone and Faro Then, we present an optimal parallelization of our algorithm, based on a linear array model, that runs in time O(m2) using $\lceil \frac n {m-1}\rceil$ processors.

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 call

Disclaimer: 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.