prikaz prve stranice dokumenta FM-indeks
No public access
undergraduate thesis
FM-indeks
2019. urn:nbn:hr:168:696088
Radanović, Juraj
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Radanović, J. (2019). FM-indeks (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:696088

Radanović, Juraj. "FM-indeks." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:696088

Radanović, Juraj. "FM-indeks." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:696088

Radanović, J. (2019). 'FM-indeks', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 14 November 2024, https://urn.nsk.hr/urn:nbn:hr:168:696088

Radanović J. FM-indeks [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2019 [cited 2024 November 14] Available at: https://urn.nsk.hr/urn:nbn:hr:168:696088

J. Radanović, "FM-indeks", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:168:696088

Please login to the repository to save this object to your list.
Metadata
TitleFM-indeks
Title (english)FM-index
AuthorJuraj Radanović
MentorMirjana Domazet-Lošo (mentor)
Committee memberMirjana Domazet-Lošo (predsjednik povjerenstva)
Committee memberBoris Milašinović (član povjerenstva)
Committee memberBoris Vrdoljak (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2019-07-12, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Ubrzan razvoj računarstva zadnjih nekoliko desetljeća omogućio je obradu velikih količina podataka, pa tako i genetskih podataka. Cijeli genomi mogu imati i više milijardi znakova, te je potrebno stvoriti programe koji efikasno, memorijski i vremenski, obavljaju određene zadatke. Jedan od zadataka je pretraživanje određenog slijeda nukleotida u cijelom genomu, čime sam se bavio u ovom radu. Koristio sam dvije inačice programa kako bih usporedio rezultate i pokazao poboljšanje performansa programa. Na temelju donesenih rezultata, izvodim zaključak da je brzina traženja podniza sa stablom valića i RRR strukturom znatno brže uspoređujući s iterativnom inačicom.
Abstract (english)
Rapid development of computing in the last few decades enabled processing of large data sets, including genomic data. Whole genomes can be stored as sequences whose length is several billion characters, so it is necessary to develop programs, which are both memory and time efficient. One of the tasks is looking up a certain subsequence in a genome. I focus on this problem in my thesis. I have used two versions of the program to compare results and to show how to improve the performance of the program. Based on the results, I made conclusions that the speed of finding a pattern in a string with a wavelet tree and RRR structure is significantly faster than its iterative counterpart.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:696088
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2020-01-07 21:41:52