The following pages link to Sparse dynamic programming II (Q4302803):
Displaying 15 items.
- A hyper-heuristic for the longest common subsequence problem (Q441749) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Speeding up dynamic programming with applications to molecular biology (Q1121182) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- An improved algorithm for the longest common subsequence problem (Q1762001) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- Sparse dynamic programming I (Q4302802) (← links)
- Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology (Q4485189) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- Local multiple alignment via subgraph enumeration (Q5961633) (← links)
