This book is much needed in the design of algorithms and data structures for processing text emphasizes both the theoretical foundations and practical applications. This book is the first text that contains a collection of various algorithms text, many of them are new and appear here for the first time. The core of this book is an ingredient in the tree suffix and subword graphs, applications of data structures, new approaches to time-space optimal string-matching and text compression. The application of these algorithms is given to issues involving data collection systems, natural language processing, investigation genome, data compression software, and text processing tools. This book is a gold mine of paradigm for the development of efficient algorithms, provide the foundation needed to create practical software deals with the order. It is very important because the algorithm described here will find application in "Big Science" areas such as molecular sequence analysis where explosive data growth has caused problems for the current generation of software. Finally, with its development background theory, this book can be regarded as a mathematical basis for analysis and production of text processing algorithms.