Fig. 1From: A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organismsIllustration of the iterative algorithm to enumerate k-mer frequencies. For the k ′-mer \(\protect \phantom {\dot {i}\!}a_{1}\cdots a_{k^{\prime }}\), its two frequency slots with zero counts for nucleotides c and t are removed to obtain (k ′+1)-mers \(\protect \phantom {\dot {i}\!}a_{1}\cdots a_{k^{\prime }}\)a and \(\protect \phantom {\dot {i}\!}a_{1}\cdots a_{k^{\prime }}\)gBack to article page