@@ -54,26 +54,6 @@ KmerPosition<T, IncludeAdjacentSeq> *initKmerPositionMemory(size_t size) {
5454 return hashSeqPair;
5555}
5656
57- void maskSequence (int maskMode, int maskLowerCase, float maskProb, Sequence &seq, int maskLetter, ProbabilityMatrix * probMatrix){
58- if (maskMode == 1 ) {
59- tantan::maskSequences ((char *)seq.numSequence ,
60- (char *)(seq.numSequence + seq.L ),
61- 50 /* options.maxCycleLength*/ ,
62- probMatrix->probMatrixPointers ,
63- 0.005 /* options.repeatProb*/ ,
64- 0.05 /* options.repeatEndProb*/ ,
65- 0.5 /* options.repeatOffsetProbDecay*/ ,
66- 0 , 0 ,
67- maskProb /* options.minMaskProb*/ , probMatrix->hardMaskTable );
68- }
69- if (maskLowerCase == 1 && (Parameters::isEqualDbtype (seq.getSequenceType (), Parameters::DBTYPE_AMINO_ACIDS) ||
70- Parameters::isEqualDbtype (seq.getSequenceType (), Parameters::DBTYPE_NUCLEOTIDES))) {
71- const char * charSeq = seq.getSeqData ();
72- for (int i = 0 ; i < seq.L ; i++) {
73- seq.numSequence [i] = (islower (charSeq[i])) ? maskLetter : seq.numSequence [i];
74- }
75- }
76- }
7757
7858template <int TYPE, typename T, bool IncludeAdjacentSeq>
7959std::pair<size_t , size_t > fillKmerPositionArray (KmerPosition<T, IncludeAdjacentSeq> * kmerArray, size_t kmerArraySize, DBReader<unsigned int > &seqDbr, Parameters & par, BaseMatrix * subMat, bool hashWholeSequence, size_t hashStartRange, size_t hashEndRange, size_t * hashDistribution){
@@ -1039,6 +1019,7 @@ int kmermatcherInner(Parameters& par, DBReader<unsigned int>& seqDbr) {
10391019 }
10401020 MPI_Barrier (MPI_COMM_WORLD);
10411021 if (mpiRank == 0 ){
1022+ std::string splitBufferName;
10421023 for (size_t split = 0 ; split < splits; split++) {
10431024 std::string splitFileName = par.db2 + " _split_" +SSTR (split);
10441025 splitFiles.push_back (splitFileName);
0 commit comments