"A 2006 CHOICE Outstanding Academic Title, this text provides comprehensive coverage of permutations. The second edition features a new chapter on modeling genomes by using permutations. Along with new applications such as genome sorting, this edition includes a set of warm-up exercises to ease readers into a problem solving mode as well as new sections addressing the growth rate of permutation classes, permutation tableaux, superpatterns, and alternating subsequences. The text also discusses pattern avoidance, inversions, and linear orders"--

"Preface to the Second Edition It has been eight years since the first edition of Combinatorics of Permutations was published. All parts of the subject went through significant progress during those years. Therefore, we had to make some painful choices as to what to include in the new edition of this book. First, there is a new chapter to this edition, Chapter 9, which is devoted to sorting algorithms whose original motivation comes from molecular biology. This very young part of combinatorics is known for its easily stated and extremely difficult problems which sometimes can be solved using deep techniques from remote-looking parts of mathematics. We decided to discuss three sorting algorithms in detail. Second, half of the existing chapters, namely Chapters 1, 3, 4, and 6 have been significantly changed or extended. Chapter 1 has a new section on Alternating Permutations, while Chapter 3 has new material on multivariate applications of the Exponential Formula. In Chapter 4, which discusses pattern avoidance, several important results, some in the text, some in the exercises, have been improved. Chapter 6, discussing some probabilistic aspects of permutations, now covers the concept of asymptotically normal distributions. Third, all chapters have an extended Exercises section and an extended Problems Plus section. The latter often contains results from the last eight years. Exercises marked with a (+) sign are thought to be more difficult than average, while exercises marked with a (-) sign are thought to be easier. The book does not assume previous knowledge of combinatorics above the level of an introductory undergraduate course"--