Item description for Jewels of Stringology by Maxime Crochemore & Wojciech Rytter...
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 algorithmic problems the 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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Studio: World Scientific Publishing Company
Est. Packaging Dimensions: Length: 9" Width: 5.7" Height: 0.9" Weight: 1.2 lbs.
Publisher World Scientific Publishing Company
ISBN 9810247826 ISBN13 9789810247829
Availability 1 units. Availability accurate as of Jan 20, 2017 07:55.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Maxime Crochemore & Wojciech Rytter
Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'etat in 1983 at the University of Rouen. He got his first professorship position at the University of Paris-Nord in 1975 where he acted as President of the Department of Mathematics and Computer Science for two years. He became professor at the University Paris 7 in 1989 and was involved in the creation of the University of Marne-la-Vallee where he is presently Professor. He also created the Computer Science research laboratory of this university in 1991, which has now more than fifty permanent researchers. He was the director of the laboratory until 2005. Professor Crochemore is Senior Research Fellow at King's College London since 2002.
Maxime Crochemore was born in 1947 and has an academic affiliation as follows - Universite of Marne-la-Vallee.
Reviews - What do customers think about Jewels of Stringology?
nice book Mar 16, 2004
The book is an excellent presentation of algorithms on the conceptual level and avoids implementation details. This does not mean that it has no practical value. The understanding and simplification of an algorithm is the first main step towards its practicality. The issues of implementation details 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 the understanding how an algorithm works. Many inherently complex and famous algorithms are presented in a simplified way. The book can be used as a companion book in courses on algorithms and data structures at any level. The required theoretical background is reduced to minimum. The area is underrepresented in most general textbooks on algorithms and data structures, and the book fills
the 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 has been invented before by other people and is generally accepted in the community of people doing text algorithmics.
The book is a simplified and modernized version of "Text algorithms" by the same authors. The difficult algorithms are omitted or rewritten. The main audience targeted by the book are the undergraduate and
graduate 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 teaching algorithm courses) with a very simple implementation, the knowledge of any programming language at a very beginning level is just enough. Basic string algorithms can be swallowed by an undergraduate student much easier than for example graph algorithms.
Altogether the book is an excellent text on algorithms.
Theoretical rather than practical Feb 27, 2004
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...