Stablo Bloomovih filtara za spremanje sljedova

undergraduate thesis

• Title (english): Sequence Bloom Tree
• Author: Luka Škugor
• Mentor: Mile Šikić (mentor)
• Committee member: Mile Šikić (predsjednik povjerenstva)
• Committee member: Krešimir Križanović (član povjerenstva)
• Committee member: Robert Vaser (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2016-07-11, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

Kako u rješenjima problema pretraživanja sličnih nizova još uvijek postoji mjesta za napredak i poboljšanje, u ovom smo radu istražili jedan novi pristup rješavanju tog problema. Rješenje o kojem je riječ naziva se stablo Bloomovih filtra te nudi poboljšanja nad dosadašnjim metodama pretrage sličnih nizova. Zauzvrat ima i mane, koje su specifične za ovu strukturu, kao što je prezentiranje lažno pozitivnih rezultata.

Abstract (english)

As today's inexact matching algorithms have plenty of room for improvement, in this work we explored a new approach to solve inexact matching problems. The name of approach we explored is Bloom filter tree and it offers improvements over existing inexact matching algorithms. In return, it has its drawbacks, like presenting false positive results.

• Keywords: Bloomov filter; stablo; proteinski lanci; slični nizovi
• Keywords (english): Bloom filter; tree; proteins; similar sequences
• Language: croatian
• URN:NBN: urn:nbn:hr:168:130915
• Study programme: Title: 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 resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2018-02-06 12:20:34