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.

A string library

libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.

This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton University algorithms Part I & II course at COURSERA

Accurate, resource-frugal and deterministic DNA sequence classifier.

Zip-Ada: a standalone, portable pure Ada library for .zip archives. Includes LZMA and BZip2 byte stream encoder & decoder pairs.

msufsort parallel suffix array construction algorithm

Burrows-Wheeler Transform and FM-index in golang

Fast and Strong Burrows Wheeler Model

Extreme inline text compression for HTML / JS. A custom pipeline that generates stand-alone HTML or JS files which embed competitively compressed self-extracting text, with file sizes of 25% - 40% the original.

Dynatrace FM-Index library

novel high throughput entropy encoder for BWT data

A parallel implementation of the bzip2 data compressor in python, this data compression pipeline is using algorithms like Burrows–Wheeler transform (BWT) and Move to front (MTF) to improve the Huffman compression. For now, this tool only will be focused on compressing .csv files, and other files on tabular format.

Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,

This repository contains all the solutions of assignments, starter files and other materials related to this specialization.

FM-index using slice view of blob

Computing the Lyndon Array in linear time [JDA 2018, SPIRE'19]

Hamming, Huffman and etc algorithms

Algorithm design course in my forth semester of university

Afternotes from the courses of the master degree course of Computer Science and Information Technology, from the Ca' Foscari University of Venice.

External memory BWT and LCP computation for sequence collections with applications [WABI'18, AMB 2019]

ProPhex – an exact k-mer index using Burrows-Wheeler Transform

A New Approach for Efficient Sequential Decoding of Static Huffman Codes

Fast, GPU-based decompressor for bzip2 streams.

Implementation of Compression and Learning Algorithms

Algorithms to compute the Burrows-Wheeler Similarity Distributions [SPIRE'18, TCS 2019]

Rust bindings to libsais

Burrows-Wheeler transform and LCP array construction in constant space [IWOCA'15, JDA 2017]

A Python implementation of The Burrows-Wheeler Transform alongside Huffman coding on DNA sequences.

Parallel external memory construction of BWT from SA