Analiza algoritmov za iskanje podnizov

Povzetek

Ključne besede

Podatki

Jezik:	Slovenski jezik
Leto izida:	2013
Tipologija:	2.11 - Diplomsko delo
Organizacija:	UL FRI - Fakulteta za računalništvo in informatiko
Založnik:	[R. Urajnar]
UDK:	004(043.2)
COBISS:	9962836
Št. ogledov:	36
Št. prenosov:	3
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Angleški jezik
Sekundarni naslov:	Exact string matching algorithms
Sekundarni povzetek:	Substring searching is one of the most prominent problems in computer science. We described and compared with each other by now well-known approaches to the solution. Algorithms were classified according to their properties, such as number of patterns and the direction in which the comparisons are performed. We examined the main idea, advantages and time complexity for each algorithm. Some basic algorithms, which are searching for exactly one pattern, were implemented in Java and tested on a practical example. We picked the fastest one among them.
Sekundarne ključne besede:	substring;string searching;string substitution;string matching;shift;failure function;pattern;pattern matching;computer science;diploma;
Vrsta datoteke:	application/pdf
Vrsta dela (COBISS):	Diplomsko delo/naloga
Komentar na gradivo:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Strani:	57 str.
ID:	24168185