Tool for aligning long DNA reads (CROSBI ID 385061)
Ocjenski rad | sveučilišni preddiplomski završni rad
Podaci o odgovornosti
Pavetić, Filip
Šikić, Mile
engleski
Tool for aligning long DNA reads
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.
DNA alignment; bioinformatics; algorithms; hash; LISA; longest increas- ing subsequence; maximum increasing interval coverage
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
37
27.09.2013.
obranjeno
Podaci o ustanovi koja je dodijelila akademski stupanj
Fakultet elektrotehnike i računarstva
Zagreb