Home
last modified time | relevance | path

Searched refs:bestBin (Results 1 – 5 of 5) sorted by relevance

/dports/biology/checkm/CheckM-1.0.18/checkm/
H A DbinUnion.py140 for i, bestBin in enumerate(bestCandidates):
141 overlap = current.numBasesOverlapping(bestBin)
142 fiftyPercentBest = 0.5 * bestBin.numBases()
145 …ogger.debug("Comparing best bin %s and current bin %s, overlap is %i" % (bestBin.binId, current.bi…
150 if current.compContSquaredScored() > bestBin.compContSquaredScored():
161 … bestBin.binId,
163 … bestBin.numBases(),
/dports/biology/mothur/mothur-1.46.1/source/
H A Dopticluster.cpp106 double bestBin, bestTp, bestTn, bestFn, bestFp; in update() local
114 …bestMetric = metric->getValue(tp, tn, fp, fn); bestBin = binNumber; bestTp = tp; bestTn = tn; best… in update()
123 bestBin = -1; bestTp = tp; bestTn = tn; bestFp = fp; bestFn = fn; in update()
140 …if (newMetric > bestMetric) { bestMetric = newMetric; bestBin = (*it); bestTp = tp; bestTn = tn; b… in update()
144 if (bestBin == -1) { bestBin = insertLocation; usedInsert = true; } in update()
146 if (bestBin != binNumber) { in update()
150 bins[bestBin].push_back(seqNumber); //add seq to bestbin in update()
157 seqBin[seqNumber] = bestBin; //set new OTU location in update()
H A Doptifitcluster.cpp130 vector<long long> bestBin; bestBin.resize(2, binNumber); in update() local
167 … bestBin[1] = -1; bestTp[1] = tp[1]; bestTn[1] = tn[1]; bestFp[1] = fp[1]; bestFn[1] = fn[1]; in update()
170 … bestBin[0] = -1; bestTp[0] = tp[0]; bestTn[0] = tn[0]; bestFp[0] = fp[0]; bestFn[0] = fn[0]; in update()
214 …bestMetric[0] = newFitMetric; bestBin[0] = (*it); bestTp[0] = tp[0]; bestTn[0] = tn[0]; bestFp[0] … in update()
215 …bestMetric[1] = newComboMetric; bestBin[1] = (*it); bestTp[1] = tp[1]; bestTn[1] = tn[1]; bestFp[1… in update()
221 long long newBin = bestBin[1]; in update()
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/xfeatures2d/src/
H A Dmsd.cpp585 int bestBin = -1; in computeOrientation() local
592 bestBin = i; in computeOrientation()
596 int l = (bestBin == 0) ? nBins - 1 : bestBin - 1; in computeOrientation()
597 int r = (bestBin + 1) % nBins; in computeOrientation()
598 …float bestAngle2 = bestBin + 0.5f * ((hist[l]) - (hist[r])) / ((hist[l]) - 2.0f * (hist[bestBin]) … in computeOrientation()
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-clustering/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/subspace/
H A DP3C.java192 int bestBin = chiSquaredUniformTest(parts, marked, card); in run() local
193 if(bestBin < 0) { in run()
196 BitsUtil.setI(marked, bestBin); in run()