Go to the SVN repository for this file.
124 inttotal = (
int)((
double)nrows * (((double)nrows-1)/2));
126 for(j=0; j<nrows; j++) {
129 for(k=j+1; k<nrows; k++) {
132 for(
i=0;
i<alignLen;
i++) {
136 if(Res1 == Res2 && Res1 != 0) {
151 count+= nrows - (j+1);
152pFunc(
count, total);
180 if(alignLen > 0.0) {
182p = 1.0 - p - 0.2*p*p;
int Max(int Val1, int Val2)
CharPtr * m_ppAlignedResidues
MultipleAlignment * m_maligns
bool GetResidueListsWithShifts()
int GetAlignmentLength(int row=0) const
void GetPercentIdentities(pProgressFunction pFunc)
virtual bool ComputeMatrix(pProgressFunction pFunc)
static const double MAX_DISTANCE
static const EDistMethod DIST_METHOD
static double GetKimuraDistance(int identities, int alignment_length)
DM_Identities(EScoreMatrixType type, int ext)
static double GetDistance(int identities, int alignment_length)
void initDMIdentities(EScoreMatrixType type, int nTermExt, int cTermExt)
ScoreMatrix * m_scoreMatrix
void(* pProgressFunction)(int Num, int Total)
#define END_NCBI_SCOPE
End previously defined NCBI scope.
#define END_SCOPE(ns)
End the previously defined scope.
#define BEGIN_NCBI_SCOPE
Define ncbi namespace.
#define BEGIN_SCOPE(ns)
Define a new scope.
unsigned int
A callback function used to compare two keys in a database.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4