Combinatorics is one of the fastest growing fields of mathematics. In large
measure this is because many practical problems can be modeled and then
efficiently solved using combinatorial theory. This real world motivation for
studying algorithmic combinatorics has led not only to the development of
many software packages but also to some beautiful mathematics which has
no direct application to applied problems. In this volume we highlight some
exciting recent developments in algorithmic combinatorics.
Most practical applications of algorithmic combinatorics would be impossible
without the use of the computer. As computers become ever more
powerful, more and more applications become possible. Computational
biology is one example of a relatively new field in which algorithmic combinatorics
plays a key role. The chapter by Sagot and Wakabayashi in this
volume discusses how combinatorial tools can be used to search for patterns
in DNA and protein sequences.