| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | consensus.h | 36 EXTERN cmatrix biparts; /* bipartitions of tree of current puzzling step */ variable
77 cmatrix biparts, /* out: split strings, edge by edge */
84 cmatrix biparts, /* out: splits */
|
| H A D | consensus.c | 38 biparts = new_cmatrix(Maxspc-3, Maxspc); in initconsensus()
63 cmatrix biparts, /* out: split strings, edge by edge */ in makepart() argument
67 biparts[curribrnch][edge[i].taxon] = '*'; in makepart()
70 makepart(edge[i].downleft->numedge, curribrnch, edge, edgeofleaf, biparts, Maxspc); in makepart()
84 cmatrix biparts, /* out: splits */ in computebiparts() argument
94 biparts[i][j] = '.'; in computebiparts()
101 makepart(i, curribrnch, edge, edgeofleaf, biparts, Maxspc); in computebiparts()
104 if (biparts[curribrnch][outgroup] == '.') { in computebiparts()
106 if (biparts[curribrnch][j] == '.') in computebiparts()
107 biparts[curribrnch][j] = '*'; in computebiparts()
[all …]
|
| H A D | puzzle.h | 213 EXTERN cmatrix biparts; /* bipartitions of tree of current puzzling step */
579 cmatrix biparts, /* out: split strings, edge by edge */
587 cmatrix biparts, /* out: splits */
|
| H A D | pstep-mrca.c | 577 biparts, outgroup, Maxspc); in allpstep()
579 makenewsplitentries(biparts, Maxspc-3, in allpstep()
|
| H A D | pstep-recursive.c | 577 biparts, outgroup, Maxspc); in allpstep()
579 makenewsplitentries(biparts, Maxspc-3, in allpstep()
|
| H A D | pstep-trueID.c | 597 biparts, outgroup, Maxspc); in allpstep()
599 makenewsplitentries(biparts, Maxspc-3, in allpstep()
|
| H A D | ppuzzle.h | 303 cmatrix *biparts,
|
| H A D | pstep-split.c | 725 biparts, outgroup, Maxspc); in allpstep_split()
727 makenewsplitentries(biparts, Maxspc-3, in allpstep_split()
|
| H A D | pstep.c | 795 biparts, outgroup, Maxspc); in allpstep()
797 makenewsplitentries(biparts, Maxspc-3, in allpstep()
|
| H A D | ppuzzle.c | 173 void PP_Printbiparts(cmatrix biparts) in PP_Printbiparts() argument
179 fprintf(STDOUT, "%c", biparts[n1][n2]); in PP_Printbiparts()
1715 cmatrix *biparts, in PP_SendSplitsBlock() argument
1745 …OUT, "(%2d) Sending: PP_bipartsblock(0..%lu,0,0)8=\"%c\"\n", PP_Myid, blocksize, biparts[0][0][0]); in PP_SendSplitsBlock()
1751 MPI_Address(&(biparts[n][0][0]), &(Dtypeaddr[n])); in PP_SendSplitsBlock()
|
| H A D | puzzle1.c | 4824 free_cmatrix(biparts);
6225 biparts[n1][n2] = '*';
6227 tree2bipart(biparts, &numsp);
6229 …makenewsplitentries(biparts, numsp, &splitpatterns, &splitsizes, &splitfreqs, &numbiparts, &maxbip…
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/ |
| H A D | ChangeLog | 699 sending all biparts in one message instead of one
|