Jewels of Stringology 1st Edition by Maxime Crochemore (PDF)

Description

The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. 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 book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. 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. One can partition the algorithmic problems discussed into practical and theoretical problems. 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. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

User’s Reviews

Editorial Reviews: Review .,.” nicely covers material from the famous KMP and BM algorithms to suffix trees …”

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐The algorithms in this book seem great but the explanations and the cryptic notation really ruin it. This feels like a book that somebody wrote to try to show off they are smart, not to try to explain beautiful algorithms in an elegant way.Half of the proofs are omitted because they are “obviously true”. If something is obviously true, why isn’t the author able to summarize the argument in one elegant sentence that everyone gets immediately?The notation and terminology are also extremely obscure and unusual. This is a book an arrogant professor wrote to try to impress his colleagues, not to actually explain how things work.Stick to Gusfield’s book. It is much clearer and way more elegant!

⭐String processing is bread and butter of good part of computer science, but somehow it has been always shunned in the classic texts. It has been wonderful to find a book dedicated solely to to the strings.Much of the practical and theoretical issues of string handling are well covered, e.g. suffix trees, subword graphs, constant space search. Remarkable section on two-dimensional string handling; good summary of edit distance calculation and search with mistakes (optimum algorithms are listed for both).The book is peppered with theorems, but their proofs are a bit *too* informal, to the point I found some of them useless. They should be either rewritten in formal fashion, or the proofs should be omitted altogether. Same goes for the pseudocode: often you can’t really make a program out of them without reading the chapter thoroughly. I guess it’s a sound approach for its textbook function, but makes it a bit less useful as algorithm cookbook or reference.

⭐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

⭐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 algorithm works. Many inherently complexand famous algorithms are presented in a simplified way.The book can be used as a companion book in courses on algorithmsand data structures at any level. The required theoretical backgroundis reduced to minimum. The area is underrepresented in most generaltextbooks on algorithms and data structures, and the book fillsthe gap nicely.The title is well chosen, the presented algorithms are real “jewels”and the word “stringology” is a good nickname for the area, it hasbeen invented before by other people and is generally accepted in thecommunity of people doing text algorithmics.The book is a simplified and modernized version of “Text algorithms” bythe same authors. The difficult algorithms are omitted or rewritten.The main audience targeted by the book are the undergraduate andgraduate students. Most classical algorithms are easily understandable,since they use only the very simple data structure: 1-dimenesional array.It gives a source of algorithmically valuable algorithms (in sense of teachingalgorithm courses) with a very simple implementation, the knowledge ofany programming language at a very beginning level is just enough. Basicstring algorithms can be swallowed by an undergraduate student much easierthan for example graph algorithms.Altogether the book is an excellent text on algorithms.

⭐

Keywords

Free Download Jewels of Stringology 1st Edition in PDF format
Jewels of Stringology 1st Edition PDF Free Download
Download Jewels of Stringology 1st Edition 2002 PDF Free
Jewels of Stringology 1st Edition 2002 PDF Free Download
Download Jewels of Stringology 1st Edition PDF
Free Download Ebook Jewels of Stringology 1st Edition