Advertisement

Algorithms for Pattern Involvement in Permutations

  • Michael H. Albert
  • Robert E. L. Aldred
  • Mike D. Atkinson
  • Derek A. Holton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)

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).

Keywords

Recognition Algorithm Pattern Involvement Permutation Graph Registration Information Brute Force Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M.D. Atkinson: Restricted permutations, Discrete Math.195 (1999), 27–38. 355, 363MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    P. Bose, J.F. Buss, A. Lubiw: Pattern matching for permutations, Inform. Process. Lett.65 (1998), 277–283.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    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.CrossRefzbMATHGoogle Scholar
  4. 4.
    O. Guibert: Personal communication.Google Scholar
  5. 5.
    D. E. Knuth: Fundamental Algorithms, The Art of Computer Programming Vol.1 (First Edition), Addison-Wesley, Reading, Mass.(1967).Google Scholar
  6. 6.
    V. R. Pratt: Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973), 268–277.Google Scholar
  7. 7.
    R. Simion, F.W. Schmidt: Restricted permutations, Europ. J.C ombinatorics 6 (1985), 383–406.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Z.E. Stankova: Forbidden subsequences, Discrete Math. 132 (1994), 291–316.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Z. E. Stankova: Classification of forbidden subsequences of length 4, European J. Combin.17 (1996), no.5, 501–517.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    R. E. Tarjan: Sorting using networks of queues and stacks, Journal of the ACM 19 (1972), 341–346.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    J. West: Generating trees and forbidden sequences, Discrete Math.157 (1996), 363–374.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Michael H. Albert
    • 1
  • Robert E. L. Aldred
    • 2
  • Mike D. Atkinson
    • 1
  • Derek A. Holton
    • 2
  1. 1.Department of Computer ScienceUniversity of OtagoOtagoNew Zealand
  2. 2.Department of Mathematics and StatisticsUniversity of OtagoOtagoNew Zealand

Personalised recommendations