The Assesment of the Expected Genome Assembly Completness from Available Reads

Zadatak završnog rada alat je za provjeru mogućnosti sastavljanja genoma za dani skup očitavanja. Alat se radi u svrhu validacije skupa očitanja prilikom sastavljanja genoma te izačuna omjera duljina novo sastavljenog slijeda i početne reference. Problem je riješen korištenjem programskog jezika C++ te alata Minimap i Gepard. U samom programu korišteni su algoritmi Sweep line i BFS za filtraciju podataka, odnosno za obilazak grafa. Implementirano je rješenje zadovoljavajuće riješilo zadani problem, a njegova poboljšanja mogla bi se napraviti drugačijim parametrima pri ocjenjivanju kvalitete mapiranja ili korištenjem drugih alata.The task of this assignment was implementation of a tool capable of testing the capability of assembling genomes from available reads. The tool was made for the purpose of validating sets of reads while assembling genomes and calculating ratios of lengths between original reference and newly made genome. The problem has been solved using programming language C++ and tools like Minimap and Gepard. In the solution we use Sweep line algorithm for data filtration and BFS algorithm for making a path on the graph. The implementation solved our problem to high degree, and eventual upgrades could be made by changing filtering methods or changing the tools that were used