The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnolo
Algorithmic Combinatorics on Partial Words
โ Scribed by Francine Blanchet-Sadri
- Book ID
- 127447353
- Publisher
- Chapman and Hall/CRC
- Year
- 2007
- Tongue
- English
- Weight
- 5 MB
- Series
- Discrete Mathematics and Its Applications
- Category
- Library
- ISBN
- 1420060929
No coin nor oath required. For personal study only.
โฆ Synopsis
The study of combinatorics on words is a relatively new research area in the fields of discrete and algorithmic mathematics. Featuring a simple, accessible style, Algorithmic Combinatorics on Partial Words presents combinatorial and algorithmic concepts in the emerging field of words and partial words. This book contains a wealth of exercises and problems that assists with a variety of algorithm tracing, algorithm design, mathematical proofs, and program implementation. It also includes numerous worked example and diagrams, making this a valuable text for students, researchers, and practitioners seeking to understand this complex subject where many problems remain unexplored.
๐ SIMILAR VOLUMES
Combinatorics on words, or finite sequences, is a field that grew from the disparate mathematics branches of group theory and probability. In recent times, it has gained recognition as an independent theory and has found substantial applications in computer science automata theory and linguistics. T
Combinatorics on words has arisen independently within several branches of mathematics, for instance, number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's Combinatorics
A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the
ects of Combinatorics ects of Combinatorics wi!J be bia, Canada, ay 1'7-21, 'hW6. y the Simon Fraser ersity of Victoria and the University of stish Columbia. speakers are tentatively schedul ster sessions will be arrar-bed.