| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Iskanje niza v besedilu
Authors:ID Pukšič, Sergej (Author)
ID Vesel, Aleksander (Mentor) More about this mentor... New window
Files:.pdf UNI_Puksic_Sergej_2012.pdf (2,68 MB)
MD5: 1AE87023378CBD4028963A0FB679E908
PID: 20.500.12556/dkum/a7ab253e-668e-4498-aacc-22fef8cc4585
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Besedilo B in niz S sta zaporedji znakov iz abecede ∑. Pri problemu iskanja niza v besedilu želimo poiskati vse ponovitve niza S v besedilu B. V ta namen so v prvem poglavju diplomskega dela predstavljene teoretične osnove. Opisan je princip snovanja in ob tem predstavljen postopek ocenjevanja časovne in prostorske zahtevnosti algoritmov. Drugo poglavje je namenjeno teoretičnim osnovam, ki se pojavljajo pri problemu iskanja niza v besedilu. Predstavljena je definicija, nato so opisane lastnosti in zakonitosti, ki se pojavljajo tekom iskanja nizov v besedilu. Naslednja poglavja so namenjena predstavitvi treh algoritmov, ki se uporabljajo pri nalogah iskanja niza v besedilu. Opisane so njihove lastnosti, njihovo delovanje pa je predstavljeno z različnimi grafičnimi prikazi ter psevdokodo. Za vsakega izmed njih je prav tako predstavljena ocena časovne zahtevnosti.
Keywords:niz, besedilo, iskanje, ujemanje, algoritem, naivni, Rabin-Karp, končni avtomat, časovna zahtevnost, prostorska zahtevnost
Place of publishing:Maribor
Publisher:[S. Pukšič]
Year of publishing:2012
PID:20.500.12556/DKUM-22898 New window
UDC:51(043.2)
COBISS.SI-ID:19144456 New window
NUK URN:URN:SI:UM:DK:IXVJXVIO
Publication date in DKUM:23.05.2012
Views:2253
Downloads:143
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and 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:String matching
Abstract:The text B and string S are sequences of characters from the alphabet ∑. The problem of string matching is to find all occurences of the string S in the text B. For this purpose the first chapter presents the theoretical basics. The design principle is described, while the evaluation of algorithm's time and space complexity is presented. The second chapter is devoted to theoretical foundations that are encoutered through the process of string matching. Definition and description of characteristics and principles that may arise during the string matching process is described. The following chapters are intended to present three algorithms that are used in string matching tasks. Described are their properties while their actions are presented with various graphical presentations and pseudocode. For each of them the evaluation of time complexity was also made.
Keywords:pattern, string, searching, matching, algorithm, naive, brute-force, Rabin-Karp, finite automata, time complexity, space, 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