The following pages link to Pattern Matching with Swaps (Q4521515):
Displaying 25 items.
- The swap matching problem revisited (Q300248) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Overlap matching. (Q1401926) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Order-preserving matching (Q2437748) (← links)
- On a compact encoding of the swap automaton (Q2446600) (← links)
- Generalized function matching (Q2466014) (← links)
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates (Q2672245) (← links)
- PATTERN MATCHING WITH SWAPS IN PRACTICE (Q2909198) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Pattern Matching with Swaps for Short Patterns in Linear Time (Q3599078) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- (Q5140763) (← links)
- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns (Q5448657) (← links)
- Indexing Circular Patterns (Q5452151) (← links)