Matching Patterns in Strings Subject to Multi-Linear Transformations

Tali Eilam-Tzoreff and Uzi Vishkin
Additional contact information
Tali Eilam-Tzoreff: Tel Aviv University, Department of Computer Science School of Mathematical Sciences Sackler Faculty of Exact Sciences
Uzi Vishkin: Tel Aviv University, Department of Computer Science School of Mathematical Sciences Sackler Faculty of Exact Sciences

A chapter in Sequences, 1990, pp 45-58 from Springer

Abstract: Abstract 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.

Keywords: Minimum Distance; Pattern Match; String Match; Linear Time Algorithm; Homogeneous Part (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().