Function matching: Algorithms, applications, and a lower bound
From MaRDI portal
Recommendations
Cited in
(21)- Fast parameterized matching with \(q\)-grams
- Permuted function matching
- A brief history of parameterized matching problems
- Pattern matching with variables: a multivariate complexity analysis
- Weighted approximate parameterized string matching
- A note on the complexity of matching patterns with variables
- Generalized function matching
- On the parameterised complexity of string morphism problems
- Periodicity and Repetitions in Parameterized Strings
- MIMIC FUNCTIONS
- Patterns with bounded treewidth
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
- New variants of pattern matching with constants and variables
- Function Matching
- Generalized function matching
- Simon's congruence pattern matching
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Pattern matching with address errors: rearrangement distances
- Property matching and weighted matching
- Periodicity and repetitions in parameterized strings
- Pattern matching with pair correlation distance
This page was built for publication: Function matching: Algorithms, applications, and a lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449230)
