Computing the Matching Graph (3)
0
-1
-2
-3
-4
-5
-6
-7
0
1 A
2 G
3 C
4 A
5 T
6 G
-1
2
1
0
-1
-2
-3
-4
-2
1
4
3
2
1
0
-1
-3
0
3
3
2
4
3
2
-4
-1
2
5
4
3
3
2
-5
-2
1
4
7
6
5
5
0 1 2 3 4 5 6 7
A G A T C G T
-6
-3
0
3
6
6
8
7
Previous slide
Next slide
Back to first slide
View graphic version