Longest subsequences in permutations

Australasian Journal of Combinatorics

Volumn 28, Issue , 2003, Pages 225-238

  Albert, M H ^a   Aldred, R E L ^a   Atkinson, M D ^a   van Ditmarsch, H P ^a   Handley, B D ^a   Handley, C C ^a   Opatrny, J ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751169198     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. M.H. Albert, R. Aldred, M.D. Atkinson and D. A. Holton, Algorithms for pattern involvement in permutations, in Algorithms and Computation, 12th International Symposium, ISAAC 2001, Proceedings LNCS 2223, P. Eades, T. Takaoka (Eds.) pp.355-366.
2. D. Aldous and P. Diaconis, Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem, Bull. Amer. Math. Soc. 36 (1999), 413-432.
3. R.M. Baer and P. Brock, Natural sorting, J. Soc. Indust. Appl. Math. 10 (1962), 284-304.
4. M. Bóna, The Solution of a Conjecture of Wilf and Stanley for all layered patterns, J. Combin. Theory, Ser. A 85 (1999), 96-104.
5. P. Bose, J. F. Buss and A. Lubiw, Pattern matching for permutations, Inform. Process. Lett. 65 (1998), 277-283.
6. A. L. Delcher, S. Kasif, R.D. Fleischmann, J. Paterson, O. White and S. L. Salzberg, Alignment of whole genomes, Nucleic Acids Research 27 (1999), 2369-2376.
7. M. L. Fredman, On computing the length of longest increasing subsequences, Discrete Math. 11 (1975), 29-35.
8. D. Gries, The Science of Programming, Springer Verlag (New York) 1981.
9. U. Manber, Introduction to Algorithms, Addison-Wesley (Reading, Mass.) 1989.
10. M. M. Murphy, Ph.D. thesis, University of St Andrews, in preparation.
11. C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961), 179-191.
12. R. Simion and F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985), 383-406.
13. R. Stanley, Enumerative Combinatorics, volume 2, Cambridge Studies in Advanced Mathematics 62, Cambridge University Press (Cambridge, UK) 1999.
14. J. M. Steele, Probability Theory and Optimization, SIAM 1997.
15. W. Unger, The complexity of colouring circle graphs, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science, 1992, Springer Lecture Notes in Computer Science 577, 389-400.
16. W. Unger, On the k-colouring of circle graphs, Proc. 5th Annual Symposium on Theoretical Aspects of Computer Science, 1988, Springer Lecture Notes in Computer Science 294, 61-72.