25 Books to Read Before You Die
 
 

Recently Viewed clear list


The Powell's Playlist | August 8, 2014

Peter Mendelsund: IMG The Powell's Playlist: Water Music by Peter Mendelsund



We "see" when we read, and we "see" when we listen. There are many ways in which music can create the cross-sensory experience of this seeing...... Continue »
  1. $11.87 Sale Trade Paper add to wish list

spacer

On Order

$127.25
New Hardcover
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Mathematics- Combinatorics

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)

by

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications) Cover

 

Synopses & Reviews

Publisher Comments:

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.

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.

Product Details

ISBN:
9781420060928
Author:
Blanchet-sadri, Francine
Publisher:
Chapman & Hall/CRC
Author:
Blanchet-Sadri, Francine
Subject:
Mathematics
Subject:
Computer Science
Subject:
Combinatorics
Subject:
Programming - General
Subject:
Discrete Mathematics
Subject:
Computer science -- Mathematics.
Subject:
Combinatorial analysis
Subject:
Mathematics-Combinatorics
Series:
Discrete Mathematics and Its Applications
Publication Date:
20071131
Binding:
Hardcover
Language:
English
Illustrations:
Y
Pages:
385
Dimensions:
9.14x6.55x1.02 in. 1.49 lbs.

Related Subjects

Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Algebra » General
Science and Mathematics » Mathematics » Combinatorics
Science and Mathematics » Mathematics » Computer

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications) New Hardcover
0 stars - 0 reviews
$127.25 Backorder
Product details 385 pages Chapman & Hall/CRC - English 9781420060928 Reviews:
"Synopsis" by , 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.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.