ptrus/suffix-trees

Check for multiple patterns in a single string at the same time: a fast Aho-Corasick algorithm for Python

Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.

Comparing performance-oriented string-processing libraries for substring search, multi-pattern matching, hashing, edit-distances, sketching, and sorting across CPUs and GPUs in Rust 🦀 and Python 🐍

Fast Aho-Corasick string searching

Hardware accelerated routines for single substring search.

Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖

The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (LCP) array, permuted LCP (PLCP) array, Burrows-Wheeler transform (BWT) and inverse BWT based on the induced sorting algorithm with optional OpenMP support for multi-core parallel construction.

Efficient string matching with regular expressions

Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing