Skip to main content


Figure 5 | Algorithms for Molecular Biology

Figure 5

From: Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes

Figure 5

Recurrence: Case 2. y1 is generated from x i in a duplicate operation where y1 is not the last (rightmost) character in a copied substring (Case 2). In this case, xi+1is also copied in the same duplicate operation (top). Thus, the duplication distance is the sum of d(x, y2, j-1), the duplication distance for y2, j-1(bottom left), and di+1(x, yj, |y|), the minimum number of duplicate operations to generate yj, |y|given that xi+1generates y j (bottom right).

Back to article page