Category

Dynamic programming

page 1

Levenshtein distance

computer science metric for string similarity

dynamic programming

problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively

knapsack problem

problem in combinatorial optimization

Bellman–Ford algorithm

algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative

Floyd–Warshall algorithm

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative

Markov decision process

mathematical model for sequential decision making under uncertainty

Needleman–Wunsch algorithm

Viterbi algorithm

longest common subsequence problem

the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible

curse of dimensionality

various phenomena that arise when analyzing and organizing data in high-dimensional spaces that do not occur in low-dimensional settings such as the three-dimensional physical space of everyday experience

subset sum problem

decision problem in computer science

Smith–Waterman algorithm

algorithm performs local sequence alignment

backward induction

process of reasoning backwards in time

dynamic time warping

algorithm for measuring similarity between two temporal sequences, which may vary in speed

longest increasing subsequence

algorithm to find the longest increasing subsequence in an array of numbers

an algorithm for parsing strings that belong to a given context-free language

Bellman equation

necessary condition for optimality associated with dynamic programming

longest common substring problem

problem of finding the longest string that is a substring of two or more strings

approximate string-matching algorithm

algorithm for finding strings that match a pattern approximately

matrix chain multiplication

optimization problem

feature of continuing on a new line when a line is full

Damerau–Levenshtein distance

string metric for measuring the edit distance between two sequences

Hamilton–Jacobi–Bellman equation

an optimality condition in optimal control theory

maximum subarray problem

the task of finding a contiguous subarray with the largest sum in a given array of numbers

Optimal substructure

property of a computational problem

forward–backward algorithm

hidden Markov model inference algorithm which computes the posterior marginals of all hidden state variables given a sequence of observations, making use of dynamic programming to make only 2 passes: one forward, one backward

Hirschberg's algorithm

optimal stopping

class of mathematical problems concerned with choosing an optimal time to take a particular action

partially observable Markov decision process

generalization of a Markov decision process