Parameterized pattern matching: Algorithms and applications
From MaRDI portal
Publication:1915502
DOI10.1006/jcss.1996.0003zbMath0849.68019OpenAlexW1964169783MaRDI QIDQ1915502
Publication date: 16 July 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0003
Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items (44)
Order-preserving indexing ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ On the parameterised complexity of string morphism problems ⋮ Position heaps for Cartesian-tree matching on strings and tries ⋮ Secure parameterized pattern matching ⋮ Weighted approximate parameterized string matching ⋮ Palindrome pattern matching ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ On the Longest Common Parameterized Subsequence ⋮ Compressed parameterized pattern matching ⋮ The set of parameterized \(k\)-covers problem ⋮ Linear-time construction of two-dimensional suffix trees ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Computing the parameterized Burrows-Wheeler transform online ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ A Filtering Technique for All Pairs Approximate Parameterized String Matching ⋮ The parameterized suffix tray ⋮ Unnamed Item ⋮ A note on the complexity of matching patterns with variables ⋮ Verifying and enumerating parameterized border arrays ⋮ Parameterized matching with mismatches ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Simpler FM-index for parameterized string matching ⋮ Patterns with bounded treewidth ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications ⋮ Periodicity and repetitions in parameterized strings ⋮ Generalized pattern matching and periodicity under substring consistent equivalence relations ⋮ Palindrome Pattern Matching ⋮ Pattern matching with pair correlation distance ⋮ Approximation algorithms for maximum two-dimensional pattern matching ⋮ 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 ⋮ Comparison and evaluation of code clone detection techniques and tools: A qualitative approach ⋮ Dynamic dictionary matching in external memory ⋮ On the longest common parameterized subsequence ⋮ An Encoding for Order-Preserving Matching. ⋮ Orthogonal Range Searching for Text Indexing ⋮ Pattern matching with variables: a multivariate complexity analysis ⋮ Periodicity and Repetitions in Parameterized Strings
This page was built for publication: Parameterized pattern matching: Algorithms and applications
