Repository for the master course of Genome Informatics at the School of Electrical Engineering in Belgrade.

Implementation of the algorithm "Burrows Wheeler Transform" in python for data compression

Various algorithms and data structures on strings

What I learned from Data Structures and Algorithms Specialization on Coursera.

Project Scientific Programming Python

Implement and compare 2 pattern matching algorithms for genome mapping, one using suffix array and the other using Burrows-Wheeler Transform

Micro genome assembler. Uses BWT for seeding/pattern matching and a greedy score based aligner.

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

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

Programming assignments of BIO314 @ IISER-P

Text compression using Huffman Coding; enhanced using Burrows-Wheeler Transforms and other algorithms.

Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.

The code done for the completion of coursera course, Algorithms on Strings. --> Code completed in python only.

for my curriculum mini project

Web App: Generate suffix array, Burrows-Wheeler transform, and FM indices for input strings Translate DNA sequences into their corresponding protein sequences

Sternum is a python package to map next generation sequencing reads to a reference genome using optimized methods

msgen: R functions for interfacing with the Microsoft Genomics service on Azure.

Fabio Cunial's coding portfolio

My CS Bachelor Thesis (Summer 2022)

Bioinformatics course project: Computing the LCP array based on BWT