Dynamic Programming

Longest Common Subsequence

Implements the dynamic programming solution to the longest common subsequence algorithm.

Pseudo Code: http://en.wikipedia.org/wiki/Longest_common_subsequence_problem

algorithms.dynamic_programming.lcs.build_lengths_matrix(str1, str2)[source]

XXX: Needs documentation written.

algorithms.dynamic_programming.lcs.lcs(str1, str2)[source]

XXX: Needs documentation written.

algorithms.dynamic_programming.lcs.read_from_matrix(matrix, str1, str2)[source]

XXX: Needs documentation written.