- 23 May, 2019 6 commits
-
-
Mikaël Salson authored
Merge branch 'feature-c/3488-decalage-de-la-sequence-du-cdr3-et-de-la-jonction-dans-la-fenetre-info' into 'dev' Resolve "Décalage de la séquence du CDR3 et de la jonction dans la fenêtre info" Closes #3488 See merge request !471
-
Mathieu Giraud authored
Resolve "Avoir des germline de poulet" Closes #3910 See merge request !470
-
Mathieu Giraud authored
link to #3910
-
Thonier Florian authored
link to #3910
-
Thonier Florian authored
Link to #3910
-
Thonier Florian authored
link to #3910
-
- 22 May, 2019 3 commits
-
-
Mathieu Giraud authored
doc/vidjil-algo.md: productivity discordance + server See merge request !475
-
Mathieu Giraud authored
-
Mathieu Giraud authored
-
- 21 May, 2019 1 commit
-
-
Mathieu Giraud authored
See #2526.
-
- 17 May, 2019 3 commits
-
-
Thonier Florian authored
link to #3488
-
Mikaël Salson authored
Release 2019.05 See merge request !473
-
Mathieu Giraud authored
see #3914
-
- 16 May, 2019 7 commits
-
-
Mathieu Giraud authored
see #3914
-
Mathieu Giraud authored
core/representative.h, vidjil.cpp: RandomScore by default See merge request !464
-
Mikaël Salson authored
-
Mikaël Salson authored
It will depend on the order in which reads are coming when computing the representative but this order is random. What is important is that we find a representative of the correct length with the correct sequence whatever the read name and read positions are.
-
Mikaël Salson authored
It is hard to predict the result is not totally deterministic (as is the case with the RandomScorer, which is now by default, whose results depend on the pseudo-random generator that may differ depending on the OSes) See #3866
-
Mathieu Giraud authored
see #3866
-
Mathieu Giraud authored
see #3866
-
- 15 May, 2019 4 commits
-
-
Thonier Florian authored
link to #3488
-
Thonier Florian authored
link to #3488
-
Thonier Florian authored
link to #3488
-
Thonier Florian authored
link to #3488
-
- 26 Apr, 2019 10 commits
-
-
Mikaël Salson authored
Feature a/3206 rename and merge should Closes #3762 See merge request !467
-
Mathieu Giraud authored
Optimizations, including e-value computations, max12 See merge request !468
-
Mikaël Salson authored
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)
-
Mikaël Salson authored
This prevents from recomputing it each time
-
Mikaël Salson authored
-
Mikaël Salson authored
This is needed now that we use an unordered_map with a KmerAffect (see previous commit) as explained here: https://stackoverflow.com/questions/17016175/c-unordered-map-using-a-custom-class-type-as-the-key
-
Mikaël Salson authored
max12() actually didn't require a CountKmerAffectAnalyser. The CountKmerAffectAnalyser builds a data structure to improve KmerAffect counting at any position. But this was not needed for the max12() function
-
Mikaël Salson authored
We absolutely don't need to call getDistinctAffectations to destroy the objects
-
Mikaël Salson authored
-
Mikaël Salson authored
-
- 19 Apr, 2019 6 commits
-
-
Mathieu Giraud authored
Closes #3762.
-
Mathieu Giraud authored
see #3762
-
Mathieu Giraud authored
see #3762
-
Mathieu Giraud authored
See #3762. We have --extra
-
Mathieu Giraud authored
-
Mathieu Giraud authored
see #3206
-