ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Exact string matching algorithms

Renato Urajnar (2013) Exact string matching algorithms. EngD thesis.

Download (1421Kb)


    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.

    Item Type: Thesis (EngD thesis)
    Keywords: substring, string searching, string substitution, string matching, shift, failure function, pattern, pattern matching
    Number of Pages: 57
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Borut Robič28Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=9962836)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2074
    Date Deposited: 28 Jun 2013 16:59
    Last Modified: 16 Jul 2013 14:18
    URI: http://eprints.fri.uni-lj.si/id/eprint/2074

    Actions (login required)

    View Item