An algorithm for string matching with a sequence of don't cares

DOI10.1016/0020-0190(91)90032-DzbMath0713.68026OpenAlexW2053767428MaRDI QIDQ750152

Udi Manber, Ricardo A. Baeza-Yates

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90032-d

zbMATH Keywords

design of algorithmssuffix arrayorthogonal range queriesstring matchings with gaps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items

A matching algorithm in PMWL based on CluTree ⋮ Multiple serial episodes matching ⋮ A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets ⋮ Matching a set of strings with variable length don't cares ⋮ Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions ⋮ On the string matching with \(k\) mismatches ⋮ A faster algorithm for matching a set of patterns with variable length don't cares ⋮ Window-accumulated subsequence matching problem is linear

Cites Work

• Generalized String Matching
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for string matching with a sequence of don't cares