An Introduction to Bioinformatics Algorithmswww.bioalgorithms.info LCS: Dynamic Programming Find the LCS of two strings Input: A weighted graph G with two distinct vertices, one labeled source one labeled sink Output: A longest path in G from source to sink Solve using an LCS edit graph with diagonals replaced with +1 edges
{}