Return to search

Grundlegende Textsuchalgorithmen

This document was created in addition to a recital for the seminar Pattern Matching at Chemnitz University of Technology in term 2001/2002.

It is a description of basic text search approaches, which are the algorithms of Brute Force, Knuth-Morris-Pratt, Boyer-Moore and Boyer-Moore-Horspool. / Dieses Dokument entstand parallel zu einem Vortrag für das Proseminar Pattern Matching im Wintersemester 2001/2002 an der Technischen Universität Chemnitz.

Es stellt die Funktionsweise der grundlegenden Suchalgorithmen Brute Force, Knuth-Morris-Pratt, Boyer-Moore sowie Boyer-Moore-Horspool dar.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:17859
Date01 July 2002
CreatorsReichelt, Stephan
PublisherTechnische Universität Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageGerman
Detected LanguageEnglish
Typedoc-type:lecture, info:eu-repo/semantics/lecture, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.002 seconds