Naslov
Tool for aligning long DNA reads

Autori
Pavetić, Filip

Vrsta, podvrsta i kategorija rada
Ocjenski radovi, diplomski rad, preddiplomski

Fakultet
Fakultet elektrotehnike i računarstva

Mjesto
Zagreb

Datum
27.09

Godina
2013

Stranica
37

Mentor
Šikić, Mile

Ključne riječi
DNA alignment; bioinformatics; algorithms; hash; LISA; longest increas- ing subsequence; maximum increasing interval coverage

Sažetak
DNA is a structure which encodes all of the living world. Better understanding of it’s particular section could lead to detection and curing of many diseases. DNA sequencing machines are getting better every day and producing big amounts of ever longer reads. Locating these reads inside a reference genome is a fundemental open problem in bioinformatics. This Thesis presents two algorithms for finding candidate positions for placing the reads on the reference genome. Both algorithms are inspired by an efficient algorithm for finding longest increasing subsequence of sequence of numbers. Detailed analysis and comparison with state-of-the-art tools is given.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo

POVEZANOST RADA