Skip to content

Textual algorithm implementations and time comparisons, AGH 2021

Notifications You must be signed in to change notification settings

mhawryluk/text-algorithms

Repository files navigation

Textual algorithms lab

  1. String matching - naive, finite automaton and KMP algorithms
  2. Suffix trees - Trie and Suffix Tree structure constructing
  3. Text compression - static and dynamic Huffman compression
  4. Edit distance - Levensheit, LCS, diff implementation
  5. Clustering - metrics: LCS, Sorensen-Dice, Euclidean, cosine; indices: Davies-Bouldin, Dunn; DBSCAN clustering
  6. 2D matching - Aho-Corasick algorithm

About

Textual algorithm implementations and time comparisons, AGH 2021

Topics

Resources

Stars

Watchers

Forks