"
Team:Alberta/Project/Modeling/MaxMinAvg
From 2009.igem.org
(Difference between revisions)
(New page: %Since FindMinimalGenomes.m finds an indefinite number of possible minimal genomes, the researcher is likely going to want to know %how small the smallest list is, and where in the cell...) |
Rpgguardian (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| - | %Since FindMinimalGenomes.m finds an indefinite number of possible minimal genomes, the researcher is likely going to want to know | + | %Since FindMinimalGenomes.m finds an indefinite number of possible minimal genomes, the researcher is likely going <br>to want to know |
| - | %how small the smallest list is, and where in the cell array that minimal genome is located (along with other statistical information). | + | %how small the smallest list is, and where in the cell array that minimal genome is located (along with other<br> statistical information). |
function [maxValue minValue avg] = MaxMinAvg(ArrayYeah) | function [maxValue minValue avg] = MaxMinAvg(ArrayYeah) | ||
Revision as of 19:53, 17 October 2009
%Since FindMinimalGenomes.m finds an indefinite number of possible minimal genomes, the researcher is likely going
to want to know %how small the smallest list is, and where in the cell array that minimal genome is located (along with other
statistical information). function [maxValue minValue avg] = MaxMinAvg(ArrayYeah) L=0; for u=1:length(ArrayYeah) L(u)=length(ArrayYeah{u}); end maxValue = max(L) [minValue minPosition] = min(L) avg = sum(L)/length(L)
