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
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
ALGORITEM BURROWS-WHEELERJEVE TRANSFORMACIJE
Authors:
ID
Žuran, Andrej
(Author)
ID
Žalik, Borut
(Mentor)
More about this mentor...
Files:
VS_Zuran_Andrej_2016.pdf
(1,71 MB)
MD5: 00294986C217FB31ED981F7A1BE28569
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
V diplomski nalogi smo obravnavali algoritem Burrows-Wheelerjeve transformacije. Spoznali smo idejo transformacije in njen zgodovinski razvoj. Opisali smo najpogosteje uporabljene algoritme in inverz transformacije. Implementirali smo dva izbrana algoritma BWT. Prvi, tako imenovani izboljšan osnovni algoritem transformacije BWT nadgradi osnovno idejo BWT z izboljšanjem prostorske zahtevnosti. Drugi, algoritem, temelječ na predponskem drevesu, si pri gradnji transformacije pomaga s predponskim drevesom, ki smo ga zgradili z Ukkonenovim algoritmom. Implementirana algoritma smo nato primerjali glede na porabo časa CPU in porabo pomnilniškega prostora.
Keywords:
algoritmi
,
predponsko drevo
,
časovna zahtevnost
,
prostorska zahtevnost
Place of publishing:
[Maribor
Publisher:
A. Žuran
Year of publishing:
2016
PID:
20.500.12556/DKUM-57934
UDC:
004.922(043.2)
COBISS.SI-ID:
19509782
NUK URN:
URN:SI:UM:DK:LKP1UUMP
Publication date in DKUM:
13.04.2016
Views:
1545
Downloads:
150
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
:
ŽURAN, Andrej, 2016,
ALGORITEM BURROWS-WHEELERJEVE TRANSFORMACIJE
[online]. Bachelor’s thesis. Maribor : A. Žuran. [Accessed 26 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=57934
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Prehranska podpora bolnikov z napredovalim rakom
Bolečina pri bolniku z napredovalim rakom
Uporaba kanabinoidov pri bolniku z napredovalim rakom
Obravnava delirija pri bolniku z napredovalim rakom
Obvladovanje simptomov v obdobju umiranja pri bolniku z napredovalim rakom
Similar works from other repositories:
Paliativna zdravstvena nega pacienta z napredovalim rakom požiralnika
Pomen terapevtske komunikacije s pacienti z rakom
Posebnosti komunikacije z onkološkim bolnikom
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:
THE BURROWS-WHEELER TRANSFORM ALGORITHM
Abstract:
In diploma thesis we have considered the Burrows-Wheeler transform (BWT). Firstly, the historical backround and the basic idea of BWT have been discussed. Two algorithms for BWT construction have been implemented. The first one, so-called enhanced base algorithm, extends the basic idea of BWT with improvements in space complexity. The second one, the algorithm based on the suffix trees performs BWT via the suffix tree, which was obtained by Ukkonen’s algorithm. Finally, both implemented algorithms have been compared according to spent CPU time and memory consumption.
Keywords:
algorithms
,
suffix tree
,
time complexity
,
memory complexity
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
