From: A fast parallel algorithm for finding the longest common sequence of multiple biosequences
TX1: | Â | Â |
---|---|---|
i | CH(i) | 0 1 2 3 4 5 6 |
1 | A | 4 4 4 4 6 6 - |
2 | C | 3 3 3 - - - - |
3 | G | 2 2 - - - - - |
4 | T | 1 5 5 5 5 - - |
TX2: | Â | Â |
i | CH(i) | 0 1 2 3 4 5 6 7 |
1 | A | 1 6 6 6 6 6 - - |
2 | C | 3 3 3 - - - - - |
3 | G | 5 5 5 5 5 - - - |
4 | T | 2 2 4 4 7 7 7 - |
TX3: | Â | Â |
i | CH(i) | 0 1 2 3 4 5 6 7 |
1 | A | 4 4 4 4 - - - - |
2 | C | 1 7 7 7 7 7 7 - |
3 | G | 3 3 3 - - - - - |
4 | T | 2 2 5 5 5 6 - - |