Skip to main content
Fig. 1 | BMC Genomics

Fig. 1

From: A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms

Fig. 1

Illustration 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 }}\)g

Back to article page
\