Skip to content
#

z-algorithm

Here are 19 public repositories matching this topic...

The Z Algorithm is a linear-time string matching algorithm used to find all the occurrences of a pattern string in a text string. It uses a preprocessing step to create a Z array, which stores the length of the longest common prefix of the text and a suffix starting from a specific position.

  • Updated Feb 13, 2023
  • Kotlin

Advanced string algorithms in Python: BWT approximate matching, Ukkonen suffix trees, Z-based matching, Rabin-Karp & Miller-Rabin. | Python 高级字符串算法:BWT 近似匹配、Ukkonen 后缀树、Z 算法、Rabin-Karp 与 Miller-Rabin。

  • Updated Sep 15, 2026
  • Python

Add this topic to your repo

To associate your repository with the z-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more