Searched refs:nOn1 (Results 1 – 1 of 1) sorted by relevance
| /dports/biology/fasttree/FastTree-2.1.10_5/ |
| H A D | FastTree-2.1.10.c | 1040 int SplitConstraintPenalty(int nOn1, int nOff1, int nOn2, int nOff2);
1097 double PairConstraintDistance(int nOn1, int nOff1, int nOn2, int nOff2);
4073 int nOn1 = p1->nOn[iC]; in JoinConstraintPenaltyPiece() local
4077 int nOnOut = pOut->nOn[iC] - nOn1 - nOn2; in JoinConstraintPenaltyPiece()
4080 if ((nOn1+nOff1) > 0 && (nOn2+nOff2) > 0 && (nOnOut+nOffOut) > 0) { in JoinConstraintPenaltyPiece()
4082 int code1 = (nOn1 > 0 && nOff1 > 0) ? -1 : (nOn1 > 0 ? 1 : 0); in JoinConstraintPenaltyPiece()
4122 double PairConstraintDistance(int nOn1, int nOff1, int nOn2, int nOff2) { in PairConstraintDistance() argument
4123 double f1 = nOn1/(double)(nOn1+nOff1); in PairConstraintDistance()
4169 int SplitConstraintPenalty(int nOn1, int nOff1, int nOn2, int nOff2) { in SplitConstraintPenalty() argument
4170 return(nOn1 + nOff2 < nOn2 + nOff1 ? in SplitConstraintPenalty()
[all …]
|