Reviews for Text Algorithms

The average rating for Text Algorithms based on 2 reviews is 4.5 stars.

Review # 1 was written on 2010-12-28 00:00:00 Scott Lutren Different variants of the Boyer-Moore algorithm, suffix arrays, suffix trees, and the like. It never crossed my mind before that if you do binary search in an array, and arrive at an element, there is a unique sequence of low bounds and high bounds that got you there; using this fact, it is possible to preprocess a sorted array of strings so that searching for an element in it will be asymptotically faster than simple binary search.

Review # 2 was written on 2008-11-09 00:00:00 Darren Chapman This is the new best book on string algorithms, replacing Navarro's Flexible Pattern Matching in Strings at the top. Actually, picking Navarro up, spinning him around a few times, and hurling him into a pit through which he falls for five-thousand years (and I *really* liked Navarro's book -- it totally set my efforts at the job (then Reflex Security, where I was building the Reflex Interceptor IPS) in a new direction back in 2003). One of the best computer science textbooks I've ever seen. If you do string algorithms, this ought be the first book on your shelf. ------ Amazon 2008-12-30. I bit the bullet and grabbed a new copy -- I didn't want 2008 to close without securing what promises to be a rare and exquisite treat. Maxime Crochemore (link de-Gaullized for your pleasure) is certifiably: da man, and a delighted stringalg community has been waiting for this with breath bated. (was: YAY! Crochemore published in 2006 my favorite text on combinatorial matching, Jewels of Stringology (with Wojciech Rytter). Between Crochemore, Rytter and Navarro, Old Europe and South America are pulling ahead in the combinatorial automata racket...I intend to change all that, though =) (malicious grin). Anyway, this is sure to be an epic treatment of my all-time most beloved area of algorithms, with likely applications to my day-to-day work both in the laboratory and at the office.)