libdivsufsort
2.0.2.1.20151027Lightweight suffix-sorting library
libdivsufsort is a software library that implements a lightweight suffix array construction algorithm. This library provides a simple and an efficient C API to construct a suffix array and a Burrows-Wheeler transformed string from a given string over a constant-size alphabet. The algorithm runs in O(n log n) worst-case time using only 5n+O(1) bytes of memory space, where n is the length of the string.
Origin: math/libdivsufsort
Category: math
Size: 44.1KiB
License: MIT
Maintainer: yuri@FreeBSD.org
Dependencies: 0 packages
Required by: 1 packages
Website: github.com/y-256/libdivsufsort
$
pkg install libdivsufsortRequired By (1 packages)
More in math
py311-numpy1.26.4_11,1
The New Numeric Extension to PythonR4.5.2
Language for statistical computing and graphicsgmp6.3.0
Free library for arbitrary precision arithmeticopenblas0.3.30,2
Optimized BLAS library based on GotoBLAS2fftw33.3.10_5
Fast C routines to compute the Discrete Fourier Transformpy311-matplotlib3.8.0_2
Plotting library uses a syntax familiar to MATLAB userspy311-pandas2.3.3,1
Flexible, high-performance data analysis in Pythonmpfr4.2.2,1
Library for multiple-precision floating-point computationsoctave10.3.0_2
High-level interactive language for numerical computationsoctave-forge-base1.9_1
Octave-forge baseport for all packages