Virknes tekstā atrašanas algoritmu analīze
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Bakalaura darbā no dažādiem aspektiem ir analizēti virknes meklēšanas tekstā algoritmi. Šādi algoritmi pārstāv svarīgu pētījumu jomu datoru zinātņu jomā, jo tos var izmantot ļoti plaši: datu bāzu pārvaldē, informācijas drošībai u.c. Praksē tiek izmantoti dažādi algoritmi, tomēr to funkcionālās iespējas un raksturojumi atšķiras. Kā pētījuma objekts tiek izvēlēti algoritmi, kurus biežāk izmanto virknes meklēšanai tekstā – Primitīvs, Knuta-Morisa-Prata, Bojera-Moora, Karpa-Rabina. Algoritmu aprakstos ar piemēriem tiek paradīta to uzvedība dažādos apstākļos. Viens no galvenajiem darba uzdevumiem ir izvēlēties efektīvāko algoritmu no piedāvātajiem, ka arī tiek aplūkots jautājums par ideāla algoritma eksistenci. Darbs balstās ne tikai uz teorētiskām zināšanām, bet arī iekļauj eksperimenta daļu, kurā tiek pārbaudīta algoritma ātrdarbība.
In this bachelor algorithms for finding a string in the text from different aspects are analyzed. Such algorithms present one of the computer science area’s, because it can be used in various ways: database management, information safety etc. Various algorithms are implemented in practice, however their functional possibilities and descriptions are different. As a research object several algorithms were selected, which are most frequently used for searching a string in the text - Primitive, Knuth-Morris-Pratt, Boyer-Moore, Karp-Rabin. In descriptions part, algorithms' behavior in various conditions are shown. Main goal of this paper is to choose the most effective algorithm from offered options and to consider an existence of an ideal algorithm. The paper is based not only on theoretical materials, but also include an experimental part, where algorithms’ speed is verified.
In this bachelor algorithms for finding a string in the text from different aspects are analyzed. Such algorithms present one of the computer science area’s, because it can be used in various ways: database management, information safety etc. Various algorithms are implemented in practice, however their functional possibilities and descriptions are different. As a research object several algorithms were selected, which are most frequently used for searching a string in the text - Primitive, Knuth-Morris-Pratt, Boyer-Moore, Karp-Rabin. In descriptions part, algorithms' behavior in various conditions are shown. Main goal of this paper is to choose the most effective algorithm from offered options and to consider an existence of an ideal algorithm. The paper is based not only on theoretical materials, but also include an experimental part, where algorithms’ speed is verified.