Alphabet dependence in parameterized matching
From MaRDI portal
Publication:1318756
DOI10.1016/0020-0190(94)90086-8zbMATH Open0795.68077OpenAlexW2028654948MaRDI QIDQ1318756FDOQ1318756
Authors: 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (49)
- Pattern matching with pair correlation distance
- Periodicity and Repetitions in Parameterized Strings
- The structural border array
- Parameterized longest previous factor
- Order-preserving pattern matching indeterminate strings
- Order-preserving pattern matching indeterminate strings
- Pattern matching in pseudo real-time
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Efficient parameterized string matching
- Multiple matching of parameterized patterns
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Towards a real time algorithm for parameterized longest common prefix computation
- Parameterized searching with mismatches for run-length encoded strings
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- Variations of the parameterized longest previous factor
- Alphabet-Independent and Scaled Dictionary Matching
- The set of parameterized \(k\)-covers problem
- Online parameterized dictionary matching with one gap
- Parameterized dictionary matching and recognition with one gap
- Title not available (Why is that?)
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Dynamic dictionary matching in external memory
- Parameterized matching on non-linear structures
- Reconstructing parameterized strings from parameterized suffix and LCP arrays
- On the longest common parameterized subsequence
- Weighted approximate parameterized string matching
- \(p\)-suffix sorting as arithmetic coding
- The submatrices character count problem: An efficient solution using separable values
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Finding patterns and periods in Cartesian tree matching
- Reconstructing parameterized strings from parameterized suffix and LCP arrays
- Overlap matching.
- Compressed parameterized pattern matching
- Cartesian Tree Matching and Indexing
- Fast parameterized matching with \(q\)-grams
- Permuted function matching
- New variants of pattern matching with constants and variables
- Counting Parameterized Border Arrays for a Binary Alphabet
- A brief history of parameterized matching problems
- Efficient pattern matching for RNA secondary structures
- Verifying and enumerating parameterized border arrays
- Order-preserving matching
- On the Longest Common Parameterized Subsequence
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- A prefix array for parameterized strings
- Fast Cartesian tree matching
- Efficient parameterized pattern matching in sublinear space
- Periodicity and repetitions in parameterized strings
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
This page was built for publication: Alphabet dependence in parameterized matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318756)
