Enter your mobile number below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Jewels of Stringology 1st Edition

4.5 out of 5 stars 4 customer reviews
ISBN-13: 978-9810247829
ISBN-10: 9810247826
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used On clicking this link, a new layer will be open
$89.59 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$103.51 On clicking this link, a new layer will be open
More Buying Choices
15 New from $86.86 12 Used from $89.59
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Windows10ForDummiesVideo
Windows 10 For Dummies Video Training
Get up to speed with Windows 10 with this video training course from For Dummies. Learn more.
$103.51 FREE Shipping. Only 1 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Frequently Bought Together

  • Jewels of Stringology
  • +
  • Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences
Total price: $154.87
Buy the selected items together

Editorial Reviews

Review

.,." nicely covers material from the famous KMP and BM algorithms to suffix trees ..."

About the Author

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.

Rytter, Institute of Informatics, Warsaw University.
NO_CONTENT_IN_FEATURE

New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See more

Product Details

  • Hardcover: 320 pages
  • Publisher: World Scientific Publishing Company; 1st edition (September 17, 2002)
  • Language: English
  • ISBN-10: 9810247826
  • ISBN-13: 978-9810247829
  • Product Dimensions: 6.1 x 0.9 x 9 inches
  • Shipping Weight: 1.2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #3,473,998 in Books (See Top 100 in Books)

Customer Reviews

5 star
75%
4 star
0%
3 star
25%
2 star
0%
1 star
0%
See all 4 customer reviews
Share your thoughts with other customers

Top Customer Reviews

Format: Hardcover
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.
Read more ›
Comment 5 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
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
Comment 4 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
By A Customer on February 27, 2004
Format: Paperback Verified Purchase
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...
3 Comments 8 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Jewels of Stringology
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Jewels of Stringology

Pages with Related Products. See and discover other items: discrete mathematics