Sparse dynamic programming I
From MaRDI portal
Recommendations
Cited in
(32)- Sparse LCS common substring alignment
- Rapid dynamic programming algorithms for RNA secondary structure
- Speeding up dynamic programming with applications to molecular biology
- Dynamic programming with convexity, concavity and sparsity
- Constrained sequence alignment
- Efficient algorithms for approximate string matching with swaps
- An efficient algorithm for LCS problem between two arbitrary sequences
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- A discipline of dynamic programming over sequence data
- Linear-space algorithms that build local alignments from fragments
- Co-linear chaining with overlaps and gap costs
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- scientific article; zbMATH DE number 432798 (Why is no real title available?)
- Fast Algorithms for Computing Tree LCS
- Sparse dynamic programming II
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- scientific article; zbMATH DE number 826057 (Why is no real title available?)
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- Longest common subsequences
- Cache efficient simple dynamic programming
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Sequence to graph alignment using gap-sensitive co-linear chaining
- A Linear-Time n 0.4 -Approximation for Longest Common Subsequence
- Polynomial-delay enumeration of maximal common subsequences
- The longest common subsequence problem for small alphabets in the word RAM model
- A linear-time \(n^{0.4}\)-approximation for longest common subsequence
- Fast algorithms for computing tree LCS
- Fast algorithms for finding disjoint subsequences with extremal densities
- Finding common structured patterns in linear graphs
This page was built for publication: Sparse dynamic programming I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302802)
