Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Algoritem konstrukcije Burrows-Wheelerjeve transformacije s priponskim poljem
Authors:
ID
Jeromel, Anže
(
Author
)
ID
Žalik, Borut
(
Mentor
)
More about this mentor...
Files:
UN_Jeromel_Anze_2016.pdf
(1,18 MB)
MD5: FE07E82C771740D803090C93E4612184
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
V diplomski nalogi smo obravnavali dva različna načina konstrukcije Burrows-Wheelerjeve transformacije in ju primerjali glede na čas izvajanja. Razložili smo idejo in postopek transformacije in njenega inverza ter ju prikazali na primeru. Implementirali smo dva različna algoritma – izboljšan osnovni algoritem ter algoritem s priponskim poljem. Izbrana algoritma smo preizkusili na različnih datotekah in rezultate primerjali. Ugotovili smo, da se izboljšan osnovni algoritem bolje izkaže pri krajših nizih naključno porazdeljenih znakov, pri vseh ostalih pa je bolje uporabiti algoritem s priponskim poljem.
Keywords:
algoritem
,
podatkovna struktura
,
priponsko polje
Place of publishing:
[Maribor
Publisher:
A. Jeromel
Year of publishing:
2016
PID:
20.500.12556/DKUM-63082
UDC:
004.422.63(043.2)
COBISS.SI-ID:
20080662
NUK URN:
URN:SI:UM:DK:1URYBMUI
Publication date in DKUM:
23.09.2016
Views:
1448
Downloads:
124
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
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.
Secondary language
Language:
English
Title:
Burrows-Wheeler transform construction using suffix array
Abstract:
In our thesis, we explored two different approaches to constructing the Burrows-Wheeler transform and compared their execution time. We explained the basic idea and process of the transform and its inverse transform and presented examples of both. We implemented two different algorithms – an improved basic algorithm and an algorithm, which utilises a suffix array. Both approaches were then tested on different files and the results compared. Results show that the improved basic algorithm works better with shorter strings of randomly distributed characters. With all other test strings, however, the suffix array algorithm achieved better results.
Keywords:
algorithm
,
data structure
,
suffix array
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
