From: A new algorithm for “the LCS problem” with application in compressing genome resequencing data
U | |U| | Our Scheme | GRS | GReEn | ||
---|---|---|---|---|---|---|
|C| | \(|\mathbb {L}(C)|\) | \(|\mathbb {P}(C)|\) | [20] | [21] | ||
1 | 30 427 671 | 1 086 | 963 | 1 037 | 715 | 1 551 |
2 | 19 698 289 | 504 | 584 | 605 | 385 | 937 |
3 | 23 459 830 | 746 | 759 | 803 | 2 989 | 1 097 |
4 | 18 585 056 | 4 555 | 2 507 | 3 156 | 1 951 | 2 356 |
5 | 26 975 502 | 433 | 502 | 520 | 604 | 618 |
Sum | 119 146 348 | 7 324 | 5 315 | 6 121 | 6 644 | 6 559 |