The Sequence Alignment Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=External= * https://www.coursera.org/learn/algorithms-greedy/lecture/QJkyp/optimal-substructure * https://www.coursera.org/learn/algorithms-greedy/lecture/tNmae/a-dynamic-pro...") |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 3: | Line 3: | ||
* https://www.coursera.org/learn/algorithms-greedy/lecture/tNmae/a-dynamic-programming-algorithm | * https://www.coursera.org/learn/algorithms-greedy/lecture/tNmae/a-dynamic-programming-algorithm | ||
=Internal= | =Internal= | ||
* [[ | * [[Dynamic_Programming#Canonical_Use|Dynamic Programming]] | ||
=Overview= | |||
The algorithm performs O(1) work per subproblem. | |||
<font color='darkkhaki'>TODO</font> | |||
Latest revision as of 02:28, 30 November 2021
External
- https://www.coursera.org/learn/algorithms-greedy/lecture/QJkyp/optimal-substructure
- https://www.coursera.org/learn/algorithms-greedy/lecture/tNmae/a-dynamic-programming-algorithm
Internal
Overview
The algorithm performs O(1) work per subproblem.
TODO