Pattern Matching Pointers (maintained by Stefano Lonardi)

Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve improved performance for the corresponding computational problem. A steady flow of h

[hitsujibane]

文字列探索アルゴリズムのリンク集

[zeppeki]

パタンマッチに関する国際会議や教科書をまとめたページ．重要．

[sleepy_yoshi]

文字列探索ポータル・・・これはすごい