scientific article
From MaRDI portal
Publication:3809299
zbMath0659.68109MaRDI QIDQ3809299
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pattern recognitionpattern matchingtime constraintsString matchingcritical factorization theoremspace constraints
Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Theory of compilers and interpreters (68N20)
Related Items (9)
Multiple serial episodes matching ⋮ On-line construction of suffix trees ⋮ Matching a set of strings with variable length don't cares ⋮ On-line construction of position heaps ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ Approximate string matching with suffix automata ⋮ Window-accumulated subsequence matching problem is linear ⋮ Efficient dynamic dictionary matching with DAWGs and AC-automata ⋮ On minimizing pattern splitting in multi-track string matching
This page was built for publication:
