The following pages link to Order-preserving matching (Q2437748):
Displayed 13 items.
- Order-preserving indexing (Q294954) (← links)
- Order-preserving pattern matching with \(k\) mismatches (Q294955) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- A filtration method for order-preserving matching (Q894438) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- On representations of ternary order relations in numeric strings (Q2363988) (← links)
- Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem (Q2942252) (← links)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)