Jewels of Stringology
| Author | : | |
| Rating | : | 4.86 (717 Votes) |
| Asin | : | 9810248970 |
| Format Type | : | paperback |
| Number of Pages | : | 320 Pages |
| Publish Date | : | 2013-11-18 |
| Language | : | English |
DESCRIPTION:
The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book deals with the most basic algorithms in the area. One can partition the algorithmic problems discussed into practical and theoretical problems. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text
.,." nicely covers material from the famous KMP and BM algorithms to suffix trees "
This book is a jewel Amazon Customer Absolutely fantastic book! Short, but deep. Presents algorithms that are very hard to find elsewhere.Warning: this is not to "copy and paste" book. If you expect that there will be ready to use code, look for O'Reilly catalog. To use algorithms presented in the book, you have to actually think before you start coding.Book is hard to get: I waited few month until Amazon provided a copy. But it was worth waithing. "Theoretical rather than practical" according to A Customer. The book loses one star because it's primarily a presentation of algorithms that are theoretically interesting, rather than algorithms that are good to use. I doubt very much that the authors have any real software engineering experience.It loses another star because the writing style is so awkward and painful to read. The authors don't appear to be native speakers of English, and it shows. The text really needs to be cleaned up by an editor familar with idiomatic English.Bottom line: If you actually need to implement a string search, look elsewhere for guidance. "nice book" according to Thierry Lecroq. The book is an excellent presentation of algorithms on the conceptual level andavoids implementation details. This does not mean that ithas no practical value. The understanding and simplification of an algorithmis the first main step towards its practicality. The issues of implementationdetails would double the size of the book and obscure the main ideas.The great advantage of the currenct version are conciseness and simplicity.Despite that it is a "parade" of a huge number of classical important algorithms.The style is reader-friendly and very algorithmic. The main issue is theunderstanding how an algori