**
loadMatrix(
double**table_in,
char**labels,
int*size_in,
meSet*
S);
88 while(counter < argc)
90 switch(argv[counter][1])
94 if(
NULL!= argv[counter])
98fprintf(stderr,
"Error: -d flag requires argument.\n");
105 if(
NULL!= argv[counter])
109fprintf(stderr,
"Error: -o flag requires argument.\n");
116 if(
NULL!= argv[counter])
120fprintf(stderr,
"Error: -i flag requires argument.\n");
128 switch(argv[counter][0])
141fprintf(stderr,
"Unknown argument to -w option: please");
142fprintf(stderr,
" use (b)alanced or (O)LS\n");
149 switch(argv[counter][0])
162fprintf(stderr,
"Unknown argument to -b option: please");
163fprintf(stderr,
" use BME or GME\n");
170*numDataSets =
i= 0;
171 while(argv[counter][
i])
172*numDataSets = 10* (*numDataSets) + (argv[counter][
i++] -
'0');
177 switch(argv[counter][0])
194fprintf(stderr,
"Unknown argument to -s option: please");
195fprintf(stderr,
" use BME, GME, or none\n");
206fprintf(stderr,
"Usage: fastme -binostv\n");
207fprintf(stderr,
"-b specify method for building initial tree: ");
208fprintf(stderr,
"BME or GME(default).\n");
209fprintf(stderr,
"-i filename of distance matrix\n");
210fprintf(stderr,
"-n number of trees/matrices input (default = 1)\n");
211fprintf(stderr,
"-o filename for meTree output\n");
212fprintf(stderr,
"-s specify type of meTree swapping (NNIs): ");
213fprintf(stderr,
"(b)alanced, (O)LS, or (n)one. (Default is balanced.)\n");
214fprintf(stderr,
"-t (optional) filename of starting meTree topology\n");
216fprintf(stderr,
"-v for verbose output\n");
217fprintf(stderr,
"-w (b)alanced or (O)LS weights (if not doing NNIs on input topology) \n");
218fprintf(stderr,
"-help to get this message\n");
228 A= (
double**)
malloc(d*
sizeof(
double*));
229 for(
i=0;
i<d;
i++)
231 A[
i] = (
double*)
malloc(d*
sizeof(
double));
240 meTree*
fastme_run(
double** D_in,
intnumSpecies_in,
char**labels,
intbtype_in,
intwtype_in,
intntype_in)
248 meSet*species, *slooper;
259 intntype = ntype_in, btype = btype_in, wtype = wtype_in;
261numSpecies = numSpecies_in;
291 while( setCounter < numSets ) {
314 for(slooper = species;
NULL!= slooper; slooper = slooper->
secondNode)
318 for(slooper = species;
NULL!= slooper; slooper = slooper->
secondNode)
337 NNI(
T,
A,&nniCount);
361fprintf(stderr,
"Error in program: variable 'btype' has illegal ");
362fprintf(stderr,
"value %d.\n",btype);
367fprintf(stderr,
"Error in program: variable 'ntype' has illegal ");
368fprintf(stderr,
"value %d.\n",ntype);
383printf(
"Performed %d NNIs on data meSet %d\n",nniCount,setCounter);
void freeMatrix(double **D, int size)
void bNNI(meTree *T, double **avgDistArray, int *count)
void assignAllSizeFields(meTree *T)
void partitionSizes(meTree *T)
void compareSets(meTree *T, meSet *S, FILE *ofile)
void chooseSettings(int argc, char **argv, int *btype, int *ntype, int *wtype, int *numDataSets, char **filenames)
double ** initDoubleMatrix(int d)
void NewickPrintTree(meTree *T, FILE *ofile)
double ** loadMatrix(double **table_in, char **labels, int *size_in, meSet *S)
void NNI(meTree *T, double **avgDistArray, int *count)
meTree * loadNewickTree(FILE *ifile, int numLeaves)
meTree * BMEaddSpecies(meTree *T, meNode *v, double **D, double **A)
void assignBMEWeights(meTree *T, double **A)
double ** loadMatrixOLD(FILE *ifile, int *size, meSet *S)
meTree * GMEaddSpecies(meTree *T, meNode *v, double **D, double **A)
meTree * detrifurcate(meTree *T)
void assignOLSWeights(meTree *T, double **A)
void makeBMEAveragesTable(meTree *T, double **D, double **A)
void makeOLSAveragesTable(meTree *T, double **D, double **A)
char * NewickPrintTreeString(meTree *T)
meTree * fastme_run(double **D_in, int numSpecies_in, char **labels, int btype_in, int wtype_in, int ntype_in)
#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.
const struct ncbi::grid::netcache::search::fields::SIZE size
struct meSet * secondNode
struct meNode * firstNode
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