kmerseek docs
Interactive pages on how kmerseek scores a region and judges whether it could be chance. Every slider recomputes the equations and figures.
Part 1: How a kmerseek region gets an E-valueThe region score, the chance match rate, nats per score point, the E-value, and how K and r_database are measured when the index is built. Part 2: What two letters can carryThe copy rate, bits per position, the trade between alphabet size and region length, short motifs, summing several regions, and the best mismatch penalty. Part 3: What every alphabet can seeCed9, P66 and BHF searched against the human proteome with all 19 alphabets: where each alphabet ranks the known partner under five metrics, the seed information an E-value of 1 needs, and why many regions get no E-value.What a search looks like
C. elegans CED-9 searched against 25 human BCL-2-like proteins, hydrophobic/polar alphabet, k=12. The same pages scripts/visualize_search.py and scripts/visualize_pair.py write for any search.