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 ...

Abstract: We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm.The SA-IS algorithm is novel because of the LMS-substrings used for the problem ...

A lover of RPGs, Board Games, and Storytelling Joshua is a gamer to the core. He loves story-driven narratives but also spends ample time in the battlefields of varying Call of Duty titles. Despite ...

A Python-based implementation of the Burrows-Wheeler Alignment (BWA) algorithm for DNA sequence matching. This project leverages core data structures including the Burrows-Wheeler Transform (BWT), ...

Abstract: The suffix array is an indexing data structure used in a wide range of applications in Bioinformatics. Biological DNA sequences are available to download from public servers in the form of ...

Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the kbest matches for a substring, s, in a dictinoary, dict. That is, grep s dict ...