✦ LIBER ✦

Algorithmic combinatorics on partial words

✍ Scribed by Francine Blanchet-Sadri

Book ID: 127453886
Publisher: Chapman & Hall/CRC
Year: 2008
Tongue: English
Weight: 2 MB
Series: Discrete mathematics and its applications
Edition: 1
Category: Library
City: Boca Raton, FL
ISBN: 1420060937

No coin nor oath required. For personal study only.

✦ Synopsis

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, nanotechnology, data communication, and DNA computing. Delving into this emerging research area, **Algorithmic Combinatorics on Partial Words presents a mathematical treatment of combinatorics on partial words designed around algorithms and explores up-and-coming techniques for solving partial word problems as well as the future direction of research.

This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words.

Setting the tone for future research in this field, this book lucidly develops the central ideas and results of combinatorics on partial words.**

📜 SIMILAR VOLUMES

Algorithmic Combinatorics on Partial Wor

Algorithmic Combinatorics on Partial Words

✍ Francine Blanchet-Sadri 📂 Library 📅 2007 🏛 Chapman and Hall/CRC 🌐 English ⚖ 5 MB

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 wor

Combinatorics on words

✍ M. Lothaire 📂 Library 📅 1997 🏛 Cambridge University Press 🌐 English ⚖ 2 MB

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

Algebraic Combinatorics on Words

✍ J.-P. Allouche 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 182 KB

Algebraic combinatorics on words

✍ M. Lothaire 📂 Library 📅 2002 🏛 Cambridge University Press 🌐 English ⚖ 5 MB

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

Applied Combinatorics On Words

✍ M. Lothaire 📂 Library 📅 2005 🏛 Cambridge University Press 🌐 English ⚖ 5 MB

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

Conference on algorithmic aspects of com

Conference on algorithmic aspects of combinatorics

📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 80 KB

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.