Found 7 packages
DeltaQ implementation of the suffix array induced sort (SAIS) algorithm
An F# Wrapper around the LibDivSufSort suffix array library. After installation you'll need to make sure your project is set to 64-bit, and you'll need to make divsufsort64.dll copy on build.
MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above. Data structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries. Algorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. Graphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. Suffix Trees and Tries construction and matching.
Handle the conversion between arrays and bytes, compress bytes to reduce volume, save to local, with extremely fast reading and saving speed. Currently supports arrays of types int, short, float, long, uint, ushort, ulong, double, and decimal. Accurately determine the file type, not simply by the suffix. Supported types: zip, gz, tgz, rar, pdf, wav, avi, mpeg, cad, bmp, jpg, png, gif, tiff.
.NET cross-platform bindings for libsais - a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.
.NET cross-platform bindings for libsais - a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.
A .NET library providing a high-performance Wavelet Matrix, Suffix Array, FM-Index, LCP Index and Burrows Wheeler Transform. Core Data Structures: - Wavelet Matrix: Generic implementation supporting various data types with efficient Rank, Select, Quant - Sparse Table: For fast Range Minimum Queries (RMQ) on static arrays. Text Analysis Components: - Suffix Array: The foundational class for most text analysis. It builds a Suffix Array and LCP Array from a given text, enabling fast substring searches. - LCP Index: Provides O(1) LCP queries between any two suffixes using a Sparse Table. - FM-Index: A full-text index based on the Burrows-Wheeler Transform, allowing efficient substring search operations (Count/Locate). Ideal for applications in bioinformatics, text processing, and data compression. For more details, please visit the project repository on GitHub.