The following pages link to Approximate swapped matching. (Q1853034):
Displaying 24 items.
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- The swap matching problem revisited (Q300248) (← links)
- Using swaps and deletes to make strings match (Q476911) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Overlap matching. (Q1401926) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Approximate periodicity (Q2343134) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Pattern matching with swaps in practice (Q2909198) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← 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)
- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns (Q5448657) (← links)
- Fast Cartesian tree matching (Q6536248) (← links)
