Long Reads Mapping

Mapiranje dugačkih očitanja jest problem pronalaska dijela reference na koje bi se konkretno očitanje moglo najbolje poravnati. U ovom radu opisana je implementacija programa koji mapira dugačka očitanja. Program je napisan u programskom jeziku C++. Koristi se pristup u kojem se ne gleda cijelo očitanje, već samo krajevi duljine K. Referenca se podijeli na regije duljine 2K s preklapanjem od K te se indeksira. Indeksiranjem krajeva očitanja te usporedbom s indeksima na referenci mogu se brzo filtrirati kandidatne pozicije. Rezultati su uspoređeni s Minimap2 metodom. Izvorni kôd dostupan je na https://github.com/lbcb-edu/BSc-thesis-18-19/tree/kpongracic.Long reads mapping is problem of finding a part of a reference on which a particular read could be best aligned. This paper describes the method for long reads mapping. It was written in C++ programming language. In our approach instead of whole read we use only read ends of length K for finding candidate positions on the reference genome. The reference is divided into regions of length 2K with overlapping of K and is beeing indexed. By indexing the reads ends and by comparing the indexes with references, the candidate positions can be filltered quickly. The results are compared with the Minimap2 tool. Source code is available at https://github.com/lbcb-edu/BSc-thesis-18-19/tree/kpongracic