Parallel String Matching Algorithms

Abstract

The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we survey recent results on parallel algorithms for the string matching problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1992
Accession Number
ADA274502

Entities

People

  • Dany Breslauer
  • Zvi Galil

Organizations

  • Columbia University

Tags

Communities of Interest

  • Advanced Electronics
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Computations
  • Computer Science
  • Construction
  • Fingerprints
  • Finite Alphabet
  • Parallel Computing
  • Preprocessing
  • Probability
  • Text Processing
  • Theorems
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Library and Information Science
  • Neural Network Machine Learning.