| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Algoritem sa-is za tvorbo priponskega polja
Authors:ID Kvar, Daniel (Author)
ID Žalik, Borut (Mentor) More about this mentor... New window
ID Jeromel, Aljaž (Co-mentor)
Files:.pdf VS_Kvar_Daniel_2022.pdf (1,37 MB)
MD5: E61D7B4FE54957BCB3F3107ADB13B92E
 
Language:Slovenian
Work type:Bachelor thesis/paper (mb11)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Priponsko polje je podatkovna struktura, ki nam zelo učinkovito pomaga, kadar želimo izvajati določene operacije nad nizi, kot recimo: iskanje vzorca v nizu, iskanje najdaljšega ponavljajočega se niza in podobne. Obstaja več algoritmov za tvorbo priponskega polja. Algoritem SA-IS obljublja njegovo konstrukcijo v linearnem času, majhno prostorsko zahtevnost in hitrost v praksi. V diplomskem delu bomo najprej analizirali delovanje algoritma, sledila bo implementacija, testiranje in merjenje časa CPU ter porabo pomnilnika implementiranega algoritma.
Keywords:računalništvo, algoritem, podatkovna struktura, priponska polja, inducirano razvrščanje, časovna zahtevnost
Year of publishing:2022
Source:Maribor
PID:20.500.12556/DKUM-82300 New window
Publication date in DKUM:25.08.2022
Views:477
Downloads:136
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:11.08.2022

Secondary language

Language:English
Title:Sa-Is algorithm for suffix array construction
Abstract:A suffix array is a data structure that is very efficient for various string operations, such as finding a pattern in a string or finding the longest common prefix. Many algorithms exist for constructing suffix arrays. SA-IS algorithm promises its construction in linear time with good space efficiency and speed in practice. In this thesis, we explain the algorithm at first. Information about its implementation, testing, and measurements of spent CPU time and memory during the algorithm's execution follows.
Keywords:computer science, algorithm, data structure, suffix arrays, induced sorting, time complexity


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica