Analytic Pattern Matching - From DNA to Twitter (Hardcover, New title)

,
How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate students demonstrates the probabilistic approach to pattern matching, which predicts the performance of pattern matching algorithms with very high precision using analytic combinatorics and analytic information theory. Part I compiles known results of pattern matching problems via analytic methods. Part II focuses on applications to various data structures on words, such as digital trees, suffix trees, string complexity and string-based data compression. The authors use results and techniques from Part I and also introduce new methodology such as the Mellin transform and analytic depoissonization. More than 100 end-of-chapter problems help the reader to make the link between theory and practice.

R1,930

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles19300
Mobicred@R181pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate students demonstrates the probabilistic approach to pattern matching, which predicts the performance of pattern matching algorithms with very high precision using analytic combinatorics and analytic information theory. Part I compiles known results of pattern matching problems via analytic methods. Part II focuses on applications to various data structures on words, such as digital trees, suffix trees, string complexity and string-based data compression. The authors use results and techniques from Part I and also introduce new methodology such as the Mellin transform and analytic depoissonization. More than 100 end-of-chapter problems help the reader to make the link between theory and practice.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Cambridge UniversityPress

Country of origin

United Kingdom

Release date

June 2015

Availability

Expected to ship within 12 - 17 working days

Authors

,

Dimensions

253 x 181 x 26mm (L x W x T)

Format

Hardcover

Pages

385

Edition

New title

ISBN-13

978-0-521-87608-7

Barcode

9780521876087

Categories

LSN

0-521-87608-7



Trending On Loot