msufsort parallel suffix array construction algorithm
-
Updated
Nov 16, 2020 - C++
msufsort parallel suffix array construction algorithm
Fast and Strong Burrows Wheeler Model
novel high throughput entropy encoder for BWT data
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
Algorithms to compute the Burrows-Wheeler Similarity Distributions [SPIRE'18, TCS 2019]
Parallel external memory construction of BWT from SA
Bilkent University CS 481 Bioinformatics Algorithms assignments
A Fast C++ Lossless Compress/Decompress CLI Program with High Compression Ratio
What I learned from Data Structures and Algorithms Specialization on Coursera.
Micro genome assembler. Uses BWT for seeding/pattern matching and a greedy score based aligner.
Basic seed-and-extend DNA sequence read aligner
Hybrid text compression pipeline using Burrows Wheelers Transform, Huffman encoding, Run-length encoding, Lempel-Ziv-Welch compression and Delta encoding
Bioinformatics course project: Computing the LCP array based on BWT
Bioinformatics Data Structures & Algorithms [such as the Q-Gram Index, scoring alignments , rna-structure prediction, generating the BLAST-Ńeighborhood and more.]
DNA Sequencing 1 Top Coder Data Science Marathon Match
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."