scientific article; zbMATH DE number 910912
From MaRDI portal
Publication:4886089
zbMath0960.68587MaRDI QIDQ4886089
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Efficient parameterized string matching ⋮ Position heaps for Cartesian-tree matching on strings and tries ⋮ Weighted approximate parameterized string matching ⋮ The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ On the Longest Common Parameterized Subsequence ⋮ Compressed parameterized pattern matching ⋮ Parameterized longest previous factor ⋮ Verifying and enumerating parameterized border arrays ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams ⋮ Dynamic dictionary matching in external memory ⋮ On the longest common parameterized subsequence
