The following pages link to (Q4133128):
Displaying 17 items.
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Using swaps and deletes to make strings match (Q476911) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Overlap matching. (Q1401926) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Adaptive Computation of the Swap-Insert Correction Distance (Q2949833) (← links)
- (Q3143773) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
