Skip to main content


Figure 3 | Algorithms for Molecular Biology

Figure 3

From: A basic analysis toolkit for biological sequences

Figure 3

an edit graph with fragments. An LCS from Fragments edit graph for the same strings as in Figure 2, where the fragments are the sequences of at least two diagonal edges of Figure 2. The bold path from (0, 0) to (6, 7) corresponds to a minimum-cost path under the Levenshtein edit distance.

Back to article page