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. === Die...
Main Author: | Reichelt, Stephan |
---|---|
Language: | German |
Published: |
Technische Universität Chemnitz
2002
|
Subjects: | |
Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200200801 https://monarch.qucosa.de/id/qucosa%3A17859 https://monarch.qucosa.de/api/qucosa%3A17859/attachment/ATT-0/ https://monarch.qucosa.de/api/qucosa%3A17859/attachment/ATT-1/ https://monarch.qucosa.de/api/qucosa%3A17859/attachment/ATT-2/ |
Similar Items
-
Grundlegende Textsuchalgorithmen
by: Reichelt, Stephan
Published: (2002) -
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
by: Saqib Iqbal Hakak, et al.
Published: (2019-01-01) -
Comparison of Knuth Morris Pratt and Boyer Moore algorithms for a web-based dictionary of computer terms
by: Ali Khumaidi, et al.
Published: (2020-01-01) -
PENERAPAN ALGORITMA KNUTH-MORRIS-PRATT PADA FITUR PENCARIAN DEFINISI ISTILAH STANDAR OPERASIONAL PROSEDUR (SOP) PADA LEMBAGA PENJAMINAN MUTU UIN AR-RANIRY
by: Khairan AR Khairan, et al.
Published: (2019-05-01) -
ANALISIS STRING MATCHING PADA JUDUL SKRIPSI DENGAN ALGORITMA KNUTH-MORRIS PRATT (KMP)
by: Wistiani Astuti
Published: (2017-08-01)