Flexible Pattern Matching in Strings

Mentions per year

What Hacker News says

• matt4711 · Feb 12, 2011 · Recommends

  …alphabet size of the text nor does he provide results for different text collections. The algorithm itself looks very similar to the one used in agrep proposed by Wu and Manber [1]. I also found the book "Flexible Pattern Matching in Strings" to be a very good reference on all things related to pattern matching [2]. [1] S. Wu and U. Manber. A fast algorithm for multi-pattern searching. Report TR-94-17, Department of Computer Science, University…

  on “New string search algorithm” ↗
• ufo · Apr 23, 2021 · Recommends

  On the topic of string research, one excellent reference that someone recommended to me is the book "Flexible Pattern Matching in Strings" by Navarro and Raffinot. One of my favorite things about it is that it has a "phase change" graph at the end of each chapter, saying for each combination of alphabet size and pattern size, which algorithm…

  on “The Boyer-Moore Fast String Searching Algorithm” ↗
• burntsushi · Apr 17, 2020 · Recommends

  > the books on text algorithms. And also "Flexible Pattern Matching in Strings" by Navarro and Raffinot.

  on “Fix Boyer-Moore searcher with the Rytter correction” ↗
• MattPalmer1086 · Sep 10, 2022 · Recommends

  Since I'm into online search algorithms: "Flexible pattern matching in strings" by Gonzalo Navarro and Mathieu Raffinot. A rare book that marries the theoretical and practical. It has good worked examples. https://www.cambridge.org/core/books/flexible-pattern-matchi...

  on “Ask HN: Which books do you consider real gems in your field of work/study?” ↗
• mtdewcmu · Nov 28, 2013 · Mentions

  I have a book called Flexible Pattern Matching in Strings[1], which covers all the algorithms that might go into a modern, state-of-the-art grep, with practical advice on performance (N.B.: Boyer-Moore is no longer state-of-the-art). The publication year is…

  on “Why GNU grep is fast (2010)” ↗