text: user2085: When counting canonical kmers, ie kmers in which both the forward and reverse complement of a sequence are treated as identical, how do kmer counting programs decide which kmer to use as the canonical sequence? Do they all work the same way?
  To investigate I made a string with GAGTGCGGAATACCACTCTT which contains all 16 possible 2mers. I then used kmc to figure out how they determine which kmer is used. Only the kmers in the filtered column below appeared. So, it looks like KMCs' 'canonical' kmers are the ones that first occur alphabetically.
  ╔════════════════╦═════╦════════════════════╦══════════╗
  ║ Possible Kmers ║ RCs ║ RC occurs earlier? ║ filtered ║
  ╠════════════════╬═════╬════════════════════╬══════════╣
  ║ TT             ║ AA  ║ YES                ║ TA       ║
  ║ TG             ║ CA  ║ YES                ║ GC       ║
  ║ TC             ║ GA  ║ YES                ║ GA       ║
  ║ TA             ║ TA  ║                    ║ CG       ║
  ║ GT             ║ AC  ║ YES                ║ CC       ║
  ║ GG             ║ CC  ║ YES                ║ CA       ║
  ║ GC             ║ GC  ║                    ║ AT       ║
  ║ GA             ║ TC  ║                    ║ AG       ║
  ║ CT             ║ AG  ║ YES                ║ AC       ║
  ║ CG             ║ CG  ║                    ║ AA       ║
  ║ CC             ║ GG  ║                    ║          ║
  ║ CA             ║ TG  ║                    ║          ║
  ║ AT             ║ AT  ║                    ║          ║
  ║ AG             ║ CT  ║                    ║          ║
  ║ AC             ║ GT  ║                    ║          ║
  ║ AA             ║ TT  ║                    ║          ║
  ╚════════════════╩═════╩════════════════════╩══════════╝
  
  Do all kmer counting programs use the same canonical kmers, and if so do you have documentation explaining this? I wasn't able to find anything in the papers for jellyfish or kmc. 
  
  user37: When a k-mer is identical to its reverse complement, both are canonical. Note that a canonical k-mer is a sequence, irrelevant to its position(s) in the input string. More precisely, give a string $s$, its canonical string is
  $$
  {\rm canonical}(s|h)=\left\{\begin{array}{ll}
  s & \mbox{if $h(s)<h(\overline{s})$}\\
  \overline{s} & \mbox{otherwise}\\
  \end{array}\right.
  $$
  where $\overline{s}$ is the Watson-Crick reverse complement of $s$ and $h$ is an arbitrary string hash function. In practice, we most often use 2-bit encoding as $h$. Order under such a hash function is equivalent to the lexicographical order.
  
original_text: 2085: <p>When counting canonical kmers, ie kmers in which both the forward and reverse complement of a sequence are treated as identical, how do kmer counting programs decide which kmer to use as the canonical sequence? Do they all work the same way?</p>
  
  <p>To investigate I made a string with <code>GAGTGCGGAATACCACTCTT</code> which contains all 16 possible 2mers. I then used <a href="https://github.com/refresh-bio/KMC" rel="noreferrer">kmc</a> to figure out how they determine which kmer is used. Only the kmers in the <code>filtered</code> column below appeared. So, it looks like KMCs' 'canonical' kmers are the ones that first occur alphabetically.</p>
  
  <pre><code>╔════════════════╦═════╦════════════════════╦══════════╗
  ║ Possible Kmers ║ RCs ║ RC occurs earlier? ║ filtered ║
  ╠════════════════╬═════╬════════════════════╬══════════╣
  ║ TT             ║ AA  ║ YES                ║ TA       ║
  ║ TG             ║ CA  ║ YES                ║ GC       ║
  ║ TC             ║ GA  ║ YES                ║ GA       ║
  ║ TA             ║ TA  ║                    ║ CG       ║
  ║ GT             ║ AC  ║ YES                ║ CC       ║
  ║ GG             ║ CC  ║ YES                ║ CA       ║
  ║ GC             ║ GC  ║                    ║ AT       ║
  ║ GA             ║ TC  ║                    ║ AG       ║
  ║ CT             ║ AG  ║ YES                ║ AC       ║
  ║ CG             ║ CG  ║                    ║ AA       ║
  ║ CC             ║ GG  ║                    ║          ║
  ║ CA             ║ TG  ║                    ║          ║
  ║ AT             ║ AT  ║                    ║          ║
  ║ AG             ║ CT  ║                    ║          ║
  ║ AC             ║ GT  ║                    ║          ║
  ║ AA             ║ TT  ║                    ║          ║
  ╚════════════════╩═════╩════════════════════╩══════════╝
  </code></pre>
  
  <p>Do all kmer counting programs use the same canonical kmers, and if so do you have documentation explaining this? I wasn't able to find anything in the papers for <code>jellyfish</code> or <code>kmc</code>. </p>
   37: <p>When a k-mer is identical to its reverse complement, both are canonical. Note that a canonical k-mer is a sequence, irrelevant to its position(s) in the input string. More precisely, give a string $s$, its <em>canonical string</em> is
  $$
  {\rm canonical}(s|h)=\left\{\begin{array}{ll}
  s &amp; \mbox{if $h(s)&lt;h(\overline{s})$}\\
  \overline{s} &amp; \mbox{otherwise}\\
  \end{array}\right.
  $$
  where $\overline{s}$ is the Watson-Crick reverse complement of $s$ and $h$ is an arbitrary string hash function. In practice, we most often use 2-bit encoding as $h$. Order under such a hash function is equivalent to the lexicographical order.</p>
  