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 | 43 268 879 | 15 207 | 4 735 | 4 551 | 1 502 040 | 4 972 |
2 | 35 930 381 | 4 645 | 1 649 | 1 517 | 1 409 | 1 906 |
3 | 36 406 689 | 54 234 | 15 693 | 15 556 | 47 764 | 17 890 |
4 | 35 278 225 | 21 474 | 6 636 | 6 432 | 36 145 | 6 750 |
5 | 29 894 789 | 17 030 | 5 431 | 5 359 | 6 177 | 5 539 |
6 | 31 246 789 | 12 | 146 | 141 | 14 | 482 |
7 | 29 696 629 | 5 899 | 2 064 | 1 972 | 4 067 | 2 448 |
8 | 28 439 308 | 23 126 | 8 794 | 10 115 | 118 246 | 9 507 |
9 | 23 011 239 | 12 | 146 | 141 | 14 | 366 |
10 | 23 134 759 | 175 228 | 49 713 | 50 277 | 788 542 | 60 449 |
11 | 28 512 666 | 41 407 | 13 006 | 13 351 | 2 397 470 | 14 797 |
12 | 27 497 214 | 12 | 146 | 141 | 14 | 429 |
Sum | 372 317 567 | 358 286 | 108 159 | 109 553 | 4 901 902 | 125 535 |