A theory of parameterized pattern matching
From MaRDI portal
Cited in
(46)- Pattern matching with pair correlation distance
- The structural border array
- Parameterized longest previous factor
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Order-preserving pattern matching indeterminate strings
- Order-preserving pattern matching indeterminate strings
- Multiple matching of parameterized patterns
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Pattern matching with address errors: rearrangement distances
- Variations of the parameterized longest previous factor
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- Computing maximal palindromes in non-standard matching models
- On updating suffix tree labels
- Structural Pattern Matching - Succinctly.
- Online parameterized dictionary matching with one gap
- Parameterized dictionary matching and recognition with one gap
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- Alphabet dependence in parameterized matching
- Computing the parameterized Burrows-Wheeler transform online
- A filtering technique for all pairs approximate parameterized string matching
- Weighted approximate parameterized string matching
- Computing maximal palindromes in non-standard matching models
- p-suffix sorting as arithmetic coding
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Position heaps for Cartesian-tree matching on strings and tries
- Finding patterns and periods in Cartesian tree matching
- LF successor: compact space indexing for order-isomorphic pattern matching
- Succinct non-overlapping indexing
- Overlap matching.
- Compressed parameterized pattern matching
- On the complexity of indeterminate strings matching
- Fast parameterized matching with \(q\)-grams
- Cartesian Tree Matching and Indexing
- Permuted function matching
- Partial permutations comparison, maintenance and applications
- On-line construction of parameterized suffix trees for large alphabets
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
- Inverting parameterized Burrows-Wheeler transform
- Reconstructing general matching graphs
- Efficient pattern matching for RNA secondary structures
- A brief history of parameterized matching problems
- Order-preserving matching
- Generalized function matching
- The parameterized suffix tray
- A prefix array for parameterized strings
- Fast Cartesian tree matching
This page was built for publication: A theory of parameterized pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248473)
