Pages that link to "Item:Q1002102"
From MaRDI portal
The following pages link to Semi-local longest common subsequences in subquadratic time (Q1002102):
Displaying 13 items.
- A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Periodic String Comparison (Q3637113) (← links)
- (Q5091741) (← links)
