A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A linear time algorithm for consecutive permutation pattern matching
2013
Information Processing Letters
We say that two sequences x and w of length m are order-isomorphic (of the We present a simple linear time algorithm for checking if a given sequence y of length n contains a factor which is order-isomorphic to a given pattern x. A factor is a subsequence of consecutive symbols of y, so we call our problem the consecutive permutation pattern matching. The (general) permutation pattern matching problem is related to general subsequences and is known to be NP-complete. We show that the situation
doi:10.1016/j.ipl.2013.03.015
fatcat:yp5pzchhzzek5cd2m3zla6qhg4