Hamming, Huffman and etc algorithms
-
Updated
Sep 2, 2020 - Jupyter Notebook
Hamming, Huffman and etc algorithms
Fast, GPU-based decompressor for bzip2 streams.
A (rookie makeshift improvised amateur suboptimal crude non-production-ready) bzip2 compression algorithm implementation from scratch.
This tool aligns reads back to a reference genome. It is also my final project for CSE 185 Advanced Bioinformatics Lab. Won Best Presentation Award among 60+ student projects.
Python implementation of the Burrow Wheeler Algorithm with a GUI
Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.
Practices of Algorithm for hard problems
rust implementation of Burrows-Wheeler transform
MA3288 Advanced Undergraduate Research Opportunites (UROPS) in Mathematics I
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), Suffix Array (SA), and auxiliary arrays (C, Occ) to enable efficient and accurate substring matching. It focuses on an unoptimized, recursive depth-first
Implement a server (along with a corresponding client), that accepts a DNA sequence and returns its Burrows Wheeler Transform (BWT). It should also accept a BWT and return the corresponding original DNA sequence.
Several computational genomics projects
A repository containing all the file projects that I have for the Bioinformatics 6 (COMP 4312e) course.
Add a description, image, and links to the burrows-wheeler-transformation topic page so that developers can more easily learn about it.
To associate your repository with the burrows-wheeler-transformation topic, visit your repo's landing page and select "manage topics."