Skip to main content

Table 1 Arabidopsis thaliana genome: Optimal k for compressing chromosome U into the smallest C (in bytes)

From: A new algorithm for “the LCS problem” with application in compressing genome resequencing data

U k |C|
1 31–35 1086
2 16–1578 504
3 24–39 746
4 18 4418
5 19–91 433