Abstract
The NP-complete Permutation Pattern Matching problem asks whether a permutation P can be matched into a permutation T. A matching is an order-preserving embedding of P into T. We present a fixed-parameter algorithm solving this problem with an exponential worst-case runtime of \(\mathcal{O}^*(1.79^{\sf{run}(T)})\), where run(T) denotes the number of alternating runs of T. This is the first algorithm that improves upon the \(\mathcal{O}^*(2^n)\) runtime required by brute-force search without imposing restrictions on P and T. Furthermore we prove that – under standard complexity theoretic assumptions – such a fixed-parameter tractability result is not possible for run(P).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discrete Math. 22(2), 629–649 (2008)
Albert, M., Aldred, R., Atkinson, M., Holton, D.: Algorithms for Pattern Involvement in Permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 355–367. Springer, Heidelberg (2001)
André, D.: Étude sur les maxima, minima et séquences des permutations. Ann. Sci. École Norm. Sup. 3(1), 121–135 (1884)
Bona, M.: Combinatorics of permutations. Discrete Mathematics and Its Applications. Chapman & Hall/CRC (2004)
Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Information Processing Letters 65(5), 277–283 (1998)
Bruner, M.L., Lackner, M.: A fast algorithm for permutation pattern matching based on alternating runs. CoRR (2012)
Chang, M.S., Wang, F.H.: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters 43(6), 293–295 (1992)
Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Heidelberg (2006)
Guillemot, S., Vialette, S.: Pattern Matching for 321-Avoiding Permutations. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1064–1073. Springer, Heidelberg (2009)
Ibarra, L.: Finding pattern matchings for permutations. Information Processing Letters 61(6), 293–295 (1997)
Kitaev, S.: Patterns in Permutations and Words. Springer, Heidelberg (2011)
Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. I. Addison-Wesley (1968)
Levene, H., Wolfowitz, J.: The covariance matrix of runs up and down. The Annals of Mathematical Statistics 15(1), 58–69 (1944)
Mäkinen, E.: On the longest upsequence problem for permutations. International Journal of Computer Mathematics 77(1), 45–53 (2001)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics And Its Applications. Oxford University Press (2006)
Schensted, C.: Longest increasing and decreasing subsequences. Classic Papers in Combinatorics, pp. 299–311 (1987)
Simion, R., Schmidt, F.W.: Restricted permutations. European Journal of Combinatorics 6, 383–406 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruner, ML., Lackner, M. (2012). A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-31155-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31154-3
Online ISBN: 978-3-642-31155-0
eBook Packages: Computer ScienceComputer Science (R0)