Matching Patterns in Strings Subject to Multi-Linear Transformations (Classic Reprint) - Hardcover

T. Tzoreff-Eliam

 
9780267854707: Matching Patterns in Strings Subject to Multi-Linear Transformations (Classic Reprint)

This specific ISBN edition is currently not available.

Synopsis

Extends string matching beyond exact text to powerful transformations, helping you see patterns from a new angle.

This book introduces a family of problems where a basic string can appear in a larger text only after applying one of several transformations. Real numbers replace letters, and each occurrence may use a different transformation. The discussion connects classical search methods with modern needs in fields like speech recognition and image processing, offering a practical look at how theory translates to algorithms.

  • Learn the five transformation frameworks: adding, multiplying, linear, and k-degree polynomial, plus k-linear transformations, and how they relate to each other.
  • See how exact matching becomes a broader task and how minimum-distance versions of these problems are defined and solved.
  • Discover algorithmic strategies that reduce pattern analysis and text analysis to linear-time or near-linear-time steps.
  • Understand how these ideas apply to real-valued data and practical applications in recognizing patterns in complex signals.
Ideal for readers of advanced algorithms, pattern matching, and computational theory who want to explore how transformations change the way we search strings.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title