The following pages link to Sparse dynamic programming I (Q4302802):
Displaying 20 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Fast algorithms for finding disjoint subsequences with extremal densities (Q850123) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Constrained sequence alignment (Q1209899) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences (Q1861731) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245) (← links)
- Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- (Q5090981) (← links)
- Longest common subsequences (Q5096874) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
