Order-preserving pattern matching indeterminate strings
From MaRDI portal
Publication:5140763
Recommendations
Cites work
- scientific article; zbMATH DE number 2087053 (Why is no real title available?)
- scientific article; zbMATH DE number 1445373 (Why is no real title available?)
- A fast algorithm for order-preserving pattern matching
- A fast string searching algorithm
- A filtration method for order-preserving matching
- A linear time algorithm for consecutive permutation pattern matching
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A theory of parameterized pattern matching
- Algorithms For Computing Approximate Repetitions In Musical Sequences
- Algorithms on Extended (δ, γ)-Matching
- Alphabet dependence in parameterized matching
- Approximate matching in the \(L_{\infty }\) metric
- Approximate string matching for music analysis
- Approximating general metric distances between a pattern and a text
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- Experimental and Efficient Algorithms
- Fast Pattern Matching in Strings
- Fast order-preserving pattern matching
- Fast pattern-matching on indeterminate strings
- Function Matching
- Generalized function matching
- Improving practical exact string matching
- On computing the length of longest increasing subsequences
- On special families of morphisms related to \(\delta \)-matching and don't care symbols
- Order-preserving matching
- Overlap matching.
- Pattern Matching with Swaps
- Single and multiple consecutive permutation motif search
Cited in
(3)
This page was built for publication: Order-preserving pattern matching indeterminate strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140763)