Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Flexible Pattern Matching in Strings

    Flexible Pattern Matching in Strings

    Gonzalo Navarro, Mathieu Raffinot · 2002

    Computer ScienceProgrammingSystems & OS
    Open LibraryAmazon
    Stats for nerds
    4recommend
    5mentions
    5people
    2011–2022years
    80% recommend20% neutral

    Mentions per year

    2011201320152017201920212022

    What Hacker News says

    1. MattPalmer1086Sep 2022
      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...

      thread
    2. ufoApr 2021
      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 fares better. It also favors algorithms that are simple to implement (such as Horspool instead of Boyer-Moore), because those also tend to be the fastest.

      thread
    3. burntsushiApr 2020
      > the books on text algorithms.

      And also "Flexible Pattern Matching in Strings" by Navarro and Raffinot.

      thread
    4. matt4711Feb 2011
      Pattern matching performance also depends on the alphabet size of the text. In his experiment he doesn't report the 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 of Arizona, 1994.

      [2] http://www.amazon.com/Flexible-Pattern-Matching-Strings-Line...

      thread
    5. mtdewcmuNov 2013
      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 2002.

      [1] http://www.dcc.uchile.cl/~gnavarro/FPMbook/

      thread

    Related

    Cover of A pattern language
    2007–2026

    A pattern language

    Christopher Alexander
    110 recommend · 368
    Cover of Introduction to information retrieval
    2009–2024

    Introduction to information retrieval

    Christopher D. Manning
    41 recommend · 45
    Cover of Algorithms on Strings
    2012–2025

    Algorithms on Strings

    Maxime Crochemore
    2 recommend · 2
    Cover of Algorithms on strings, trees, and sequences
    2012–2025

    Algorithms on strings, trees, and sequences

    Dan Gusfield
    3 recommend · 7
    Cover of Mastering Regular Expressions
    2008–2025

    Mastering Regular Expressions

    Jeffrey E. F. Friedl
    58 recommend · 115
    Cover of Compact Data Structures
    2017–2025

    Compact Data Structures

    Gonzalo Navarro
    3 recommend · 7
    Cover of Introduction to Algorithms
    2007–2026

    Introduction to Algorithms

    Thomas H. Cormen
    274 recommend · 880
    Cover of Crafting Interpreters
    2017–2026

    Crafting Interpreters

    Robert Nystrom
    295 recommend · 521