Matching patterns in strings subject to multi-linear transformations

DOI10.1016/0304-3975(88)90112-0zbMath0663.68081MaRDI QIDQ1115200

Uzi Vishkin, Tali Eilam Tzoreff

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90112-0

zbMATH Keywords

pattern matching

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68R99: Discrete mathematics in relation to computer science

Related Items

A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS, Efficient indexing algorithms for one-dimensional discretely-scaled strings, Scaled and permuted string matching, Matching with don't-cares and a small number of mismatches, Hardness of comparing two run-length encoded strings, Collage system: A unifying framework for compressed pattern matching., The indexing for one-dimensional proportionally-scaled strings

Cites Work

• Efficient string matching with k mismatches
• Fast string matching with k differences
• Time-space-optimal string matching
• A fast string searching algorithm
• Optimal parallel pattern matching in strings
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item