kmerstore.h: Precompute probability computations

Computing them for each read is time consuming.
But many of the are common (there are few different
index loads and the read length is small)
9 jobs for feature-a/some-optim in 35 minutes and 59 seconds (queued for 8 minutes and 44 seconds)
Status Job ID Name Coverage
  Test Tools
passed #315666
test_tools

00:00:06

 
  Test Unit
passed #315667
test_algo_unit

00:03:03

 
  Test Functional
passed #315668
test_algo_should

00:07:46

 
  Test Shouldvdj
passed #315669
test_algo_shouldvdj

00:16:32

 
  Coverage
passed #315670
algo_coverage

00:00:06

90.2%
 
  Prepare Release
manual #315671
allowed to fail manual
prepare_release
 
  Valgrind Unit
passed #315672
valgrind
algo_valgrind_unit

00:08:24

 
  Valgrind Functional
manual #315673
valgrind allowed to fail manual
algo_valgrind_functional
 
  Multiple Tests
manual #315674
several-compilers allowed to fail manual
test_various_compilers_manual