/usr/share/hyphy/UserAddins/MeanPairwiseDivergenceSubset is in hyphy-common 2.2.6+dfsg-3build3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 | treeCount = Rows ("Tree");
if (treeCount > 0)
{
treeChoices = {treeCount,2};
for (k=0; k<treeCount; k=k+1)
{
GetString (treeID, Tree, k);
treeChoices [k][0] = treeID;
treeChoices [k][1] = "Tree " + treeID;
}
chosenTree = 0;
if (treeCount > 1)
{
ChoiceList (chosenTree, "Which tree?", 1, SKIP_NONE, treeChoices);
if (chosenTree < 0)
{
return;
}
}
fprintf (stdout, "Enter a regular expression to pick a subset of leaves: ");
fscanf (stdin, "String", regExp);
ExecuteCommands ("treeAVL2 = "+treeChoices[chosenTree][0] + " ^ 0;bn = BranchName("+treeChoices[chosenTree][0]+",-1);");
leafCount = 0;
matchedNodes = {};
for (k=0; k<Columns (bn)-1; k=k+1)
{
rem = bn[k] $ regExp;
if (rem[0]>=0)
{
leafCount = leafCount + 1;
rem = bn[k];
matchedNodes [rem] = 1;
}
}
multFactors = {};
for (k=1; k<Abs(treeAVL2); k=k+1)
{
aNode = treeAVL2[k];
aNodeName = aNode["Name"];
parentIndex = aNode["Parent"];
k2 = Abs(aNode["Children"]);
if (k2)
{
currentDepth = aNode["Below"];
multFactors[aNodeName] = currentDepth;
if (currentDepth > 0 && currentDepth < leafCount)
{
fprintf (stdout, "Tagged internal node ", aNodeName, "\n");
matchedNodes [aNodeName] = 1;
}
if (parentIndex > 0 && currentDepth < leafCount)
{
pInfo = treeAVL2[parentIndex];
pInfo ["Below"] = pInfo ["Below"] + currentDepth;
treeAVL2[parentIndex] = pInfo;
}
}
else
{
rem = aNodeName $ regExp;
if (rem[0] >= 0)
{
fprintf (stdout, "Matched leaf ", aNodeName, "\n");
multFactors[aNodeName] = 1;
pInfo = treeAVL2[parentIndex];
pInfo ["Below"] = pInfo ["Below"] + 1;
treeAVL2[parentIndex] = pInfo;
}
}
}
if (leafCount < 2)
{
fprintf (stdout, "\nERROR: only matched ", leafCount, " leaves, but needed at least 2.\n");
return 0;
}
fprintf (stdout, "\nMatched ", leafCount, " leaves.\n");
pKeys = Rows(multFactors);
for (k=0; k<Columns(pKeys); k=k+1)
{
aNodeName = pKeys[k];
multFactors[aNodeName] = multFactors[aNodeName] * (leafCount-multFactors[aNodeName]);
}
divInfo = computeTotalDivergence (treeChoices[chosenTree][0]);
pInfo = 2*divInfo[0]/leafCount/(leafCount-1);
currentDepth = divInfo[1]/(Abs(treeAVL2)-2);
fprintf (stdout, "Mean pairwise divergence for ",treeChoices[chosenTree][0], " is ", pInfo, "\n");
fprintf (stdout, "Mean branch length for ", treeChoices[chosenTree][0], " is ", currentDepth, "\n");
lf_Count = Rows ("LikelihoodFunction");
if (lf_Count > 0)
{
for (lf_ID = 0; lf_ID < lf_Count; lf_ID = lf_ID + 1)
{
GetString (treeID, LikelihoodFunction,lf_ID);
ExecuteCommands ("GetString(lfInfo,"+treeID+",-1);");
lfTrees = lfInfo["Trees"];
for (k = 0; k<Columns(lfTrees); k=k+1)
{
if (lfTrees[k] == treeChoices[chosenTree][0])
{
break;
}
}
if (k < Columns(lfTrees))
{
fprintf (stdout, "\nTree ",Columns(lfTrees)," is a part of likelihood function ", treeID, "\n");
global TreeScalerParameter = 1;
ExecuteCommands ("ClearConstraints("+treeChoices[chosenTree][0]+");");
mNodeNames = Rows (matchedNodes);
for (k2 = 0; k2 < Abs(matchedNodes); k2 = k2 + 1)
{
cte = "ReplicateConstraint (\"this1."+mNodeNames[k2]+".?:=TreeScalerParameter*this2."+mNodeNames[k2]+".?__\","+treeChoices[chosenTree][0]+","+treeChoices[chosenTree][0]+");\n";
ExecuteCommands(cte);
}
COVARIANCE_PRECISION = 0.95;
COVARIANCE_PARAMETER = "TreeScalerParameter";
ExecuteCommands ("CovarianceMatrix(cmx,"+treeID+");");
fprintf (stdout, "\nMultiplicative range ", cmx[0], "-", cmx[2], "\n");
fprintf (stdout, "Mean pairwise divergence: ", pInfo, " (", pInfo*cmx[0],",",pInfo*cmx[2],")\n");
fprintf (stdout, "Mean branch length divergence: ", currentDepth, " (", currentDepth*cmx[0],",",currentDepth*cmx[2],")\n");
}
}
}
}
/*---------------------------------------------------------*/
function computeTotalDivergence (treeID)
{
ExecuteCommands ("bNames = BranchName ("+treeID+",-1);");
ExecuteCommands ("bLen = BranchLength ("+treeID+",-1);");
sum = 0;
sum2 = 0;
for (k=0; k<Columns(bNames); k=k+1)
{
aNodeName = bNames[k];
sum = sum + bLen[k]*multFactors[aNodeName];
sum2 = sum2 + bLen[k]*(multFactors[aNodeName]>0);
}
return {{sum,sum2}};
}
|