Matching patterns in strings subject to multi-linear transformations (Q1115200): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90112-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992876024 / rank | |||
Normal rank | |||
Revision as of 01:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matching patterns in strings subject to multi-linear transformations |
scientific article |
Statements
Matching patterns in strings subject to multi-linear transformations (English)
0 references
1988
0 references
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.
0 references
pattern matching
0 references
