<--- Back to Details
First PageDocument Content
Information science / Information retrieval / Knuth–Morris–Pratt algorithm / String matching algorithms / String searching algorithm / Boyer–Moore string search algorithm
Date: 2003-02-19 15:44:26
Information science
Information retrieval
Knuth–Morris–Pratt algorithm
String matching algorithms
String searching algorithm
Boyer–Moore string search algorithm

Add to Reading List

Source URL: www.cs.utexas.edu

Download Document from Source Website

File Size: 1,14 MB

Share Document on Facebook

Similar Documents

String matching algorithms / Analysis of algorithms / Donald Knuth / Knuth–Morris–Pratt algorithm / String searching algorithm / Matching / Time complexity / Suffix tree / Theoretical computer science / Computational complexity theory / Applied mathematics

Approximate Parameterized Matching CARMIT HAZAY AND MOSHE LEWENSTEIN Bar-Ilan University AND DINA SOKOL

DocID: 1fG66 - View Document

Combinatorics on words / String matching algorithms / Fibonacci heap / Knuth–Morris–Pratt algorithm / Shortest path problem / String / Substring / Algorithm / Heap / Mathematics / Combinatorics / Fibonacci numbers

CS 373: Combinatorial Algorithms, Fall 2000 Homework 4 (due October 26, 2000 at midnight) Name: Net ID:

DocID: 18ZYG - View Document

Formal languages / String matching algorithms / Logic in computer science / Programming language semantics / Donald Knuth / Knuth–Morris–Pratt algorithm / String / Algorithm / Functional programming / Mathematics / Theoretical computer science / Computing

BRICS Basic Research in Computer Science BRICS RSAger et al.: On Obtaining Knuth, Morris, and Pratt’s String Matcher by Partial Evaluatio On Obtaining Knuth, Morris, and Pratt’s

DocID: 18sO4 - View Document

Computing / Suffix tree / Rope / Substring / Knuth–Morris–Pratt algorithm / String kernel / Longest common substring problem / Approximate string matching / String / Binary trees / Mathematics

1 Fast Kernels for String and Tree Matching S.V.N. Vishwanathan Machine Learning Program

DocID: 18soE - View Document

String matching algorithms / Analysis of algorithms / Fibonacci number / Sorting algorithms / String searching algorithm / Knuth–Morris–Pratt algorithm / Algorithm / Time complexity / Theoretical computer science / Applied mathematics / Mathematics

CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 5 (due Tue. Apr. 17, 2001 at 11:59 pm) Name: Net ID:

DocID: 18hFn - View Document