Ukkonenov algoritem konstrukcije priponskega drevesa : diplomsko delo

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Ukkonenov algoritem konstrukcije priponskega drevesa : diplomsko delo
Authors:	ID Horvat, Štefan (Author) ID Žalik, Borut (Mentor) More about this mentor... ID Bizjak, Marko (Comentor)
Files:	UN_Horvat_Stefan_2020.pdf (1,21 MB) MD5: 3A41B8680F8E6BBF0FC5FDE853AF72FC PID: 20.500.12556/dkum/1d4274ec-e80a-4b2d-ab44-35319e8ff4bf
Language:	Slovenian
Work type:	Bachelor thesis/paper
Typology:	2.11 - Undergraduate Thesis
Organization:	FERI - Faculty of Electrical Engineering and Computer Science
Abstract:	S pomočjo priponskih dreves lahko zelo preprosto in hitro izvajamo različne operacije nad nizi. Za gradnjo priponskih dreves obstajajo različni algoritmi. V diplomskem delu opi-šemo in implementiramo Ukkonenov algoritem, ki priponsko drevo zgradi v linearnem času. Najprej preučimo delovanje algoritma in tvorimo ustrezne podatkovne strukture. Sledi implementacija in preizkušanje. Z eksperimenti pokažemo karakteristike algoritma ob različnem številu znakov ter preverimo njegovo časovno in prostorsko zahtevnost.
Keywords:	algoritmi, podatkovne strukture, analiza algoritmov, časovna in prostorska zahtevnost
Place of publishing:	Maribor
Place of performance:	Maribor
Publisher:	[Š. Horvat]
Year of publishing:	2020
Number of pages:	V, 43 f.
PID:	20.500.12556/DKUM-77237
UDC:	004.422.63(043.2)
COBISS.SI-ID:	37249027
NUK URN:	URN:SI:UM:DK:QHQ5OZNK
Publication date in DKUM:	03.11.2020
Views:	1291
Downloads:	153
Metadata:
Categories:	KTFMB - FERI
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

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

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:	24.08.2020

Language:	English
Title:	Ukkonen's algorithm for suffix tree construction
Abstract:	Different operations on strings can be executed efficiently using a suffix tree. Various algorithms exist for the suffix tree construction. Ukkonen’s algorithm is one of them andis considered in this thesis. The idea of the algorithm is presentedfirst. The used data structuresare described next,followed by implementation details. Our implementation of the Ukkonen’s algorithm is evaluated in regard to the spent CPU time and computer memory usage. The obtained implementation turns out stable and efficient.
Keywords:	algorithms, data structures, algorithm analysis, space and time complexity

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back