find LCS (longest common substrings) by suffix automaton
-
Updated
Jul 29, 2024 - Python
find LCS (longest common substrings) by suffix automaton
Implementation of several string algorithms, tailored to a specific problem
A library for fuzzy-string-searching using suffix trees and levenschtein automatons to perform extremely fast search queries on large data sets. Serialize and deserialize functions allow suffix trees to persist (and drastically reduce preprocessing time).
文件名后缀批量更改机 File name suffix batch change script
Algorithms and Data Structures course at ITMO University
一个基于boost 在线文档所实现的一个简单的搜索引擎 。加入sam 不需要分词支持语句,不确定边界语言查询
A string matching experiment, including bf, kmp, trie and sam.
An efficient implementation of a suffix automaton for high performance string searches in large data sets
a tool that converts strings to images of suffix automaton
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
Add a description, image, and links to the suffix-automaton topic page so that developers can more easily learn about it.
To associate your repository with the suffix-automaton topic, visit your repo's landing page and select "manage topics."