@@ -54,27 +54,6 @@ KmerPosition<T, IncludeAdjacentSeq> *initKmerPositionMemory(size_t size) {
54
54
return hashSeqPair;
55
55
}
56
56
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
- }
77
-
78
57
template <int TYPE, typename T, bool IncludeAdjacentSeq>
79
58
std::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){
80
59
size_t offset = 0 ;
@@ -1039,6 +1018,7 @@ int kmermatcherInner(Parameters& par, DBReader<unsigned int>& seqDbr) {
1039
1018
}
1040
1019
MPI_Barrier (MPI_COMM_WORLD);
1041
1020
if (mpiRank == 0 ){
1021
+ std::string splitBufferName;
1042
1022
for (size_t split = 0 ; split < splits; split++) {
1043
1023
std::string splitFileName = par.db2 + " _split_" +SSTR (split);
1044
1024
splitFiles.push_back (splitFileName);
0 commit comments