Pages that link to "Item:Q1121182"
From MaRDI portal
The following pages link to Speeding up dynamic programming with applications to molecular biology (Q1121182):
Displaying 18 items.
- Online dynamic programming speedups (Q839641) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- On the space complexity of some algorithms for sequence comparison (Q1184980) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Constrained sequence alignment (Q1209899) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- The undecidability of the unrestricted modified edit distance (Q1390869) (← links)
- Tree edit distance with gaps (Q1853686) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition (Q2234794) (← links)
- List partitions (Q2366166) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Categories, relations and dynamic programming (Q4286530) (← links)
