The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (LCP) array, permuted LCP (PLCP) array, Burrows-Wheeler transform (BWT) and inverse BWT based on the induced sorting algorithm with optional OpenMP support for multi-core parallel construction.

The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).

A longest common prefix library implementation for Go

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings.

Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.

No description provided.

DNA palindrome may have significant role in DNA replication that are found frequently in human cancer cells. Data Structures - Suffix Array, Longest Common prefix Array.

Leetcode.com Longest Common Prefix Solution [8ms, 19MB memory usage (less than 80%) ]

Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.

Learned as a part of Algorithm Design Course

The best String Sorting Algorithms every programmer should know about.

A few programs that I've worked on

This code shows us how to find the longest common prefix of an array of multiple strings!

This library contains some of the Advanced Data Structures such as van Emde Boas trees, Suffix Trees and other structures