On the longest increasing subsequence of a circular list

Information Processing Letters

Volumn 101, Issue 2, 2007, Pages 55-59

  Albert, M H ^a   Atkinson, M D ^a   Nussbaum, Doron ^b   Sack, Jörg Rüdiger ^b   Santoro, Nicola ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Combinatorial problems; Randomized algorithms

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MONTE CARLO METHODS; NUMERICAL METHODS;

COMBINATORIAL PROBLEMS; MONTE CARLO ALGORITHMS; RANDOMIZED ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 33751163954     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.08.003     Document Type: Article

References (13)

1. Albert M.H., Aldred R.A., Atkinson M.D., van Ditmarsch H., Handley B., Handley C.C., and Opatrny J. Longest subsequences in permutations. Austral. J. Combin. 28 (2003) 225-238
2. Albert M.H., Golynski A., Hamel A.M., López-Ortiz A., Rao S.R., and Safari M.A. Longest increasing subsequences in sliding windows. Theoret. Comput. Sci. 321 (2004) 405-414
3. Aldous D., and Diaconis P. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. 36 (1999) 413-432
4. Baer R.M., and Brock P. Natural sorting over permutation spaces. Math. Comput. 22 (1968) 385-510
5. Baik J., Deift P., and Johansson K. On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 (1999) 1119-1178
6. Charlebois R. Organization of the Prokaryotic Genome (1999), ASM Press, Washington, DC. http://www.life.uiuc.edu/micro/316/topics/chroms-genes-prots/chromosomes.html
7. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), MIT Press, McGraw-Hill Book Company, New York
8. Delcher A.L., Kasif S., Fleischmann R.D., Paterson J., White O., and Salzberg S.L. Alignment of whole genomes. Nucl. Acis Res. 27 (1999) 2369-2376
9. Fredman M.L. On computing the length of longest increasing subsequences. Discrete Math. 11 (1975) 29-35
10. Gries D. The Science of Programming (1981), Springer-Verlag, Heidelberg, New York
11. Manber U. Introduction to Algorithms (1989), Addison-Wesley, Reading, MA
12. Schensted C. Longest increasing and decreasing subsequences. Canad. J. Math. 13 (1961) 179-191
13. Steele J.M. Probability Theory and Optimization (1997), SIAM, New York