Commit c00c47d4 authored by Joao @ backup server 228's avatar Joao @ backup server 228

Sorry, I forgot to make 'git pull' before commiting my changes!

Merge branch 'feature-sc/spike-normalization' of https://gitlab.inria.fr/vidjil/vidjil into feature-sc/spike-normalization
parents 26ceae24 4552a2e1
Pipeline #82073 failed with stages
in 5 seconds
#include "affectanalyser.h" #include "affectanalyser.h"
#include <algorithm>
#include <unordered_map>
bool operator==(const affect_infos &ai1, const affect_infos &ai2) { bool operator==(const affect_infos &ai1, const affect_infos &ai2) {
return ai1.first_pos_max == ai2.first_pos_max return ai1.first_pos_max == ai2.first_pos_max
...@@ -312,6 +314,33 @@ int KmerAffectAnalyser::last(const KmerAffect &affect) const{ ...@@ -312,6 +314,33 @@ int KmerAffectAnalyser::last(const KmerAffect &affect) const{
} }
pair <KmerAffect, KmerAffect> KmerAffectAnalyser::max12(const set<KmerAffect> forbidden) const {
pair<KmerAffect, int> max_counts[2] = {make_pair(KmerAffect::getUnknown(), -1),
make_pair(KmerAffect::getUnknown(), -1)};
std::unordered_map<KmerAffect, int> counts;
for (KmerAffect affect: affectations) {
if (forbidden.count(affect) == 0) {
if (counts.count(affect) > 0)
counts[affect]++;
else
counts[affect] = 1;
}
}
for (auto it: counts) {
if (it.second > max_counts[1].second) {
if (it.second > max_counts[0].second) {
max_counts[1] = max_counts[0];
max_counts[0] = it;
} else {
max_counts[1] = it;
}
}
}
return make_pair(max_counts[0].first, max_counts[1].first);
}
string KmerAffectAnalyser::toString() const{ string KmerAffectAnalyser::toString() const{
string kmer; string kmer;
for (size_t i = 0; i < affectations.size(); i++) { for (size_t i = 0; i < affectations.size(); i++) {
...@@ -349,12 +378,8 @@ CountKmerAffectAnalyser::CountKmerAffectAnalyser(IKmerStore<KmerAffect> &kms, co ...@@ -349,12 +378,8 @@ CountKmerAffectAnalyser::CountKmerAffectAnalyser(IKmerStore<KmerAffect> &kms, co
CountKmerAffectAnalyser::~CountKmerAffectAnalyser() { CountKmerAffectAnalyser::~CountKmerAffectAnalyser() {
set<KmerAffect> affects = this->getDistinctAffectations(); for (auto it : counts) {
delete [] it.second;
/* Initialize each key with a 0-integer array */
for (set<KmerAffect>::iterator it = affects.begin();
it != affects.end(); it++) {
delete [] counts[*it];
} }
} }
...@@ -390,38 +415,6 @@ KmerAffect CountKmerAffectAnalyser::max(const set<KmerAffect> forbidden) const { ...@@ -390,38 +415,6 @@ KmerAffect CountKmerAffectAnalyser::max(const set<KmerAffect> forbidden) const {
return max_affect; return max_affect;
} }
pair <KmerAffect, KmerAffect> CountKmerAffectAnalyser::max12(const set<KmerAffect> forbidden) const {
map<KmerAffect, int* >::const_iterator it = counts.begin();
KmerAffect max1_affect = KmerAffect::getUnknown();
KmerAffect max2_affect = KmerAffect::getUnknown();
int max1_count = -1;
int max2_count = -1;
for (; it != counts.end(); it++) {
if (forbidden.count(it->first) == 0) {
int current_count = count(it->first);
if (current_count > max1_count)
{
max2_affect = max1_affect ;
max2_count = max1_count ;
max1_affect = it->first ;
max1_count = current_count ;
}
else if (current_count > max2_count)
{
max2_affect = it->first;
max2_count = current_count;
}
}
}
return make_pair(max1_affect, max2_affect);
}
int CountKmerAffectAnalyser::countBefore(const KmerAffect&affect, int pos) const { int CountKmerAffectAnalyser::countBefore(const KmerAffect&affect, int pos) const {
if (pos == 0 || counts.count(affect) == 0) if (pos == 0 || counts.count(affect) == 0)
return 0; return 0;
......
...@@ -121,6 +121,14 @@ class AffectAnalyser { ...@@ -121,6 +121,14 @@ class AffectAnalyser {
*/ */
virtual int last(const KmerAffect &affect) const = 0; virtual int last(const KmerAffect &affect) const = 0;
/*
* @return the two affectations that are seen the most frequently in the sequence
* taken apart the forbidden ones.
* @complexity n + m log m where n is the input sequence length and m the number
* of affectations
*/
virtual pair <KmerAffect, KmerAffect> max12(const set<KmerAffect> forbidden) const = 0;
/** /**
* @return a string representation of the object * @return a string representation of the object
*/ */
...@@ -222,6 +230,8 @@ class KmerAffectAnalyser: public AffectAnalyser { ...@@ -222,6 +230,8 @@ class KmerAffectAnalyser: public AffectAnalyser {
int last(const KmerAffect &affect) const ; int last(const KmerAffect &affect) const ;
pair <KmerAffect, KmerAffect> max12(const set<KmerAffect> forbidden) const;
string toString() const; string toString() const;
string toStringValues() const; string toStringValues() const;
...@@ -302,12 +312,6 @@ class CountKmerAffectAnalyser: public KmerAffectAnalyser { ...@@ -302,12 +312,6 @@ class CountKmerAffectAnalyser: public KmerAffectAnalyser {
*/ */
KmerAffect max(const set<KmerAffect> forbidden = set<KmerAffect>()) const; KmerAffect max(const set<KmerAffect> forbidden = set<KmerAffect>()) const;
/*
* @return the two affectations that are seen the most frequently in the sequence
* taken apart the forbidden ones.
*/
pair <KmerAffect, KmerAffect> max12(const set<KmerAffect> forbidden) const;
/** /**
* Set the overlap allowed between two k-mers with two different affectations, * Set the overlap allowed between two k-mers with two different affectations,
* when looking for the maximum. * when looking for the maximum.
......
...@@ -24,6 +24,7 @@ class AbstractACAutomaton: public IKmerStore<Info> { ...@@ -24,6 +24,7 @@ class AbstractACAutomaton: public IKmerStore<Info> {
protected: protected:
void *initialState; void *initialState;
float all_index_load;
map<Info, size_t> kmers_inserted; map<Info, size_t> kmers_inserted;
public: public:
AbstractACAutomaton(); AbstractACAutomaton();
......
...@@ -15,16 +15,16 @@ void AbstractACAutomaton<Info>::finish_building() { ...@@ -15,16 +15,16 @@ void AbstractACAutomaton<Info>::finish_building() {
IKmerStore<Info>::finish_building(); IKmerStore<Info>::finish_building();
build_failure_functions(); build_failure_functions();
} }
all_index_load = 0;
for(auto iter: kmers_inserted) {
all_index_load += getIndexLoad(iter.first);
}
} }
template<class Info> template<class Info>
float AbstractACAutomaton<Info>::getIndexLoad(Info kmer) const { float AbstractACAutomaton<Info>::getIndexLoad(Info kmer) const {
float load = 0;
if (kmers_inserted.count(kmer) == 0) { if (kmers_inserted.count(kmer) == 0) {
for(auto iter: kmers_inserted) { return (kmer.isUnknown()) ? 1 - all_index_load : all_index_load;
load += getIndexLoad(iter.first);
}
return (kmer.isUnknown()) ? 1 - load : load;
} else { } else {
return kmers_inserted.at(kmer) / pow(4.0, kmer.getLength()); return kmers_inserted.at(kmer) / pow(4.0, kmer.getLength());
} }
......
...@@ -126,6 +126,7 @@ BioReader::BioReader(bool virtualfasta, string name) ...@@ -126,6 +126,7 @@ BioReader::BioReader(bool virtualfasta, string name)
init(0, ""); init(0, "");
this -> name = name; this -> name = name;
basename = extract_basename(name); basename = extract_basename(name);
filenames.push_back(this->name);
} }
BioReader::BioReader(int extract_field, string extract_separator, int mark_pos) BioReader::BioReader(int extract_field, string extract_separator, int mark_pos)
...@@ -157,6 +158,7 @@ void BioReader::add(const string &filename, bool verbose) { ...@@ -157,6 +158,7 @@ void BioReader::add(const string &filename, bool verbose) {
name += filename; name += filename;
basename += extract_basename(filename); basename += extract_basename(filename);
filenames.push_back(name);
if (verbose) if (verbose)
cout << " <== " << filename ; cout << " <== " << filename ;
......
...@@ -189,6 +189,7 @@ public: ...@@ -189,6 +189,7 @@ public:
string name; string name;
string basename; string basename;
list<string> filenames;
int size() const; int size() const;
size_t totalSize() const; size_t totalSize() const;
......
...@@ -174,6 +174,17 @@ bool operator>=(const KmerAffect &a1, const KmerAffect &a2); ...@@ -174,6 +174,17 @@ bool operator>=(const KmerAffect &a1, const KmerAffect &a2);
bool operator!=(const KmerAffect &a1, const KmerAffect &a2); bool operator!=(const KmerAffect &a1, const KmerAffect &a2);
ostream &operator<<(ostream &os, const KmerAffect &kmer); ostream &operator<<(ostream &os, const KmerAffect &kmer);
namespace std {
template <>
struct hash<KmerAffect> {
size_t operator()(const KmerAffect &affect) const {
return (affect.getLabel()[0] << 8) | affect.getLength();
}
};
}
#define AFFECT_NOT_UNKNOWN_SYMBOL "*" #define AFFECT_NOT_UNKNOWN_SYMBOL "*"
#define AFFECT_AMBIGUOUS_SYMBOL "\0" #define AFFECT_AMBIGUOUS_SYMBOL "\0"
#define AFFECT_UNKNOWN_SYMBOL "\1" #define AFFECT_UNKNOWN_SYMBOL "\1"
......
...@@ -15,6 +15,7 @@ using namespace std; ...@@ -15,6 +15,7 @@ using namespace std;
typedef typedef
enum { KMER_INDEX, AC_AUTOMATON } IndexTypes; enum { KMER_INDEX, AC_AUTOMATON } IndexTypes;
#define MAX_PRECOMPUTED_PROBA 500 /* Precompute 500 probabilities for each index load */
class Kmer { class Kmer {
public: public:
unsigned int count; unsigned int count;
...@@ -74,6 +75,8 @@ protected: ...@@ -74,6 +75,8 @@ protected:
size_t nb_kmers_inserted; size_t nb_kmers_inserted;
size_t max_size_indexing; size_t max_size_indexing;
bool finished_building; bool finished_building;
map<float, vector<double> > precomputed_proba_with_system,
precomputed_proba_without_system;
public: public:
...@@ -149,7 +152,7 @@ public: ...@@ -149,7 +152,7 @@ public:
/** /**
* @return probability that the number of kmers is 'at_least' or more in a sequence of length 'length' * @return probability that the number of kmers is 'at_least' or more in a sequence of length 'length'
*/ */
double getProbabilityAtLeastOrAbove(T kmer, int at_least, int length) const; double getProbabilityAtLeastOrAbove(T kmer, int at_least, int length);
/** /**
* @return the value of k * @return the value of k
...@@ -199,6 +202,10 @@ public: ...@@ -199,6 +202,10 @@ public:
* @pre word.length() == this->k * @pre word.length() == this->k
*/ */
virtual T& operator[](seqtype& word) = 0; virtual T& operator[](seqtype& word) = 0;
protected:
void precompute_proba(float index_load);
}; };
template<class T> template<class T>
...@@ -366,17 +373,45 @@ int IKmerStore<T>::atMostMaxSizeIndexing(int n) const { ...@@ -366,17 +373,45 @@ int IKmerStore<T>::atMostMaxSizeIndexing(int n) const {
} }
template<class T> template<class T>
double IKmerStore<T>::getProbabilityAtLeastOrAbove(const T kmer, int at_least, int length) const { void IKmerStore<T>::precompute_proba(float index_load) {
precomputed_proba_with_system[index_load] = vector<double>(MAX_PRECOMPUTED_PROBA);
precomputed_proba_without_system[index_load] = vector<double>(MAX_PRECOMPUTED_PROBA);
vector<double> &pproba_with = precomputed_proba_with_system[index_load];
vector<double> &pproba_without = precomputed_proba_without_system[index_load];
pproba_with[0] = 1;
pproba_without[0] = 1;
for (int i = 1; i < MAX_PRECOMPUTED_PROBA; i++) {
pproba_with[i] = pproba_with[i - 1] * index_load;
pproba_without[i] = pproba_without[i - 1] * (1 - index_load);
}
}
template<class T>
double IKmerStore<T>::getProbabilityAtLeastOrAbove(const T kmer, int at_least, int length) {
if (at_least == 0) return 1.0; // even if 'length' is very small if (at_least == 0) return 1.0; // even if 'length' is very small
// n: number of kmers in the sequence // n: number of kmers in the sequence
int n = length - getS() + 1; int n = length - getS() + 1;
float index_load = getIndexLoad(kmer) ; float index_load = getIndexLoad(kmer) ;
if (! precomputed_proba_without_system.count(index_load)) {
precompute_proba(index_load);
}
double proba = 0; double proba = 0;
double probability_having_system = pow(index_load, at_least);
double probability_not_having_system = pow(1 - index_load, n - at_least); double probability_not_having_system;
double probability_having_system;
if (precomputed_proba_with_system.at(index_load).size() > (size_t)at_least)
probability_having_system = precomputed_proba_with_system.at(index_load)[at_least];
else
probability_having_system = pow(index_load, at_least);
if (precomputed_proba_without_system.at(index_load).size() > (size_t)n - at_least)
probability_not_having_system = precomputed_proba_without_system.at(index_load)[n-at_least];
else
probability_not_having_system = pow(1 - index_load, n - at_least);
for (int i=at_least; i<=n; i++) { for (int i=at_least; i<=n; i++) {
proba += nChoosek(n, i) * probability_having_system * probability_not_having_system; proba += nChoosek(n, i) * probability_having_system * probability_not_having_system;
probability_having_system *= index_load; probability_having_system *= index_load;
......
...@@ -14,7 +14,7 @@ using namespace std; ...@@ -14,7 +14,7 @@ using namespace std;
#define THRESHOLD_BAD_COVERAGE .5 /* Threshold below which the representatie #define THRESHOLD_BAD_COVERAGE .5 /* Threshold below which the representatie
coverage is considered bad */ coverage is considered bad */
static ReadQualityScore DEFAULT_READ_SCORE; static RandomScore DEFAULT_READ_SCORE;
/** /**
* Compute a representative sequence from a list of sequences. * Compute a representative sequence from a list of sequences.
......
...@@ -442,7 +442,6 @@ KmerSegmenter::KmerSegmenter(Sequence seq, Germline *germline, double threshold, ...@@ -442,7 +442,6 @@ KmerSegmenter::KmerSegmenter(Sequence seq, Germline *germline, double threshold,
info_extra = "seed"; info_extra = "seed";
segmented = false; segmented = false;
segmented_germline = germline ; segmented_germline = germline ;
system = germline->code; // useful ?
reversed = false; reversed = false;
because = NOT_PROCESSED ; // Cause of unsegmentation because = NOT_PROCESSED ; // Cause of unsegmentation
score = 0 ; score = 0 ;
...@@ -524,7 +523,7 @@ KmerSegmenter::KmerSegmenter(Sequence seq, Germline *germline, double threshold, ...@@ -524,7 +523,7 @@ KmerSegmenter::KmerSegmenter(Sequence seq, Germline *germline, double threshold,
|| (germline->seg_method == SEG_METHOD_MAX1U)) || (germline->seg_method == SEG_METHOD_MAX1U))
{ // Pseudo-germline, MAX12 and MAX1U { // Pseudo-germline, MAX12 and MAX1U
pair <KmerAffect, KmerAffect> max12 ; pair <KmerAffect, KmerAffect> max12 ;
CountKmerAffectAnalyser ckaa(*(germline->index), sequence); KmerAffectAnalyser ckaa = *kaa;
set<KmerAffect> forbidden; set<KmerAffect> forbidden;
......
...@@ -82,7 +82,7 @@ WindowsStorage *WindowExtractor::extract(OnlineBioReader *reads, ...@@ -82,7 +82,7 @@ WindowsStorage *WindowExtractor::extract(OnlineBioReader *reads,
stats[TOTAL_SEG_AND_WINDOW].insert(read_length) ; stats[TOTAL_SEG_AND_WINDOW].insert(read_length) ;
if (seg->isJunctionChanged()) if (seg->isJunctionChanged())
stats[SEG_CHANGED_WINDOW].insert(read_length); stats[SEG_CHANGED_WINDOW].insert(read_length);
stats_reads[seg->system].addScore(read_length); stats_reads[seg->segmented_germline->code].addScore(read_length);
if (out_segmented) { if (out_segmented) {
*out_segmented << *seg ; // KmerSegmenter output (V/N/J) *out_segmented << *seg ; // KmerSegmenter output (V/N/J)
......
...@@ -11,8 +11,8 @@ EXEC=$(SRC:.cpp=) ...@@ -11,8 +11,8 @@ EXEC=$(SRC:.cpp=)
OBJ=$(SRC:.cpp=.o) OBJ=$(SRC:.cpp=.o)
OTHER_SRC=$(wildcard unit-tests/*.cpp) OTHER_SRC=$(wildcard unit-tests/*.cpp)
LIB=../core/vidjil.a ../lib/lib.a LIB=../core/vidjil.a ../lib/lib.a
SHOULD=$(wildcard should-get-tests/*.should-get) $(wildcard bugs/*.should-get) SHOULD=$(wildcard should-get-tests/*.should) $(wildcard bugs/*.should)
SHOULD_LOG=$(SHOULD:.should-get=.tap) SHOULD_LOG=$(SHOULD:.should=.tap)
SHOULD_VDJ=$(wildcard should-vdj-tests/*.should-vdj.fa) SHOULD_VDJ=$(wildcard should-vdj-tests/*.should-vdj.fa)
SHOULD_VDJ_VDJ=$(SHOULD_VDJ:.should-vdj.fa=.1.vdj) SHOULD_VDJ_VDJ=$(SHOULD_VDJ:.should-vdj.fa=.1.vdj)
SHOULD_LOCUS=$(wildcard should-vdj-tests/*.should-locus.fa) SHOULD_LOCUS=$(wildcard should-vdj-tests/*.should-locus.fa)
......
!LAUNCH: $VIDJIL_DIR/$EXEC -c designations -g $VIDJIL_DIR/germline/homo-sapiens.g $VIDJIL_DATA/3344-bad-filtering.fa
$ Check that proper filtering is used
1: IGHV4-31.02
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -c designations -g $VIDJIL_DIR/germline/homo-sapiens.g $VIDJIL_DATA/3344-bad-filtering.fa
$ Check that proper filtering is used
1: IGHV4-31.02
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -c clones -z 2 -3 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta > /dev/null ; cat out/Stanford_S22.tsv !LAUNCH: $VIDJIL_DIR/$EXEC -c clones -z 2 -3 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta > /dev/null ; cat out/Stanford_S22.tsv
$ There are four lines, all with tabs $ There are four lines, all with tabs
4: 4:
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -c clones -z 2 -2 -3 -r 1 -g $VIDJIL_DIR/germline/homo-sapiens.g ../should-vdj-tests/Demo-X5.should-vdj.fa > /dev/null ; cat out/Demo-X5.should-vdj.tsv !LAUNCH: $VIDJIL_DIR/$EXEC -c clones -z 2 -2 -3 -r 1 -g $VIDJIL_DIR/germline/homo-sapiens.g ../should-vdj-tests/Demo-X5.should-vdj.fa > /dev/null ; cat out/Demo-X5.should-vdj.tsv
$ There are 15 = 1 + 14 lines, all with tabs $ There are 15 = 1 + 14 lines, all with tabs
15: 15:
......
!REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py !REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -r 1 -z 0 -w 60 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta ; python $VIDJIL_DIR/tools/fuse.py out/Stanford_S22.vidjil out/Stanford_S22.vidjil -o out/fused.data ; cat out/fused.data | python $VIDJIL_DIR/tools/format_json.py -1 !LAUNCH: $VIDJIL_DIR/$EXEC -r 1 -z 0 -w 60 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta ; python $VIDJIL_DIR/tools/fuse.py out/Stanford_S22.vidjil out/Stanford_S22.vidjil -o out/fused.data ; cat out/fused.data | python $VIDJIL_DIR/tools/format_json.py -1
$ Points list $ Points list
1:"original_names": \[".*data//Stanford_S22.fasta", ".*data//Stanford_S22.fasta"\] 1:"original_names": \[".*data//Stanford_S22.fasta", ".*data//Stanford_S22.fasta"\]
......
!REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py !REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -x 100 -r 1 -z 5 -w 60 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta ; python $VIDJIL_DIR/tools/vidjil-to-fasta.py -o out/S22.fasta out/Stanford_S22.vidjil ; !LAUNCH: $VIDJIL_DIR/$EXEC -x 100 -r 1 -z 5 -w 60 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta ; python $VIDJIL_DIR/tools/vidjil-to-fasta.py -o out/S22.fasta out/Stanford_S22.vidjil ;
!OUTPUT_FILE: out/S22.fasta !OUTPUT_FILE: out/S22.fasta
$ 5 representative sequences in the FASTA output file $ 5 representative sequences in the FASTA output file
......
!REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py !REQUIRES: python $VIDJIL_DIR/tools/check_python_version.py
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS --alternative-genes 3 -c designations -x 1 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta > /dev/null ; cat out/Stanford_S22.vidjil | python $VIDJIL_DIR/tools/format_json.py -1 !LAUNCH: $VIDJIL_DIR/$EXEC --alternative-genes 3 -c designations -x 1 -g $VIDJIL_DIR/germline/homo-sapiens.g:IGH $VIDJIL_DATA/Stanford_S22.fasta > /dev/null ; cat out/Stanford_S22.vidjil | python $VIDJIL_DIR/tools/format_json.py -1
$ Presence of alternative: $ Presence of alternative:
1: "3alt" 1: "3alt"
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -e 10 -z 0 -V $VIDJIL_DIR/germline/homo-sapiens/IGHV.fa -D $VIDJIL_DIR/germline/homo-sapiens/IGHD.fa -J $VIDJIL_DIR/germline/homo-sapiens/IGHJ.fa -s "######-######" $VIDJIL_DATA/Stanford_S22.fasta !LAUNCH: $VIDJIL_DIR/$EXEC -e 10 -z 0 -V $VIDJIL_DIR/germline/homo-sapiens/IGHV.fa -D $VIDJIL_DIR/germline/homo-sapiens/IGHD.fa -J $VIDJIL_DIR/germline/homo-sapiens/IGHJ.fa -s "######-######" $VIDJIL_DATA/Stanford_S22.fasta
$ Germlines are custom $ Germlines are custom
1: custom germlines 1: custom germlines
...@@ -26,7 +26,7 @@ $ First clone -- find the good number of reads ...@@ -26,7 +26,7 @@ $ First clone -- find the good number of reads
2:clone-001--.*--0000008 2:clone-001--.*--0000008
$ First clone -- find the good representative $ First clone -- find the good representative
1:clone-001--.*--lcl.FLN1FA001BQ9J5.1.-.88,232.-.4 1:GACAATTCCAAGAACACGCTGTACCTGCAAATGAACAGCCTGCGAGCCGAGGACACGGCCACCTATTACTGTACCCGGGAGGAACAATATAGCAGCTGGTACTTTGACTTCTGGGGCCAGGGGATCCTGGTCACCGTCTCCTCAG
$ First clone -- find the good coverage $ First clone -- find the good coverage
1:clone-001--.* 145 bp .62. of 232.0 bp. 1:clone-001--.* 145 bp .62. of 232.0 bp.
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS --analysis-cost '1, 2, 3, 4, 5' $VIDJIL_DATA/Stanford_S22.fasta !LAUNCH: $VIDJIL_DIR/$EXEC --analysis-cost '1, 2, 3, 4, 5' $VIDJIL_DATA/Stanford_S22.fasta
!EXIT_CODE: 1 !EXIT_CODE: 1
$Check that correct custom cost is used $Check that correct custom cost is used
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -g $VIDJIL_DIR/germline/homo-sapiens-isoforms.g -r 1 -e 0.1 $VIDJIL_DATA/erg_debre.fa !LAUNCH: $VIDJIL_DIR/$EXEC -g $VIDJIL_DIR/germline/homo-sapiens-isoforms.g -r 1 -e 0.1 $VIDJIL_DATA/erg_debre.fa
$ All sequences have been seen as different ERG recombinations $ All sequences have been seen as different ERG recombinations
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -g $VIDJIL_DIR/germline/homo-sapiens-isoforms.g -r 1 -e 0.1 $VIDJIL_DATA/ikaros_debre.fa !LAUNCH: $VIDJIL_DIR/$EXEC -g $VIDJIL_DIR/germline/homo-sapiens-isoforms.g -r 1 -e 0.1 $VIDJIL_DATA/ikaros_debre.fa
$ All sequences have been seen as unique clone $ All sequences have been seen as unique clone
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -g $VIDJIL_DIR/germline/homo-sapiens.g -c clones --all -3 $VIDJIL_DATA/segment_lec.fa !LAUNCH: $VIDJIL_DIR/$EXEC -g $VIDJIL_DIR/germline/homo-sapiens.g -c clones --all -3 $VIDJIL_DATA/segment_lec.fa
$ Extract up to 50bp windows (TRG) $ Extract up to 50bp windows (TRG)
1:windows up to 50bp 1:windows up to 50bp
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -e 1e-2 -y 0 -g $VIDJIL_DIR/germline/homo-sapiens-cd.g $VIDJIL_DATA/Stanford_S22.fasta !LAUNCH: $VIDJIL_DIR/$EXEC -e 1e-2 -y 0 -g $VIDJIL_DIR/germline/homo-sapiens-cd.g $VIDJIL_DATA/Stanford_S22.fasta
$ Do not segment any read with SEG_METHOD_ONE on homo-sapiens-cd.g $ Do not segment any read with SEG_METHOD_ONE on homo-sapiens-cd.g
1: CD .* -> .* 0 .* 0 1: CD .* -> .* 0 .* 0
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -c designations -3 -g $VIDJIL_DIR/germline/homo-sapiens.g:TRG $VIDJIL_DATA/cdr3-stopcodon.fa !LAUNCH: $VIDJIL_DIR/$EXEC -c designations -3 -g $VIDJIL_DIR/germline/homo-sapiens.g:TRG $VIDJIL_DATA/cdr3-stopcodon.fa
!OUTPUT_FILE: out/cdr3-stopcodon.vidjil !OUTPUT_FILE: out/cdr3-stopcodon.vidjil
$ Two identical junctions in JSON $ Two identical junctions in JSON
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -c designations -3 -E 1.0 -g $VIDJIL_DIR/germline ../should-vdj-tests/Demo-X5.should-vdj.fa !LAUNCH: $VIDJIL_DIR/$EXEC -c designations -3 -E 1.0 -g $VIDJIL_DIR/germline ../should-vdj-tests/Demo-X5.should-vdj.fa
$ Detects a CDR3 on regular V(D)J recombinations $ Detects a CDR3 on regular V(D)J recombinations
1: IGH SEG.* [{].*[}] 1: IGH SEG.* [{].*[}]
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS -g $VIDJIL_DIR/germline --all -2 $VIDJIL_DATA/2549.fa !LAUNCH: $VIDJIL_DIR/$EXEC -g $VIDJIL_DIR/germline --all -2 $VIDJIL_DATA/2549.fa
$ The KmerSegmenter segments the chimera on xxx germline (-2) $ The KmerSegmenter segments the chimera on xxx germline (-2)
1:unexpected .* -> .* 1 1:unexpected .* -> .* 1
......
!LAUNCH: $VIDJIL_DIR/$EXEC $VIDJIL_DEFAULT_OPTIONS --all -g $VIDJIL_DIR/germline -2 $VIDJIL_DATA/chimera-fake.fa !LAUNCH: $VIDJIL_DIR/$EXEC --all -g $VIDJIL_DIR/germline -2 $VIDJIL_DATA/chimera-fake.fa
$ The KmerSegmenter segments the three chimera reads on PSEUDO_MAX12 germline (-2) $ The KmerSegmenter segments the three chimera reads on PSEUDO_MAX12 germline (-2)