matkaczmarek / string-algorithms

Collection of string algorithms

string-algorithms

Collection of algorithms for String Algorithms course (summer semester 2019/20) at Jagiellonian University, Theoretical Computer Science Department.

Algorithms

Exact string matching

1. Morris-Pratt and Knuth-Morris-Pratt algorithms
2. Boyer-Moore algorithm with many variants
3. fast-on-average algorithm
4. Constant space: two-way (Crochemore-Perrin) algorithm
5. Karp-Rabin hashing-based algorithm

String indexing

1. Suffix tree: Weiner, McCreight and Ukkonen algorithms
2. Suffix array: Karp-Miller-Rosenberg and Kärkkäinen-Sanders algorithms

Lyndon factorization

1. Maximum suffix algorithms: based on prefix-suffix array, in constant space

Approximate string matching

1. Longest common subsequence: Needleman-Wunsch and Hirschberg algorithms
2. String matching with don't care symbols: algorithm based on FFT

Testing

Run all tests:

  python3 -B -m unittest discover test -v

Run example large test:

  LARGE=1 python3 -B -m unittest test.test_exact_string_matching.TestExactStringMatching.test_random_exact_string_matching -v