Alphabet dependence in parameterized matching

DOI10.1016/0020-0190(94)90086-8zbMath0795.68077OpenAlexW2028654948MaRDI QIDQ1318756

V. Pereyra

Publication date: 5 April 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90086-8

zbMATH Keywords

string matchingparameterized pattern matchingsoftware maintenance

Mathematics Subject Classification ID

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

Related Items (44)

Efficient parameterized string matching ⋮ The submatrices character count problem: An efficient solution using separable values ⋮ Permuted function matching ⋮ 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 ⋮ Overlap matching. ⋮ The set of parameterized \(k\)-covers problem ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Online parameterized dictionary matching with one gap ⋮ Parameterized longest previous factor ⋮ Order-preserving matching ⋮ Fast algorithms for single and multiple pattern Cartesian tree matching ⋮ Verifying and enumerating parameterized border arrays ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Parameterized dictionary matching and recognition with one gap ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Multiple matching of parameterized patterns ⋮ Efficient pattern matching for RNA secondary structures ⋮ Periodicity and repetitions in parameterized strings ⋮ Generalized pattern matching and periodicity under substring consistent equivalence relations ⋮ A prefix array for parameterized strings ⋮ Pattern matching with pair correlation distance ⋮ Pattern matching in pseudo real-time ⋮ Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics ⋮ Parameterized searching with mismatches for run-length encoded strings ⋮ Unnamed Item ⋮ Parameterized matching on non-linear structures ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams ⋮ Cartesian Tree Matching and Indexing ⋮ Dynamic dictionary matching in external memory ⋮ Unnamed Item ⋮ On the longest common parameterized subsequence ⋮ Order-preserving pattern matching indeterminate strings ⋮ Periodicity and Repetitions in Parameterized Strings ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

Cites Work

• Time-space-optimal string matching
• A fast string searching algorithm
• A Time-Space Tradeoff for Element Distinctness
• Efficient string matching
• Fast Pattern Matching in Strings
• A theory of parameterized pattern matching
• Multiple matching of rectangular patterns

This page was built for publication: Alphabet dependence in parameterized matching