Author : Steve Linton
Publisher : Cambridge University Press
Page : 353 pages
File Size : 21,57 MB
Release : 2010-06-03
Category : Mathematics
ISBN : 1139488848
A mixture of survey and research articles by leading experts that will be of interest to specialists in permutation patterns and other researchers in combinatorics and related fields. In addition, the volume provides plenty of material accessible to advanced undergraduates and is a suitable reference for projects and dissertations.
Author : Sergey Kitaev
Publisher : Springer Science & Business Media
Page : 511 pages
File Size : 17,99 MB
Release : 2011-08-30
Category : Computers
ISBN : 3642173330
There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan—Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations. The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology. The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.
Author : Jagath C. Rajapakse
Publisher : Springer Science & Business Media
Page : 197 pages
File Size : 25,7 MB
Release : 2006-08-10
Category : Science
ISBN : 3540374469
This book constitutes the refereed proceedings of the International Workshop on Pattern Recognition in Bioinformatics, PRIB 2006, held in Hong Kong, within the scope of the 18th International Conference on Pattern Recognition, ICPR 2006. The book presents 19 revised full papers, covering all topics of the creation and maintenance of biological databases, and the discovery of knowledge from life sciences data. Includes an introduction to Pattern Recognition in Bioinformatics.
Author : Laxmi Parida
Publisher : CRC Press
Page : 512 pages
File Size : 48,74 MB
Release : 2007-07-04
Category : Computers
ISBN : 1420010735
The computational methods of bioinformatics are being used more and more to process the large volume of current biological data. Promoting an understanding of the underlying biology that produces this data, Pattern Discovery in Bioinformatics: Theory and Algorithms provides the tools to study regularities in biological data. Taking a systema
Author : Ferdinando Cicalese
Publisher : Springer
Page : 429 pages
File Size : 43,11 MB
Release : 2015-06-15
Category : Computers
ISBN : 3319199293
This book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.
Author : Shunsuke Inenaga
Publisher : Springer
Page : 288 pages
File Size : 24,79 MB
Release : 2016-09-20
Category : Computers
ISBN : 3319460498
This book constitutes the refereed proceedings of the 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016, held in Beppu, Japan, in October 2016. The 25 full papers presented were carefully reviewed and selected from 46 submissions. The focus of the papers is on fundamental studies of string processes and information retrieval and its applications for example to areas such as bioinformatics, Web mining and others.
Author : Miklos Bona
Publisher : CRC Press
Page : 528 pages
File Size : 45,9 MB
Release : 2022-05-09
Category : Computers
ISBN : 1000563804
A CHOICE "Outstanding Academic Title," the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers. The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic. Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications. Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. •A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4. •The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5. •New results in stack sorting are added to Chapter 8. •Chapter 9 applications to biology has been revised. The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.
Author : Miklos Bona
Publisher : CRC Press
Page : 478 pages
File Size : 33,25 MB
Release : 2012-06-11
Category : Computers
ISBN : 1439850518
A Unified Account of Permutations in Modern Combinatorics A 2006 CHOICE Outstanding Academic Title, the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, Second Edition continues to clearly show the usefulness of this subject for both students and researchers and is recommended for undergraduate libraries by the MAA. Expanded Chapters Much of the book has been significantly revised and extended. This edition includes a new section on alternating permutations and new material on multivariate applications of the exponential formula. It also discusses several important results in pattern avoidance as well as the concept of asymptotically normal distributions. New Chapter An entirely new chapter focuses on three sorting algorithms from molecular biology. This emerging area of combinatorics is known for its easily stated and extremely difficult problems, which sometimes can be solved using deep techniques from seemingly remote branches of mathematics. Additional Exercises and Problems All chapters in the second edition have more exercises and problems. Exercises are marked according to level of difficulty and many of the problems encompass results from the last eight years.
Author : Bruce M. Landman
Publisher : Walter de Gruyter GmbH & Co KG
Page : 364 pages
File Size : 49,53 MB
Release : 2024-11-04
Category : Mathematics
ISBN : 3111395626
This volume consists of twenty articles stemming from presentations given at the 2023 Integers Conference. They represent a variety of active areas of research in combinatorial number theory, including additive number theory, multiplicative number theory, elementary number theory, the theory of partitions, Ramsey theory, sequences, algebraic combinatorics, enumerative combinatorics, and Diophantine equations.
Author : Andrew Beveridge
Publisher : Springer
Page : 775 pages
File Size : 14,88 MB
Release : 2016-04-12
Category : Mathematics
ISBN : 3319242989
This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The three-part structure of the volume reflects the three workshops held during Fall 2014. In the first part, topics on extremal and probabilistic combinatorics are presented; part two focuses on additive and analytic combinatorics; and part three presents topics in geometric and enumerative combinatorics. This book will be of use to those who research combinatorics directly or apply combinatorial methods to other fields.
