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

Total bytes needed by our algorithm to compress the Arabidopsis thaliana genome, i.e. file size sum of symbols and triples
From: A new algorithm for “the LCS problem” with application in compressing genome resequencing data
Total bytes needed by our algorithm to compress the Arabidopsis thaliana genome, i.e. file size sum of symbols and triples