366 lines
No EOL
13 KiB
Matlab
366 lines
No EOL
13 KiB
Matlab
function [partition, logml, partitionSummary, logmldiff] = model_search_parallel(c, partition, orig_dist, roundTypes)
|
||
% This function clusters DNA alignment using "codon" model in Corander and Tang's
|
||
% paper: Bayesian analysis of population structure based on linked
|
||
% molecular information (2007), Mathematical Biosciences
|
||
% c: preprocessed data for the sequence alignment
|
||
% partition: initial partition of the individuals
|
||
% origdist: hamming distance between individuals, indexed by
|
||
% (1,2)(1,3)(14)...(2,3)(2,4).....(3,4)...(n-1,n)
|
||
% roundTypes: array of operation types
|
||
|
||
% Lu Cheng
|
||
% 15.12.2012
|
||
|
||
interactive = false;
|
||
|
||
global PARTITION;
|
||
global CQ_COUNTS;global SUM_CQ_COUNTS;
|
||
global SP_COUNTS;global SUM_SP_COUNTS;
|
||
global CQ_PRIOR; global SP_PRIOR;
|
||
global LOGML_TABLE;
|
||
global ADDITION_DIFFERENCE;
|
||
global REMOVAL_DIFFERENCE;
|
||
global JOIN_DIFFERENCE;
|
||
|
||
global LOC_SP_COUNTS;
|
||
global LOC_CQ_COUNTS;
|
||
|
||
clearGlobalVars;
|
||
|
||
nPOPS = length(unique(partition));
|
||
|
||
% PRIOR VALUES:
|
||
CQ_PRIOR = c.cqPrior;
|
||
SP_PRIOR = c.spPrior;
|
||
|
||
% Initialize PARTITION, **_COUNTS, SUM_**_COUNTS, alnMat
|
||
[sumCqCounts, cqCounts] = initialCounts2(partition, c.cqData, nPOPS, c.nMaxCqCodes);
|
||
[sumSpCounts, spCounts] = initialCounts2(partition, c.spData, nPOPS, c.nMaxSpCodes);
|
||
|
||
CQ_COUNTS = cqCounts; SUM_CQ_COUNTS = sumCqCounts;
|
||
SP_COUNTS = spCounts; SUM_SP_COUNTS = sumSpCounts;
|
||
|
||
PARTITION = partition;
|
||
[cliqcounts, sepcounts] = computeCounts(c.locCliques, c.locSeparators, nPOPS);
|
||
|
||
LOC_CQ_COUNTS = cliqcounts;
|
||
LOC_SP_COUNTS = sepcounts;
|
||
|
||
% alnMat = c.alnMat;
|
||
partitionSummary = -Inf*ones(30,2,nPOPS); % Tiedot 30 parhaasta partitiosta (npops ja logml)
|
||
partitionSummary(:,1,:) = zeros(30,1,nPOPS);
|
||
worstLogml = -Inf*ones(1, nPOPS); worstIndex = ones(1, nPOPS);
|
||
|
||
clear partition cqCounts sumCqCounts spCounts sumSpCounts
|
||
|
||
% Initialize LOGML_TABLE:
|
||
nINDS = c.nSeq;
|
||
LOGML_TABLE = zeros(nPOPS,1);
|
||
updateLogmlTable(1:nPOPS);
|
||
|
||
REMOVAL_DIFFERENCE = zeros(nINDS,1);
|
||
REMOVAL_DIFFERENCE(:,:) = nan;
|
||
ADDITION_DIFFERENCE = zeros(nINDS,nPOPS);
|
||
ADDITION_DIFFERENCE(:,:) = nan;
|
||
JOIN_DIFFERENCE = zeros(nPOPS, nPOPS);
|
||
JOIN_DIFFERENCE(:,:) = nan;
|
||
|
||
% ***********Doc:********************
|
||
% REMOVAL_DIFFERENCE(ind) tells the change in logml if ind is removed from
|
||
% its cluster. nan, if the cluster has changed, since the value was last
|
||
% calculated.
|
||
%
|
||
% ADDITION_DIFFERENCE(ind, pop) tells the change in logml if ind is added
|
||
% to cluster pop. nan, if the cluster has changed since the value was last
|
||
% calculated. Always nan, if pop is ind's own cluster.
|
||
%
|
||
% JOIN_DIFFERENCE(pop1,pop2) = tells the change in logml if pop1 and pop2
|
||
% are combined. nan, if either cluster has changed since the value was last
|
||
% calculated.
|
||
% ***********Doc end*****************
|
||
|
||
logml = computeTotalLogml;
|
||
|
||
disp('The beginning:');
|
||
% disp(['Partition: ' num2str(PARTITION')]);
|
||
disp(['Nclusters: ' num2str(length(unique(PARTITION)))]);
|
||
disp(['Log(ml*prior): ' num2str(logml)]);
|
||
disp(' ');
|
||
|
||
|
||
nnotEmptyPops = length(unique(PARTITION));
|
||
if logml>worstLogml(nnotEmptyPops);
|
||
[partitionSummary(:,:,nnotEmptyPops), added] = addToSummary(logml, ...
|
||
partitionSummary(:,:,nnotEmptyPops), worstIndex(nnotEmptyPops));
|
||
if (added==1)
|
||
[worstLogml(nnotEmptyPops), worstIndex(nnotEmptyPops)] = ...
|
||
min(partitionSummary(:,2,nnotEmptyPops));
|
||
end
|
||
end
|
||
|
||
% START SEARCH OF THE BEST PARTITION:
|
||
|
||
vipu = zeros(1,14);
|
||
if interactive
|
||
roundTypes = input('Input steps: ');
|
||
if ischar(roundTypes), roundTypes = str2num(roundTypes); end
|
||
end
|
||
ready = 0;
|
||
|
||
|
||
while ready ~= 1
|
||
|
||
% disp(['Performing steps: ' num2str(roundTypes)]);
|
||
|
||
for n = 1:length(roundTypes)
|
||
round = roundTypes(n);
|
||
moveCounter = 0;
|
||
|
||
if round==1 && vipu(1)==0 % move an individual to another population
|
||
|
||
% inds = randperm(nINDS);
|
||
inds = getMoveInds(orig_dist,nINDS); % get inds to be moved
|
||
|
||
for ind = inds(:)'
|
||
update_difference_tables(ind, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators, logml);
|
||
tmpDiff = REMOVAL_DIFFERENCE(ind) + ADDITION_DIFFERENCE(ind,:);
|
||
tmpDiff(PARTITION(ind)) = 0;
|
||
[maxChange, maxIndex] = max(tmpDiff);
|
||
if maxChange>1e-5
|
||
updateGlobalVariables(ind, maxIndex, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators);
|
||
% fprintf('moving from %d to %d.\n',PARTITION(ind),maxIndex)
|
||
logml = computeTotalLogml();
|
||
moveCounter = moveCounter+1;
|
||
vipu = zeros(1,14);
|
||
|
||
nnotEmptyPops = length(unique(PARTITION));
|
||
if logml>worstLogml(nnotEmptyPops);
|
||
[partitionSummary(:,:,nnotEmptyPops), added] = addToSummary(logml, ...
|
||
partitionSummary(:,:,nnotEmptyPops), worstIndex(nnotEmptyPops));
|
||
if (added==1)
|
||
[worstLogml(nnotEmptyPops), worstIndex(nnotEmptyPops)] = ...
|
||
min(partitionSummary(:,2,nnotEmptyPops));
|
||
end
|
||
end
|
||
end
|
||
end
|
||
if moveCounter==0, vipu(1)=1; end
|
||
disp(['Step 1: ' num2str(moveCounter) ' individuals were moved.']);
|
||
|
||
elseif round==2 && vipu(2)==0 % join two populations
|
||
|
||
update_join_difference(c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators, logml);
|
||
[maxChange, aux] = max(JOIN_DIFFERENCE(:));
|
||
[i1, i2] = ind2sub([nPOPS,nPOPS],aux);
|
||
|
||
if maxChange>1e-5
|
||
tmpInds = find(PARTITION==i1);
|
||
updateGlobalVariables(tmpInds, i2, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators);
|
||
logml = computeTotalLogml;
|
||
|
||
disp(['Step 2: Clusters ' num2str(i1) ' and ' num2str(i2) ' combined.']);
|
||
vipu = zeros(1,14);
|
||
|
||
nnotEmptyPops = length(unique(PARTITION));
|
||
if logml>worstLogml(nnotEmptyPops);
|
||
[partitionSummary(:,:,nnotEmptyPops), added] = addToSummary(logml, ...
|
||
partitionSummary(:,:,nnotEmptyPops), worstIndex(nnotEmptyPops));
|
||
if (added==1)
|
||
[worstLogml(nnotEmptyPops), worstIndex(nnotEmptyPops)] = ...
|
||
min(partitionSummary(:,2,nnotEmptyPops));
|
||
end
|
||
end
|
||
else
|
||
disp('Step 2: no changes.');
|
||
vipu(2)=1;
|
||
end
|
||
elseif ismember(round, 3:4) && vipu(round)==0 % Split a population, and move one subpopulation to another population
|
||
|
||
pops = randperm(nPOPS);
|
||
|
||
splitFlags = zeros(nPOPS,1);
|
||
for pop = pops(:)'
|
||
|
||
maxChange = 0;
|
||
indsToBeMoved = [];
|
||
|
||
inds2 = find(PARTITION==pop);
|
||
ninds2 = length(inds2);
|
||
if ninds2>4
|
||
|
||
if round==3
|
||
dist3 = getDistance(inds2, orig_dist, nINDS);
|
||
npops2 = min(20, floor(ninds2 / 5)); %Moneenko osaan jaetaan
|
||
elseif round==4
|
||
dist3 = getDistance(inds2, orig_dist, nINDS);
|
||
npops2 = 2;
|
||
end
|
||
|
||
Z3 = linkage(dist3);
|
||
T3 = cluster_own(Z3, npops2);
|
||
|
||
for i = 1:npops2
|
||
indsX = inds2(T3==i); indsX = indsX';
|
||
tmpChanges = calcLogmlChanges(indsX, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators, logml);
|
||
[tmpMaxChange, tmpMaxPop] = max(tmpChanges);
|
||
if tmpMaxChange>maxChange
|
||
maxChange = tmpMaxChange;
|
||
% i1 = pop;
|
||
i2 = tmpMaxPop;
|
||
indsToBeMoved = indsX;
|
||
end
|
||
end
|
||
if maxChange>1e-5
|
||
updateGlobalVariables(indsToBeMoved, i2, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators);
|
||
logml = computeTotalLogml;
|
||
splitFlags(pop)=1;
|
||
|
||
nnotEmptyPops = length(unique(PARTITION));
|
||
if logml>worstLogml(nnotEmptyPops);
|
||
[partitionSummary(:,:,nnotEmptyPops), added] = addToSummary(logml, ...
|
||
partitionSummary(:,:,nnotEmptyPops), worstIndex(nnotEmptyPops));
|
||
if (added==1)
|
||
[worstLogml(nnotEmptyPops), worstIndex(nnotEmptyPops)] = ...
|
||
min(partitionSummary(:,2,nnotEmptyPops));
|
||
end
|
||
end
|
||
end
|
||
end
|
||
end
|
||
if any(splitFlags)
|
||
disp(['Step ' num2str(round) ': ' num2str(sum(splitFlags)) ' populations were split.']);
|
||
vipu = zeros(1,14);
|
||
else
|
||
disp(['Step ' num2str(round) ': no changes.']);
|
||
vipu(round)=1;
|
||
end
|
||
end
|
||
end
|
||
|
||
if interactive
|
||
roundTypes = input('Input extra steps: ');
|
||
if ischar(roundTypes), roundTypes = str2num(roundTypes); end
|
||
else
|
||
roundTypes = [];
|
||
end
|
||
|
||
if isempty(roundTypes)
|
||
ready = 1;
|
||
end
|
||
end
|
||
|
||
%disp(' ');
|
||
disp('BEST PARTITION: ');
|
||
%disp(['Partition: ' num2str(PARTITION')]);
|
||
disp(['Nclusters: ' num2str(length(unique(PARTITION)))]);
|
||
disp(['Log(ml): ' num2str(logml)]);
|
||
disp(' ');
|
||
|
||
nPOPS= rmEmptyPopulation(c.locCliques, c.locSeparators);
|
||
ADDITION_DIFFERENCE(:) = NaN;
|
||
REMOVAL_DIFFERENCE(:) = NaN;
|
||
|
||
logmldiff = zeros(nINDS,nPOPS); % the change of logml if individual i is moved to group j
|
||
for i=1:nINDS
|
||
update_difference_tables(i, c.cqData, c.nMaxCqCodes, ...
|
||
c.spData, c.nMaxSpCodes, c.locCliques, c.locSeparators, logml);
|
||
logmldiff(i,:) = REMOVAL_DIFFERENCE(i)+ADDITION_DIFFERENCE(i,:);
|
||
if all(isnan(logmldiff(i,:)))
|
||
keyboard
|
||
end
|
||
end
|
||
logmldiff(isnan(logmldiff))=0;
|
||
partition = PARTITION;
|
||
|
||
|
||
|
||
|
||
%----------------------------------------------------------------------------
|
||
|
||
|
||
function [dist2, dind1, dind2] = getDistance(inds2, dist_orig, ninds)
|
||
% pick out the distrances between samples in "inds2" from "dist_orig"
|
||
% dist_orig specifies the distances of (1,2),(1,3),(1,4)......(ninds-1,ninds)
|
||
% Lu Cheng, 22.06.2011
|
||
|
||
if ~issorted(inds2)
|
||
error('inds2 is not in ascending order!');
|
||
end
|
||
|
||
ninds2 = length(inds2);
|
||
apu = zeros(nchoosek(ninds2,2),2);
|
||
irow = 1;
|
||
for i=1:ninds2-1
|
||
for j=i+1:ninds2
|
||
apu(irow, 1) = inds2(i);
|
||
apu(irow, 2) = inds2(j);
|
||
irow = irow+1;
|
||
end
|
||
end
|
||
|
||
dind1 = apu(:,1);
|
||
dind2 = apu(:,2);
|
||
|
||
apu = (apu(:,1)-1).*ninds - apu(:,1) ./ 2 .* (apu(:,1)-1) + (apu(:,2)-apu(:,1));
|
||
dist2 = dist_orig(apu);
|
||
|
||
|
||
%---------------------------------------------------------------
|
||
|
||
|
||
function inds = getMoveInds(dist_orig, ninds)
|
||
% get individual indexs to be moved to another cluster
|
||
% we always take the 30% individuals of each cluster which are most distant
|
||
% to each other
|
||
% Lu Cheng, 25.05.2011
|
||
|
||
global PARTITION;
|
||
|
||
pops = unique(PARTITION);
|
||
inds = [];
|
||
|
||
for tmpPop = pops(:)'
|
||
tmpInds = find(PARTITION == tmpPop)';
|
||
|
||
if(length(tmpInds)<20)
|
||
inds = [inds tmpInds(:)']; %#ok<AGROW>
|
||
continue;
|
||
end
|
||
|
||
[tmpDist, dind1, dind2] = getDistance(tmpInds,dist_orig,ninds);
|
||
tmpSDist = sort(tmpDist,'Descend');
|
||
tmpInds2 = find(tmpDist>tmpSDist(round(length(tmpSDist)*0.3)));
|
||
tmpInds3 = union(unique(dind1(tmpInds2)), unique(dind2(tmpInds2)));
|
||
inds = [inds tmpInds3(:)']; %#ok<AGROW>
|
||
end
|
||
|
||
|
||
|
||
|
||
|
||
% ------------------------------------------------------------
|
||
|
||
function [partitionSummary, added] = addToSummary(logml, partitionSummary, worstIndex)
|
||
% Tiedet<65><74>n, ett?annettu logml on isompi kuin huonoin arvo
|
||
% partitionSummary taulukossa. Jos partitionSummary:ss?ei viel?ole
|
||
% annettua logml arvoa, niin lis<69>t<EFBFBD><74>n worstIndex:in kohtaan uusi logml ja
|
||
% nykyist?partitiota vastaava nclusters:in arvo. Muutoin ei tehd?mit<69><74>n.
|
||
global PARTITION;
|
||
|
||
apu = find(abs(partitionSummary(:,2)-logml)<1e-5);
|
||
if isempty(apu)
|
||
% Nyt l<>ydetty partitio ei ole viel?kirjattuna summaryyn.
|
||
|
||
npops = length(unique(PARTITION));
|
||
partitionSummary(worstIndex,1) = npops;
|
||
partitionSummary(worstIndex,2) = logml;
|
||
added = 1;
|
||
else
|
||
added = 0;
|
||
end |