Jewels of Stringology
| Author | : | |
| Rating | : | 4.81 (580 Votes) |
| Asin | : | 9810248970 |
| Format Type | : | paperback |
| Number of Pages | : | 320 Pages |
| Publish Date | : | 2015-04-15 |
| Language | : | English |
DESCRIPTION:
.,." nicely covers material from the famous KMP and BM algorithms to suffix trees "
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 algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. 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. One can partition the algorithmic problems discussed into practical and theoretical problems. 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 backg
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.Bo. A Customer said Theoretical rather than practical. 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. . nice book 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