The following pages link to (Q5417707):
Displaying 11 items.
- A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- On totally positive matrices and geometric incidences (Q458293) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (Q2165031) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
