Matching patterns in strings subject to multi-linear transformations
type: Item
instance of: scholarly article
title: Matching patterns in strings subject to multi-linear transformations
zbMATH Open document ID: 0663.68081
DOI: 10.1016/0304-3975(88)90112-0
author: Uzi Vishkin
author: Tali Eilam Tzoreff
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: Suppose we are given two strings of real numbers. The longer string is called text and the other is called pattern. We consider problems within the following framework. Suppose each symbol of the pattern was modified by any transformation which is a member in some family of transformations. Find all occurrences of the pattern in the text where the pattern may appear subject to any one of these transformations. Problems are introduced and efficient algorithms are given.
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 4085047
zbMATH Keywords: pattern matching
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90112-0
OpenAlex ID: W1992876024
cites work: A fast string searching algorithm
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Q5631336
cites work: Time-space-optimal string matching
cites work: A Survey of Parallel Algorithms in Numerical Linear Algebra
cites work: Fast Pattern Matching in Strings
cites work: Efficient randomized pattern-matching algorithms
cites work: Q5612183
cites work: Efficient string matching with k mismatches
cites work: Fast string matching with k differences
cites work: Q4509227
cites work: Optimal parallel pattern matching in strings
description: scientific article; zbMATH DE number 4085047