libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.
-
Updated
Nov 19, 2024 - C
libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.
A string library
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.
libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
msufsort parallel suffix array construction algorithm
Zip-Ada: a standalone, portable pure Ada library for .zip archives. Includes LZMA and BZip2 byte stream encoder & decoder pairs.
Burrows-Wheeler Transform and FM-index in golang
Fast and Strong Burrows Wheeler Model
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,
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.
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
Computing the Lyndon Array in linear time [JDA 2018, SPIRE'19]
Hamming, Huffman and etc algorithms
External memory BWT and LCP computation for sequence collections with applications [WABI'18, AMB 2019]
Algorithm design course in my forth semester of university
ProPhex – an exact k-mer index using Burrows-Wheeler Transform
A New Approach for Efficient Sequential Decoding of Static Huffman Codes
Add a description, image, and links to the burrows-wheeler-transform topic page so that developers can more easily learn about it.
To associate your repository with the burrows-wheeler-transform topic, visit your repo's landing page and select "manage topics."