String metrics library written in Go.
-
Updated
May 21, 2024 - Go
#
ukkonen
Here are 12 public repositories matching this topic...
A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
-
Updated
Nov 2, 2020 - Java
A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
-
Updated
Nov 5, 2023 - Python
A Go implementation of a Generalized Suffix Tree using Ukkonen's algorithm
-
Updated
Jan 26, 2021 - Go
C++ implementation of Suffix Tree (Ukkonens)
-
Updated
Oct 15, 2017 - C++
C++ implementation of suffix trees, using Ukkonen's algorithm.
-
Updated
Sep 5, 2023 - C++
An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.
-
Updated
Oct 24, 2021 - Java
Практическое задание для отбора на кафедру КИС
-
Updated
Mar 31, 2022 - C++
Suffix tree construction: Naive Algorithm and (currently working on) Ukkonen's.
-
Updated
Feb 1, 2019 - C
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
-
Updated
Dec 10, 2017 - C++
Improve this page
Add a description, image, and links to the ukkonen topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the ukkonen topic, visit your repo's landing page and select "manage topics."