Abstract
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree of subpatterns to build up the entire pattern. Generally, large improvements over brute force search can be obtained. Even using on-line versions of these methods allow for such improvements, though often not as great as for the full method. Furthermore, by using carefully chosen data structures to fine tune the methods, we establish that any pattern of length 4 can be detected in O(n log n) time. We also improve the complexity bound for detection of a separable pattern from O n 6) to O(n 5 log n).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.D. Atkinson: Restricted permutations, Discrete Math.195 (1999), 27–38. 355, 363
P. Bose, J.F. Buss, A. Lubiw: Pattern matching for permutations, Inform. Process. Lett.65 (1998), 277–283.
M.-S. Chang, F.-H. Wang: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Inform. Process.L ett. 43 (1992), 293–295.
O. Guibert: Personal communication.
D. E. Knuth: Fundamental Algorithms, The Art of Computer Programming Vol.1 (First Edition), Addison-Wesley, Reading, Mass.(1967).
V. R. Pratt: Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973), 268–277.
R. Simion, F.W. Schmidt: Restricted permutations, Europ. J.C ombinatorics 6 (1985), 383–406.
Z.E. Stankova: Forbidden subsequences, Discrete Math. 132 (1994), 291–316.
Z. E. Stankova: Classification of forbidden subsequences of length 4, European J. Combin.17 (1996), no.5, 501–517.
R. E. Tarjan: Sorting using networks of queues and stacks, Journal of the ACM 19 (1972), 341–346.
J. West: Generating trees and forbidden sequences, Discrete Math.157 (1996), 363–374.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Holton, D.A. (2001). Algorithms for Pattern Involvement in Permutations. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive