Analiza algoritmov za iskanje podnizov

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2013
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[R. Urajnar]
UDC:	004(043.2)
COBISS:	9962836
Views:	36
Downloads:	3
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Exact string matching algorithms
Secondary abstract:	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.
Secondary keywords:	substring;string searching;string substitution;string matching;shift;failure function;pattern;pattern matching;computer science;diploma;
File type:	application/pdf
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	57 str.
ID:	24168185