<title>Background</title> <p>Metazoan cells have the ability to adopt an extraordinarily diverse spectrum of cell shapes. For example, the cuboidal, polarized morphology of epithelial cells differs markedly from that of neuronal cells, which extend long, thin, and highly-branched projections. The shape of an individual cell is the result of a complex interplay between the activity of thousands of genes and the cell's environment. Understanding this interplay is a fundamental challenge in developmental and cell biology. Currently, there are two key aspects to deciphering cellular morphogenesis on genome-scale. The first is determining the individual functional contributions of every gene towards the regulation of cell shape, and the second is to describe how complex relationships between cell shape genes affect morphology. With the advent of high-throughput RNA interference (RNAi) screening technologies, particularly in model systems such as <italic>Drosophila melanogaster </italic>[##REF##17244760##1##], it is now possible to systematically query the involvement of genes in the regulation of different cellular processes and functions. Typically, RNAi-based genetic screens involve the acquisition of relatively low-content, single-dimensional data which is easily analyzed using conventional and unbiased means and thus feasible to perform on genome, or multi-genome scales [##REF##17244760##1##,##REF##17086199##2##]. In order to facilitate similar analysis of image-based screens, we and other researchers have recently developed novel image segmentation algorithms to rapidly quantitate hundreds of different parameters at a single-cell level in an automated fashion [##UREF##0##3##, ####UREF##1##4##, ##REF##17444941##5##, ##REF##18270043##6####18270043##6##], and we have demonstrated that such image segmentation algorithms can be used in the context of genetic screens [##REF##17588932##7##]. Notably however, this and other similar screens [##REF##15539606##8##] have been 50–100 fold smaller in scale than typical low-dimensional screens and are not yet genome-scale. The reduced scale of these screens is due, largely in part, to the fact that the expert opinion of cell biologists is still an essential and rate-limiting aspect in the analysis of many image-based datasets. Although human intervention is not required in screens where the potential phenotypic outcomes are few or binary in number (e.g. an image-based screen where a particular marker is determined to be nuclear or non-nuclear), such intervention is currently necessary in order to identify novel/subtle phenotypes in image-based datasets of genetic or chemical perturbations where the dynamic range of cellular phenotypes cannot be predicted before the data is collected. For example, in genome-scale screens for regulators of cell shape, it is impossible to predict <italic>a priori </italic>the diversity of morphologies that will ultimately be present in the dataset. The failure to accurately measure this phenotypic variation will lead to concomitant classification errors, especially false negatives, and misleading results. Current methodologies usually employ a two-step procedure to maximize the amount of variation that is captured in a particular image-based analysis. <italic>First</italic>, 100–600 phenotypic features are measured on a single-cell level (automatically but somehow exhaustively), and <italic>second</italic>, supervised techniques assisted by biologists are used to both reduce dimensionality of feature space and carrying out classification on the images. The biologist has to at least perform preliminary qualitative visual scoring of a small part of the dataset in order to gain a crude assessment of the phenotypic variance that is present in this subset. Unfortunately, it is impossible to perform such analysis in the course of screens where millions of images are acquired, thus the ability of these screens to identify new phenotypes is greatly limited. The issues of defining meaningful phenotypes and describing them using informative feature subsets are closely related. Automated feature space reduction schemes have been implemented in the context of high content screen, including feature extraction methods examined in [##UREF##2##9##], factor analysis in [##REF##18066055##10##] and SVM-RFE method in [##REF##17401369##11##]. These methods allow more effective modelling of existing phenotypes, and also prompt the necessity of updating informative feature sets so that they can not only model the existing, but also discover the novel.</p> <p>Cluster analysis is widely used to reveal the structure of unlabeled datasets. Specifically, there are a number of methods that have been developed in order to estimate cluster numbers from a dataset such as using a series of internal indices [##UREF##3##12##], jump methods [##UREF##4##13##], and weighted gap statistics [##REF##17425640##14##]. Moreover, supervised approaches to cluster validation such as using re-sampling strategy [##REF##12184810##15##], prediction strength [##UREF##5##16##], methods based on mixture models and inference of Bayesian factors[##REF##18244472##17##,##UREF##6##18##], or strategies which are application-specific [##REF##12724291##19##] have also been previously implemented. Nevertheless, most existing methods are subject to certain hypothesis on a fixed dataset, and cannot be directly used for online phenotype discovery where new images continuously extend the dataset and millions of cells are involved. Improper assumptions on data structure may cause incorrect division or merging of biologically meaningful phenotypes. To avoid this problem, such methods combine each new image with the whole existing dataset (regardless of the large difference in cell numbers) and frequently re-run from the very beginning.</p> <p>Methods for online phenotype discovery should be sensitive and flexible to various phenotypes and avoid frequent re-modelling involving complete existing datasets. As a kernel machine based novelty detection method, one-class SVM is used for "off-line" phenotype discovery [##REF##11440593##20##]. However, two major points limit its application to high-throughput image-based screens, especially for screens of cell shape regulators. <italic>First</italic>, in one-class SVM all the test samples are classified into two classes, "novel" and "known", however many high-throughput RNAi datasets may potentially contain <italic>multiple </italic>diverse and unique novel phenotypes which should not necessarily be grouped together. Subsequent cluster analysis would be needed to identify and model different novel phenotypes following the use of one-class SVM. <italic>Second</italic>, each time a novel phenotype is discovered using one-class SVM, the support vectors need to be modified so that the newly discovered phenotype are included as "known" in the following loops, otherwise it will continuously be identified as novel in future. As mentioned earlier, in a typical RNAi screen on 1,000–10,000s genes with dozens of images for each RNAi and 100s of cells in each image, such updating would involve millions of cells and is intractable.</p> <p>Here we describe the development of an online phenotype discovery pipeline that we implemented in the context of a high-throughput image-based RNAi screen for regulators of cell shape. A simplified scheme of online phenotype discovery is shown in Figure ##FIG##0##1##. Online phenotype discovery demands adaptively identifying various novel phenotypes based on multiple existing phenotypes (e.g. those identified <italic>a priori </italic>by biologists), being sensitive and flexible to various new phenotypes and avoiding frequent re-modelling using large existing dataset. Our method includes two key components: phenotype modelling and iterative cluster merging. <italic>First</italic>, a Gaussian Mixture Model (GMM) is estimated for each existing phenotype following [##UREF##7##21##]. <italic>Second</italic>, iterative cluster merging are performed based on gap statistics. When a new image is incorporated, we sample the GMM of each existing phenotypes and start a series of merging loops. In each loop, the image is combined with sample set for one existing phenotype and we estimate cluster number in such combined dataset using gap statistics and use GMM of existing phenotype as part of the reference distributions. If some cells in the new image are clustered together with samples from the existing phenotype, they are merged into the existing phenotype, i.e. they are included into the dataset of existing phenotype and deleted from the new image. The iterations continue until sample set from each existing phenotype has been combined with the new image and has merged with its counterpart (if any exist). Upon completion of all loops, the remaining cell groups in the new image are identified as the candidate of new phenotypes. By sampling reference dataset from new image and existing phenotype separately, utilizing the GMM for existing phenotypes as (part of) reference distribution and involving existing clusters one by one, our method improves the ideas in [##UREF##3##12##] and becomes more effective. Experimental results show that the proposed method is robust and efficient for online phenotype modelling and discovery in the context of diverse image-based screens, especially RNAi screens on <italic>Drosophila</italic>.</p>
<title>Methods</title> <title>Online cluster discovery: problem formulation</title> <p>Suppose we have identified <italic>K</italic><sub>0 </sub>non-overlapping cellular phenotypes, the <italic>i</italic>-th cell in the <italic>m</italic>-th existing phenotype is denoted by vector , with each cell described by <italic>p </italic>morphological features. Then, let  denotes dataset for the <italic>m</italic>-th phenotype, with <italic>u</italic><sub><italic>m </italic></sub>indicating the number of cells for <italic>m</italic>-th phenotype. Thus, we denote the dataset of all available cells, , as:</p> <p></p> <p>and the total number of existing cells is . Similarly, when a new image  is obtained, the <italic>i</italic>-th cell in this image is also described using <italic>p </italic>features, and denoted by <bold>e</bold><sub><italic>i </italic></sub>≜ [<italic>e</italic><sub><italic>i</italic>1</sub>, <italic>e</italic><sub><italic>i</italic>2 </sub>... <italic>e</italic><sub><italic>ip</italic></sub>], and , where <italic>ν </italic>is the number of cells in . New images are continuously obtained, and each new image  contains tens of cells while there are thousands cells for each <sub><italic>m</italic></sub>, thus <italic>v </italic>&lt;&lt;<italic>u</italic><sub><italic>m </italic></sub>&lt;<italic>u</italic>.</p> <p>Given a new image , we need to adaptively determine number of new phenotypes <italic>K</italic><sub><italic>new</italic></sub>, based on <italic>K</italic><sub>0</sub>,  and . Cells in  while belonging to some existing phenotype <sub><italic>m </italic></sub>should be identified, and used to update model for <sub><italic>m</italic></sub>. It is unfeasible to involve every single cell in  into cluster discovery, because the large scale of  could bias cluster analysis towards existing phenotypes and add computation burden. On the other hand, "new cluster" identified only according to  is vulnerable to outliers. Thus an efficient method to utilize  is necessary.</p> <title>Outline of the proposed approach</title> <p>We propose to discover new clusters through iterative cluster merging. The dataset of each existing phenotype <sub><italic>m </italic></sub>is first fit to a GMM and sample dataset  is obtained from such model. Each  is combined with a new image  one by one to detect possible new phenotypes. Our online phenotype discovery method is outlined as below:</p> <p>(1) Phenotype modelling. A GMM is fit to each existing phenotypes using Expectation-Maximization (EM) algorithm following [##UREF##7##21##].</p> <p>(2) Sampling existing phenotype and combining existing information with the new image. We sample from the GMM of one existing clusters, say <sub><italic>m</italic></sub>, <italic>m </italic>∈ {1, 2... <italic>K</italic><sub>0</sub>}, get the sample set , and put  together with new image , we denote this combined set as , thus</p> <p></p> <p> should have comparable cell numbers as <italic>ν</italic>, the cell number in , so that phenotype information would not be overwhelmed due to limited cell number of . We empirically set sample number of  as <italic>ν </italic>to 5<italic>ν</italic>.</p> <p>(3) Estimating the cluster number in . An improved gap statistics method is used in which we take reference dataset from the range of feature values of  and  separately, and use GMM as the reference distribution for reference samples obtained from the support of .</p> <p>(4) Defining clusters on . Based on the estimated cluster number from step 3, a partition of  is obtained using Partitioning Around Medoids (PAM) [##UREF##15##31##] method.</p> <p>(5) Merging samples from  to existing phenotypes.</p> <p>(a) If some samples from  are assigned to a same cluster as at least 95% samples from , they are considered as a candidate for merging.</p> <p>(b) Validate merging operation using a statistical test with Bonferroni correction. For each merging candidate, calculate its <italic>p </italic>value under the GMM for <sub><italic>m</italic></sub>, reject the merging operation and keep this sample in  if <italic>p </italic>value is smaller than 1/<italic>K</italic><sub>0</sub>, or else merge this candidate into <sub><italic>m </italic></sub>and delete it from .</p> <p>(6) Returning to step 2 to sample another existing phenotype and start new merging loop.</p> <p>(7) Updating phenotype models. After each existing phenotype <sub><italic>m</italic></sub>, <italic>m </italic>∈ {1, 2... <italic>K</italic><sub>0</sub>}merges their counterparts in , define clusters left in  as new phenotypes and estimate GMM for them.</p> <p>Through modelling and re-sampling,  becomes more flexible and re-useable, allowing us to cover complete properties of phenotypes. Following data modelling and sampling, the information from existing phenotypes is combined with new image one by one in the loops from step 3 to 5. Thus in each single loop, the task of estimating cluster number is simplified to identifying difference between new image  and only one existing phenotype. After each <sub><italic>m </italic></sub>merges its counterpart in , clusters left in  are identified as new phenotypes.</p> <title>Cluster modelling and sampling</title> <p>Given the dataset , we model each phenotype <sub><italic>m </italic></sub>using a GMM:</p> <p></p> <p>where <italic>N </italic>denotes Gaussian distribution. We denote the number of Gaussian terms for phenotype <sub><italic>m </italic></sub>as <italic>Q</italic><sub><italic>m </italic></sub>and define parameters for <sub><italic>m </italic></sub>as . Initially, the covariance matrix <bold>Σ</bold><sub><italic>m</italic>, <italic>t </italic></sub>is set to be diagonal. We use Expectation-maximization (EM) algorithm to estimate {<bold>π</bold><sub><italic>m</italic></sub>, <bold>μ</bold><sub><italic>m</italic></sub>, <bold>Σ</bold><sub><italic>m</italic></sub>} from <sub><italic>m</italic></sub>. In the initialization of EM algorithm, <italic>Q</italic><sub><italic>m </italic></sub>is set to four, and <sub><italic>m </italic></sub>is first partitioned into <italic>Q</italic><sub><italic>m </italic></sub>clusters using fuzzy C-means clustering method, and then initial parameters are estimated using the standard vector quantization method. For each class, <italic>Q</italic><sub><italic>m </italic></sub>is reduced to the minimum possible using minimum description length (MDL) technique, following [##UREF##7##21##]. We obtain random samples from the GMM to form set  having <italic>i.i.d </italic><sub><italic>m</italic></sub>, , and  is combined with new image  to form . When estimating cluster number in  using gap statistics, GMM is used as reference distribution for .</p> <title>Estimating cluster numbers using improved gap statistics</title> <p>To estimate the number of clusters from an unlabeled dataset, many existing methods focus on the within cluster dispersion <italic>W</italic><sub><italic>k</italic></sub>, resulting from clustering datasets (e.g. ) into <italic>k </italic>clusters, <italic>C</italic><sub>1</sub>, <italic>C</italic><sub>2</sub>,... <italic>C</italic><sub><italic>k </italic></sub>with <italic>C</italic><sub><italic>r </italic></sub>denoting the indices of samples in clusters <italic>r </italic>and <italic>f</italic><sub><italic>i</italic>, <italic>j </italic></sub>denotes the value of <italic>j</italic>-th feature measured from <italic>i</italic>-th data point. Based on , we have . <italic>W</italic><sub><italic>k </italic></sub>tends to decrease monotonically as the number of clusters <italic>k </italic>increases, but from some <italic>k </italic>on, such decrease flattens markedly. Statistical folklore has it that error measure based on <italic>W</italic><sub><italic>k </italic></sub>should have an "elbow" at the desirable cluster number, thus different criterions based on <italic>W</italic><sub><italic>k </italic></sub>are defined.</p> <p>Gap statistics [##UREF##3##12##] method utilizes the output of any clustering algorithm under different <italic>k</italic>, compares the change of <italic>W</italic><sub><italic>k </italic></sub>to the dispersion expected under a reference null distribution, the gap between the logarithms of these two dispersions are employed to detect cluster number. Gap statistics can detect homogenous non-clustered data against the alternative of clustered data [##REF##17425640##14##]. This ability is critical when all cells in new image  belong to the same phenotype.</p> <p>To estimate cluster number in  (defined in equation (2)), we first select a number <italic>K </italic>which is larger than the expected cluster number, e.g. in our case <italic>K </italic>= 5. For each <italic>k </italic>= 1, 2... <italic>K</italic>,  is divided into <italic>k </italic>clusters and gives a series of <italic>W</italic><sub><italic>k</italic></sub>. Then we generate <italic>B </italic>reference datasets from , cluster them into <italic>k </italic>clusters and obtain . We use PAM [##UREF##15##31##] for clustering. Considering the mean dispersion  across <italic>B </italic>= 20 reference datasets, and their standard deviation , the item  is taken into consideration for a better control about the rejection of null model [##UREF##3##12##], and estimated cluster number <italic>k' </italic>is:</p> <p></p> <p>The reference distribution is a null model of data structure. In [##UREF##3##12##], reference datasets are sampled uniformly either from the range of observed values for each feature, or the range of a box aligned with the principle components of data. However, it is encouraged to estimate reference distribution from existing samples rather than simply using uniform distribution because the bounding box of the whole dataset always includes some "blank" area. The existing cluster definition can help us focus on where the data really lies, and avoid generating a reference dataset violating the properties of original one. Here, we sampled  from GMM of each existing phenotype and it makes sense to use this GMM as the reference distribution for .</p> <p>The problem now is to generate reference dataset from GMM, because  is combined with new image  to form the dataset , and the model of  is unavailable. We have to deal with  and  separately because the distribution of  is unavailable. We propose to solve this problem by generating reference dataset from  (GMM reference distribution) and  (uniform reference distribution) separately and combine two sets together, i.e. substituting  with</p> <p></p> <p>We discuss more detail of this strategy in the [Additional file ##SUPPL##0##1##], and supply a figure as [Additional file ##SUPPL##5##6##] to illustrate the motivation and innovation of our strategy.</p> <p>Gap statistics method repeatedly carries out clustering using a set of candidate cluster numbers, and pick up the number supplying best within cluster dispersion as estimated cluster number. GMM is an accurate model for , and using GMM as reference distribution can avoid the risk of split biological meaningful clusters and retain biological properties of existing phenotypes. The selection of <italic>K </italic>and <italic>B </italic>controls the number of clustering operation to be carried out and greatly influences the complexity of the whole methods. An effective way of utilizing existing phenotypes can greatly reduce <italic>K </italic>and make gap statistics method more suitable for online phenotype discovery in high-throughput image-based screens.</p> <title>Cluster definition and merging</title> <p>We use Partitioning Around Medoids (PAM; also known as K-medoids) [##UREF##15##31##] to do clustering on combined set . PAM provides better flexibility and robustness of choosing suitable dissimilarity measurements for different applications [##REF##16882653##32##] and more efficient compared to Fuzzy clustering methods, especially in our cases where clustering are carried out frequently.</p> <p>After clustering, we get a non-overlapping partition of , where the cluster number <italic>K' </italic>is determined through gap statistics, and we adjust the cluster labels to make sure that <sub>1 </sub>includes the largest ratio of samples from existing phenotype . Merging operation is done according to this partition. Datasets , <italic>m </italic>∈ {1, 2,... <italic>K</italic><sub>0</sub>} are combined with  one by one, and in each loop, the overlapped part of  and  (if any) is located in <sub>1</sub>, deleted from  and included as part of existing cluster:</p> <p></p> <p>after all merging loops, clusters left in  are defined as new phenotypes.</p> <p>The above merging strategy is based on theoretical case of , but in reality, when we consider random sample set  from GMM of an existing phenotype, it is possible that some samples are randomly far from the centre of existing phenotype and thus assigned into different clusters with their majority counterparts in . We take two strategies to protect the merging operation from influence of outliers.</p> <p>(1) Merging operations only happens when some cells in  are assigned into <sub>1</sub>, together with more than 95% of samples . And such cells are considered candidates for merging operation.</p> <p>(2) For each merging candidate in , we carry out statistical test with Bonferroni correction. We calculate the <italic>p </italic>value for each candidate with respect to the GMM for , i.e. possibility of obtaining a value at least as extreme as (if not more) this candidate under the GMM. The corrected <italic>p </italic>value for each candidate is defined as its <italic>p </italic>value with respect to the GMM of  divided by number of existing phenotypes <italic>K</italic><sub>0</sub>. If the corrected <italic>p </italic>value is lower than 0.05/<italic>K</italic><sub>0</sub>, the merging operation is rejected and we keep that candidate in .</p> <p>In the merging loops, we focused on identifying samples of existing phenotypes from . While some cells of  are merged into existing phenotypes, novel clusters gradually stand out.</p>
<title>Results</title> <title>Synthetic dataset</title> <title>Overcoming large sample size difference between two clusters</title> <p>Difference between sample numbers of distinct clusters could bias cluster number estimation. We propose to tackle this problem by using GMMs as reference distributions for existing phenotypes in gap statistics and validate our method using simulation.</p> <p>Each simulated dataset consists of observations from two populations <italic>ℙ</italic><sub>1 </sub>and <italic>ℙ</italic><sub>2</sub>, each population are sampled from a two dimensional Gaussian distribution with means (0,0) for <italic>ℙ</italic><sub>1 </sub>and (0,3) for <italic>ℙ</italic><sub>2</sub>, and an identity covariance for both groups. Gap statistics [##UREF##3##12##] are used to estimate number of clusters from the experiment dataset <italic>ℙ</italic><sub>1 </sub>⋃ <italic>ℙ</italic><sub>2</sub>. This method uniformly samples different reference datasets from the support of <italic>ℙ</italic><sub>1 </sub>⋃ <italic>ℙ</italic><sub>2</sub>, and here the number of reference datasets is set to 20. Then the experiment dataset <italic>ℙ</italic><sub>1 </sub>⋃ <italic>ℙ</italic><sub>2 </sub>and the 20 reference datasets are clustered into candidate cluster numbers <italic>k </italic>= 1... <italic>K</italic>, and we set <italic>K </italic>= 10. For each clustering result, we measure the compactness of obtained clusters using "within cluster dispersion". For each cluster number <italic>k</italic>, such dispersion are measured separately on experiment dataset and each reference dataset, and gap statistic for <italic>k</italic>, denoted as <italic>gap(k)</italic>, is defined as the average value of difference between the dispersion on experiment dataset and that on each reference dataset, meanwhile we obtained standard deviation of such difference across 20 reference dataset, and denoted as <italic>s</italic><sub><italic>k</italic></sub>.</p> <p>Some typical gap statistic curves are summarized in Figure ##FIG##1##2## to illustrate the problem and validate our method. X axis in Figure ##FIG##1##2## indicates candidate cluster number <italic>i</italic>, and each data point denote <italic>gap(k) </italic>while the error bar indicating <italic>s</italic><sub><italic>k</italic></sub>. Larger value of <italic>gap(k) </italic>means better compactness when the dataset is clustered into <italic>k </italic>clusters (compared with the reference datasets which simulate mono-genous data), then a increase from <italic>gap (k-1) </italic>to <italic>gap (k) </italic>means the clustering performance is improved from <italic>k-1 </italic>to <italic>k</italic>. We take <italic>s</italic><sub><italic>k </italic></sub>into consideration when estimating cluster numbers following [##UREF##3##12##], and take the estimated cluster number as the first <italic>k </italic>with <italic>gap(k)&gt;gap(k+1)-s</italic><sub><italic>k</italic>+1 </sub>(the candidate number whose data point is higher than the bottom of error bar for its instant right neighbor). Details of gap statistics method are discussed in <italic>Methods </italic>section.</p> <p>When samples from <italic>ℙ</italic><sub>1 </sub>and <italic>ℙ</italic><sub>2 </sub>have identical number of 100, gap statistics can correctly judge sample number as 2, then we set sample number from <italic>ℙ</italic><sub>1 </sub>as 200, 300, 500, 700, 900 and 1000, and sample number from <italic>ℙ</italic><sub>2 </sub>are fixed as 100. Figure ##FIG##1##2##, <italic>left </italic>and Figure ##FIG##1##2##, <italic>middle </italic>show that when number difference is over six-fold, gap statistics does not work correctly.</p> <p>A ten-fold difference of cell numbers between existing phenotypes and new images is not the worst situation we would face in online phenotype discovery. Based on the results given in Figure ##FIG##1##2##, <italic>middle</italic>, samples from two obviously different populations would be merged together. We propose to solve this bias through fitting a GMM model for existing phenotypes, as well as using GMM as reference distribution for each existing cluster in gap statistics.</p> <p>Next, we consider <italic>ℙ</italic><sub>1 </sub>as existing cluster with known distribution model. If we use Gaussian model for <italic>ℙ</italic><sub>1 </sub>as reference dataset for gap statistics, it gives the correct result in 87.4% occasions across 500 experiments even with ten-fold difference in sample number. Figure ##FIG##1##2##, <italic>right </italic>shows one gap curve with ten-fold difference, where <italic>Gap(1)-(Gap(2)-s</italic><sub>2</sub>) = <italic>-0.0006</italic>, meanwhile <italic>Gap(2)&gt;Gap(3)-s</italic><sub>3</sub>, thus, the estimated cluster number is 2 rather than 3 (although <italic>Gap(3)&gt;Gap(2)</italic>), because data point for <italic>k </italic>= 2 is higher than the bottom of error bar for <italic>k </italic>= 3.</p> <p>The results are summarized in Table ##TAB##0##1##. Generally speaking, when two distinct clusters have ten-fold difference in sample numbers, original gap statistics method using uniform reference fails to estimate cluster number correctly, while our method of using accurate model as reference distribution can overcome this issue and give a correct estimation of cluster number.</p> <title>Simulating typical cells using seven types of polygons</title> <p>Seven types of polygons are defined based on the fluorescent cell image from a real genome wide RNAi screen (protocol discussed later), and a simulation dataset is constructed based on these different types of polygons. Information about these seven polygons is shown in Figure ##FIG##2##3## and some details on generating these polygons are introduced in [Additional file ##SUPPL##0##1##].</p> <p>2000 polygons from each of seven types were generated and used as training dataset, i.e. the set of existing phenotypes, and another 2000 polygons were generated for each type to as testing dataset. In each experiment, we started from a certain set of existing phenotypes and built GMM from training samples, meanwhile, we iteratively chose two of seven polygon types and selected 100 polygons apiece from the testing dataset to form a synthetic test image, altogether 70 images can be formed for one experiment. Using the model estimated from the training set, we can identify existing and novel type of polygons from these synthetic images, and observe the performance of our method under different number of novel phenotypes and order of image input.</p> <title>Performance under different sets of existing phenotypes</title> <p>Figure ##FIG##3##4## shows the general performance of our method under different sets of existing phenotypes. We changed the number and composition of existing phenotypes for different experiments, (different composition means different phenotypes are considered as "existing". GMM for existing phenotypes were estimated from training dataset to start each experiment), and for each set of existing phenotypes, we divided the testing set into 70 synthetic images and shuffled the order of image input 50 times. Whatever set of existing phenotypes we use, the synthetic images always contain all seven phenotypes. We can define accuracy for each polygon type as "the proportion of test samples restored into their original cluster". If one phenotype is used as existing phenotype in an experiment, the accuracy for this phenotype is defined as the proportion of testing cells (in this phenotype) merged into the original existing cluster; while if the phenotype is novel, the accuracy for this phenotype equals the proportion of testing cells in this phenotype which are left alone in a separate cluster after all the merging loops. The accuracies are then averaged to report general performance of our method.</p> <p>Figure ##FIG##3##4## shows our method as having consistent accuracy around 85% for different polygons under different conditions, and the best performance is seen when the number of existing phenotypes are 3 and 4. When the number of existing phenotype is 6, more false negatives appears as novel samples are merged into existing phenotypes, and thus prompts the importance of cluster validation and more refined multiple hypothesis tests.</p> <title>Box and whisker plots for performance under different conditions</title> <p>As indicated earlier, the test datasets always consist of seven phenotypes, we can then change the conditions of experiments (number and composition of existing phenotypes and order of image input) and observe the performance for certain phenotype to test the robustness of our method. Across experiments with different input order of images and composition of existing phenotypes, the performance on certain phenotypes are ranked, and such distribution of performance are illustrated using box and whisker plot. We show the box plots for ellipses and 16-point stars in Figure ##FIG##4##5## and explain the meaning of such plots in its caption. We observed that larger variation of accuracy values correlates with lower number of existing phenotypes, which is because the models of novel phenotypes are estimated from test samples input in the earlier stage of experiment and updated as new images are included. Thus, the accuracy has a larger variance across different image input order when the number of existing phenotypes is low. This issue indicates the importance of more robust strategy of model updating. However, the overall performance of our method is robust regarding to different condition of experiments.</p> <title>Performance comparison with SVM based methods</title> <p>One-class SVM [##REF##11440593##20##] tackles the novelty detection problem of differentiating novel phenotypes from known ones by estimating a distribution from the core structure of existing dataset and model such distribution using a series of support vectors. It then labels each testing samples as "known" or "novel" using the model built upon support vectors. Compared with SVM used in classification, a parameter <italic>ν </italic>∈ (0, 1) (denoted as 'Nu' in figures) is involved in one-class SVM. This parameter is used to define the core structure of the existing dataset, and it has two roles, i.e. the asymptotic upper bound of training data which are labelled as outliers and the lower bound of the fraction support vectors in training samples. However, one-class SVM itself cannot be used to handle problems such as the restoration of multiple existing phenotypes. We modify one-class SVM to fit it into the scenario of online phenotype discovery. Each new image is combined with the support vectors trained from the existing samples and novelty detection is carried out using one class SVM with Gaussian kernels of width 0.5 and various parameters <italic>ν </italic>to define the scale of support vectors and outliers. After novelty detection, each test sample labelled as "known" is subject to multiple linear SVM classifiers (trained from one pair of existing phenotypes) and assigned into one of multiple existing phenotypes according to majority vote among classifiers. We detailed one-class SVM and our modification in [Additional file ##SUPPL##0##1##].</p> <p>We compared our method and SVM based method and Figure ##FIG##5##6## shows the comparison results in two occasions. Four sets of parameters are used for one-class SVM. Figure ##FIG##5##6##<italic>left </italic>shows the performance when ellipses are considered as novel phenotype while the other six phenotypes serve as the set of existing dataset; and Figure 6<italic>right </italic>shows the performance when 16-point stars are the only novel phenotype. Accuracies for all seven phenotypes were measured and averaged across 100 experiments with different orders of image input. In both cases, when <italic>ν </italic>= 0.1, SVM based method merged most of the new samples into existing phenotypes and gave best performance on existing phenotypes (especially for 16-point stars), while SVM with <italic>ν </italic>= 0.5 left out most of the new samples as outliers and gave the best accuracy for the novel phenotype, meanwhile, the difference between best and worst accuracy in one experiment could be as large as 25%; our method outperformed most SVM based method on the accuracies for at least 3 of 7 phenotypes and the difference between best and worst accuracy across seven types are never greater than 10%.</p> <title>Cell culture, image segmentation, morphological feature extraction and selection</title> <title>Cell culture and image acquisition</title> <p>As a next step, we implemented our methods in the context of a high-throughput image-based screen. In particular, we focused on a novel dataset of images acquired in the course of a genome-scale RNAi screen for regulators of <italic>Drosophila </italic>Kc167 cell shape that have hemocyte-like properties (Bakal et al, unpublished). By using dsRNA to target and inhibit the activity of specific genes/proteins, the role of individual genes in regulating morphology can be systematically determined. Briefly, Kc167 cells are bathed in the presence of individual dsRNAs targeting all known <italic>Drosophila </italic>protein kinases and phosphatases in 384-well plates (detailed protocols are available at [##UREF##8##22##]). Following a 5-day incubation period, the cells are fixed and stained with reagents in order to visualize the nuclear DNA (blue channel in all images), polymerized F-actin (green), and <italic>α</italic>-tubulin (red). For each well, sixteen images from each of the three channels (blue, green and red) were acquired in an automated fashion using an Evotec spinning-disk confocal with a 60× water objective. Auto-focusing is performed in a two-step fashion by first focusing on the bottom well at each individual site, and then moving the objective by the same Z-distance (in this case 3 <italic>μ</italic>m above the bottom of the well) at each site. The images were captured at a binning of 2 and have a resolution of 661*481 pixels.</p> <title>Image segmentation</title> <p>To analyze the morphology of single cells, it is necessary to first delineate the boundaries of individual cells. Direct segmentation of the cell bodies in the F-actin and <italic>α</italic>-tubulin channels is difficult due to the complex morphology of cellular boundaries. Segmentation of nuclei in the DNA channel is relatively easier, and its segmentation results provide the rough position information of the cell bodies. Herein, we utilize a two-step segmentation procedure [##REF##17444941##5##,##UREF##9##23##] including nuclei segmentation on DNA channel, and cell body segmentation of images derived by combining images from the DNA, F-actin and <italic>α</italic>-tubulin channels.</p> <p>In nuclei segmentation, the nuclei are first separated from the background by using a background correction based adaptive thresholding method [##REF##17925027##24##]. However, the clustered nuclei cannot be separated by the adaptive thresholding method. To separate the clustered nuclei, the centres of the nuclei are first detected using a gradient vector field (GVF) based detection method [##REF##17925027##24##]. Specifically, we filter the nuclei image using a Gaussian filter, which suppresses the noise and generate local maxima inside cells, and these local maxima correspond to the nuclei centres. However, there are still some local maxima due to noise. To further eliminate the noisy local maxima, we detect the true cell centres using GVF method. It is a well-known fact that in an electric field, the electric field lines point to the positive electrodes, and the free negative electrons move along the electric field lines and stop at these electrodes. In GVF, the gradient-vector lines also point to the local maxima. Analogous to the electron moving inside the electron field, we put one particle on each detected cell pixel and pushed it along the gradient vector lines. Consequently, these particles stop at these local maxima. Since no or very few particles stop at non-maxima and noisy local maxima, the true cell centres can be identified by choosing the points that have many particles [##REF##17925027##24##]. After the centres of nuclei are detected, the nuclei are segmented using the marker-controlled watershed algorithm.</p> <p>To use both F-actin and <italic>α</italic>-tubulin channels information, we combine the two channels' signal as I = (I<sub>F-actin </sub>+ I<sub><italic>α</italic>-tubulin</sub>)/2, where I, I<sub>F-actin </sub>and I<sub><italic>α</italic>-tubulin </sub>denote the combined image, F-actin channel image and I<sub><italic>α</italic>-tubulin </sub>channel image respectively. We then segment the cell bodies using the combined image. First the cell bodies are separated from the background using the aforementioned adaptive thresholding algorithm. The nuclei segmentation results facilitate the segmentation of cell bodies by providing the rough position information of cell bodies. Herein, we employ the marker-controlled watershed and the nuclei segmentation results to segment the individual cell bodies. To reduce the over-segmentation of cell bodies a feedback system proposed in [##REF##17444941##5##] is employed. Three scoring models, which measure the morphological appearance, gradient and edge intensity of cell pairs respectively, are built to identify the over-segmented cell bodies, and guide the merging procedure [##REF##17444941##5##]. Detailed shape and boundary information of nuclei and cell bodies is obtained after the two-step segmentation procedure.</p> <title>Morphological feature extraction and feature selection</title> <p>Cellular phenotype identification depends on choosing a rich set of descriptive features, which is one of the most critical steps for pattern recognition problems. To capture the geometric and appearance properties, 211 morphology features belonging to five categories are extracted following [##UREF##9##23##]. The selected features include a total of 85 wavelet features (70 of them from Garbor wavelet transformation [##UREF##10##25##] and 15 features from 3-level CDF97 wavelet transformation [##UREF##11##26##]), 10 geometric region features describing the shape and texture characteristics of cells [##UREF##9##23##], 48 Zernike moments features with selected order of 12 [##UREF##12##27##], 14 Haralick texture features [##UREF##13##28##] and a total of 54 phenotype shape descriptor features (36 features of ratio length of the central axis projection and 18 features of area distribution over equal sectors) [##UREF##9##23##]. A feature selection procedure is necessary to de-noise the dataset and describe it in the most informative way. As the datasets and phenotype models are being updated adaptively, an unsupervised feature selection without relying on phenotype labels is used to supply a stable feature subset. It is based on iterative feature elimination using <italic>k </italic>nearest neighbour features following [##UREF##14##29##]. In this study, an informative subset of fifteen features is selected to quantify the segmented cells.</p> <title>Online phenotypes discovery in the context of RNAi high-throughput screenings</title> <title>Fitting GMM model for existing phenotypes</title> <p>We first performed a visual examination on a subset of dataset in order to define images and cellular morphologies of typical normal cells, as well as cells in three distinct cellular phenotypes. We termed these quantitative categories "Long Punctuate Actin (LPA)", "Cell Cycle Arrest (CCA)" and "Rho1 (Rho)", collected images in these categories and combined them with images of 1583 normal cells, to form our cell database of existing phenotypes. We estimated a GMM for each existing phenotype using EM algorithms. A uni-modality model is obtained for normal and LPA phenotypes, and CCA and Rho phenotypes end up with 2 and 3 Gaussian terms respectively and the covariance matrices are set to be diagonal. A brief introduction of each existing phenotype is shown in Figure ##FIG##6##7##.</p> <title>Case 1: merging cells in existing phenotypes</title> <p>To validate our method's ability of restoring three existing phenotypes: Normal, LPA and CCA, we carried out 100 times of five-fold cross validation. In each experiment, 20% of cells from each existing phenotypes were taken out and combined to form a flow of new images, these cells were divided into seven groups, simulating seven new images. We defined merging accuracy for each phenotype as the proportion of test samples merged into its original phenotype. The mean and standard deviation of accuracies across 100 experiments was shown in Table ##TAB##1##2##.</p> <p>Our method can identify and merge cells into original phenotypes well. In the third column of Table ##TAB##1##2##, we list the typical mistakes made during the merging loops. Some cells with normal and LPA phenotypes are not merged correctly, and such mistakes suggest the existence of previously undefined phenotypes in such images.</p> <title>Case 2: discovering new phenotypes: cross validation based on known phenotypes</title> <p>To validate our method's ability of discovering new phenotypes, we performed the following experiments after the <italic>a priori </italic>identification of four existing phenotypes (Normal, LPA, CCA and Rho1) by biologists. In each experiment, three of four phenotypes were considered as existing phenotypes, and cells in the other phenotype were divided into groups with 100 cells. These cell groups represent an incoming dataset of new images containing "novel phenotypes". Given only one phenotype in the testing images, ideally in each experiment, our method would identify the first of such cell groups as a new phenotype, model this phenotype, assign all the other testing images to this "novel phenotype", and no testing cells would be merged by any of the other three phenotypes. Fifty experiments were performed to identify each phenotype, 1000 cells served as "novel group" for normal and LPA phenotypes while 600 cells were used for CCA and Rho1 phenotypes. The experiment results are summarized in Table ##TAB##2##3##. "Accuracy" is defined as the ratio between the number of testing cells assigned to a single cluster and the total number of testing cells, and such accuracy is calculated after all three merging loops for each experiment.</p> <p>Case 2 shows our method's ability of identifying novel phenotypes. We hypothesize that the relatively low accuracy for CCA and Rho phenotypes can be attributed to the small number of samples and incomplete understanding of which phenotypes is the biological representative for the entire treatment class. High classification accuracies for normal cells in both case 1 and case 2 provide strong validation of the ability of our methods to identify wild-type cells. While the overlap of normal and LPA serves as a starting point for novel phenotypes discovery.</p> <title>Case 3: identifying multiple novel phenotypes from online image input and performance comparison with SVM based methods</title> <p>In this case, we still used the test dataset in case 2, which included a total of 3,200 cells from four phenotypes. In each group of experiments we started from the models (available from previous step) of two existing phenotypes, and all 3,200 test cells were divided into 32 images with cells from two phenotypes in one image, and all images were input with 50 different orders. Altogether, three groups of experiments were carried out, and in each experiment, normal phenotype were paired with one of the other three phenotypes, to serve as sets of ''existing phenotypes''. Both our method and SVM based methods were used in each experiment, and we can thus validate our method's ability to deal with multiple novel phenotypes well as the performance under different order of image input.</p> <p>Figure ##FIG##7##8## summarizes the average performance of our method and SVM based methods for each phenotype across 50 experiments. The results from different sets of existing phenotypes are shown separately, and "accuracy" is defined as the proportion of test samples restored into its original cluster. The performance of our method degraded with reduced number of existing phenotypes compared with case 1 and case 2, especially for the Rho1 phenotype, however, it still performed consistently on existing and novel phenotypes, never failed to reach 80% mark and outperformed SVM based method in at least two of four phenotypes on all occasions.</p> <p>Figure ##FIG##8##9## shows the box and whisker plots for our methods under three different sets of existing phenotypes. The variation of accuracy across different order of image input can be as large as 8% (Figure ##FIG##8##9##<italic>bottom</italic>, accuracy for CCA phenotype), but the accuracy is never less than 80% For two experiment with the lowest accuracies and shown as outlier in the box and whisker plot (Figure ##FIG##8##9##<italic>top</italic>, CCA and Figure ##FIG##8##9##<italic>bottom</italic>, LPA), the order of image input was validated, and on both occasions we observed a small group of novel cells emerging at the beginning of image flow with all their counterparts appearing very late. Thus, the model for novel phenotypes was only built based on a small group of cells, and most test cells appeared later were merged by similar phenotypes with more stable models. This indicates the necessity of better cluster validation and model updating solution, which are proposed in our method.</p> <p>Having multiple phenotypes in a single image is a challenge in the analysis of image based high-throughput screens. Our method successfully tackle such cases and identify multiple phenotypes from online image input, and can therefore provide a better perspective for further quantification of the whole image, <italic>en route </italic>to the identification for the role of each gene.</p> <title>Identifying "rl/<italic>tear-drop</italic>" phenotype in the context of Drosophila genome-scale RNAi screen</title> <p>Typically, a new image which is incorporated into the dataset may have less than fifty cells, which can severely impact the ability to quantitatively determine and distinguish novel phenotypes. But such images can still be incorporated into our analysis by discarding images with cell numbers &lt;10, and putting together cells from multiple new images to make a combined dataset having at least 100 cells. We collected cells from four existing phenotypes, assembled them as training dataset, modelled existing phenotypes and used such phenotype models to analyze images acquired as part of a <italic>Drosophila </italic>genome-scale RNAi screen. Implementation of our method revealed a phenotype that was undetected by visual inspection which we termed as "<italic>rl</italic>/tear-drop". These cells are small in size and having smooth boundaries and non-round shape. Figure ##FIG##9##10## supplies some information and typical images for this phenotype. Such phenotype was initially discovered in wells where cells had been incubated in the presence of <italic>rl </italic>RNAi. <italic>Drosophila rl</italic>, or <italic>rolled </italic>is the homolog of mammalian ERK kinase and is a central regulator of a host of cellular processes [##REF##16227978##30##]. Importantly, the <italic>rl</italic>/tear-drop phenotype was not scored during human inspection of the images. The detection of cells with the <italic>rl</italic>/tear-drop phenotypes in an image or well often correlates with detection of cells with an LPA phenotype, and we hypothesize that <italic>rl</italic>/tear-drop represents a phenotypes that occur as cells transition from normal to LPA. We collected more than 500 cells with the <italic>rl</italic>/tear-drop phenotype through analysis of replicate experiments, modelled this phenotype with GMM, and used it to analyze cells from the new images. Our method detects <italic>rl</italic>/tear-drop cells in experiments where <italic>CG10673, CG7236, Nipped-A </italic>and <italic>Pten </italic>have been targeted by RNAi. Although the nature of the relationship among these genes needs further investigation, we have previously identified <italic>Nipped-A </italic>and <italic>Pten </italic>as regulators of ERK activity following insulin stimulation [##REF##17086199##2##], suggesting a relevant relationship between these genes. Altogether, these results demonstrate that our online phenotype discovery methods can be used to provide unexpected and novel biological insight.</p> <p>We also tested our method using two published dataset from <italic>Drosophila </italic>RNAi screen [##REF##17588932##7##] and HeLa cell cycle phase detection [<italic>ref</italic>. s3 in Additional file ##SUPPL##0##1##], compared its performance with SVM based methods and validated our method's ability of handling dataset from various organisms. These experiments are described in [Additional file ##SUPPL##0##1##], the results on <italic>Drosophila </italic>dataset from [##REF##17588932##7##] are reported in [Additional file ##SUPPL##1##2##] and results on HeLa dataset are reported in [Additional file ##SUPPL##2##3##, ##SUPPL##3##4##].</p> <p>All other functions are developed in Matlab 7.0 and ran in PC with Intel<sup>® </sup>Core™ 2 T7200 2.00 GHz CPU and 2.00 GB of RAM. Starting from four existing phenotypes, the average running time for our method based on improved gap statistics is 1.8 seconds on a group of 100 segmented cells, 10.2 seconds on a group of 600 cells and 19.4 seconds on a group of 1000 cells. Considering the fact that cell number in each image is seldom over 300 in the reported high content screen, our method is suitable for online application.</p>
<title>Discussion</title> <p>Online identification and validation of novel morphological phenotypes are major challenges in specific high-throughput image-based screens. Manual phenotype labelling of high-throughput image-based data is a laborious and inordinately time-consuming process, while available automatic identification methods usually classify cells into a limited set of predefined phenotypes which may be determined through biased means and will not be updated according to the online image input. As millions of images are now generated during the course of a comprehensive genome-scale screen, new methods are needed to effectively identify novel phenotypes in such massive databases. Here we report the development of an online phenotype discovery method which models existing phenotypes, compares cells in new images with existing phenotype models through cluster analysis, assigns some new cells to existing phenotypes, and finally identifies and validates novel phenotypes online.</p> <p>GMM is used for modelling existing phenotypes and gap statistics, with GMM as reference distribution for existing phenotype, plays a key role in cluster analysis and merging. We built GMM for existing phenotypes, sampled datasets from the model and used them as reference distribution in gap statistics method, following this pipeline we can cover the complete properties of phenotypes more efficiently. Furthermore, gap statistics are dealing with only one existing phenotype plus a part of the new image in each merging loop, and the content of new image is iteratively updated with the merging procedure. We present Additional file ##SUPPL##4##5## to validate the idea of modeling existing phenotype using GMM, the detailed information of GMM estimated from four existing phenotype in our real dataset are reported along with histograms for some typical feature. </p> <p>For analysis of high content screen data, many researchers choose to summarize the information of single cells or objects to supply a normalized signature for higher level concepts (e.g. treatment conditions, genes, complexes, etc). Thus it is critical to identify different phenotypes related to a same treatment condition. Our method can be used in identifying multiple phenotypes in single well and supply detailed insight into related questions. The performance of our methods relies on the quality of image processing, feature selection, phenotype modelling, and cluster analysis methods. Using iterative cluster merging, our future goals are to build more reliable phenotype models and to construct complete pipelines of cluster analysis with detailed validation procedures to obtain more reliable definition of clusters.</p>
<title>Conclusion</title> <p>We propose an online phenotype discovery method for high-throughput RNAi screen, which can be used in the course of many image-based screens. This method is based on adaptive phenotype modelling and iterative cluster merging using improved gap statistics. Given datasets for existing phenotypes, the method can build a model of each existing phenotype, identify novel phenotypes in images obtained from ongoing screening and assign newly obtained cell images into different phenotypes. Compared with traditional novelty detection techniques, our approach avoids frequent re-modelling involving the huge existing dataset and can handle multiple existing phenotypes in a flexible manner. Implementation of our methods in the analysis of images acquired during a genetic screen for regulators of <italic>Drosophila </italic>cell morphology demonstrates the power of these computational tools in efficiently discovering meaningful new phenotypes.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>The recent emergence of high-throughput automated image acquisition technologies has forever changed how cell biologists collect and analyze data. Historically, the interpretation of cellular phenotypes in different experimental conditions has been dependent upon the expert opinions of well-trained biologists. Such qualitative analysis is particularly effective in detecting subtle, but important, deviations in phenotypes. However, while the rapid and continuing development of automated microscope-based technologies now facilitates the acquisition of trillions of cells in thousands of diverse experimental conditions, such as in the context of RNA interference (RNAi) or small-molecule screens, the massive size of these datasets precludes human analysis. Thus, the development of automated methods which aim to identify novel and biological relevant phenotypes online is one of the major challenges in high-throughput image-based screening. Ideally, phenotype discovery methods should be designed to utilize prior/existing information and tackle three challenging tasks, i.e. restoring pre-defined biological meaningful phenotypes, differentiating novel phenotypes from known ones and clarifying novel phenotypes from each other. Arbitrarily extracted information causes biased analysis, while combining the complete existing datasets with each new image is intractable in high-throughput screens.</p> <title>Results</title> <p>Here we present the design and implementation of a novel and robust online phenotype discovery method with broad applicability that can be used in diverse experimental contexts, especially high-throughput RNAi screens. This method features phenotype modelling and iterative cluster merging using improved gap statistics. A Gaussian Mixture Model (GMM) is employed to estimate the distribution of each existing phenotype, and then used as reference distribution in gap statistics. This method is broadly applicable to a number of different types of image-based datasets derived from a wide spectrum of experimental conditions and is suitable to adaptively process new images which are continuously added to existing datasets. Validations were carried out on different dataset, including published RNAi screening using <italic>Drosophila </italic>embryos [Additional files ##SUPPL##0##1##, ##SUPPL##1##2##], dataset for cell cycle phase identification using HeLa cells [Additional files ##SUPPL##0##1##, ##SUPPL##2##3##, ##SUPPL##3##4##] and synthetic dataset using polygons, our methods tackled three aforementioned tasks effectively with an accuracy range of 85%–90%. When our method is implemented in the context of a <italic>Drosophila </italic>genome-scale RNAi image-based screening of cultured cells aimed to identifying the contribution of individual genes towards the regulation of cell-shape, it efficiently discovers meaningful new phenotypes and provides novel biological insight. We also propose a two-step procedure to modify the novelty detection method based on one-class SVM, so that it can be used to online phenotype discovery. In different conditions, we compared the SVM based method with our method using various datasets and our methods consistently outperformed SVM based method in at least two of three tasks by 2% to 5%. These results demonstrate that our methods can be used to better identify novel phenotypes in image-based datasets from a wide range of conditions and organisms.</p> <title>Conclusion</title> <p>We demonstrate that our method can detect various novel phenotypes effectively in complex datasets. Experiment results also validate that our method performs consistently under different order of image input, variation of starting conditions including the number and composition of existing phenotypes, and dataset from different screens. In our findings, the proposed method is suitable for online phenotype discovery in diverse high-throughput image-based genetic and chemical screens.</p>
<title>Authors' contributions</title> <p>NP and CB conceived the biological hypothesis while STCW and XZ conceived the bioinformatics part of the study. ZY and XZ designed the framework of online phenotype discovery and performed tests, CB and colleagues carried out genome-scale RNAi screens, helped to set up initial phenotype database and validated final results, FL developed the image processing methods. All authors contribute in writing this paper, have read and approved the final version of this manuscript.</p> <title>Supplementary Material</title>
<title>Acknowledgements</title> <p>The authors would like to thank research members of The Methodist Hospital Research Institute, Radiology Department, and we thank colleagues in the Department of Genetics at Harvard Medical School, for technical support and comments. CB is a Fellow of the Leukemia and Lymphoma Society. NP is an Investigator of the Howard Hughes Medical Institute. The research is funded by The Methodist Hospital Research Institute (Stephen T.C. Wong).</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p>Tasks and simple scheme of online phenotype discovery.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Gap statistic curves for dataset with different sample number</bold>. Each curve represents experiment on one real dataset, and twenty reference datasets are defined from this real dataset. For each data point, value on X-axis indicates how many clusters are defined on both the reference dataset and the real dataset and value on Y-axis indicates gap statistic for this cluster number, which is defined as the average difference of within cluster dispersions between the clustering results on reference datasets and real dataset, the error bars around the data points show the variation across different reference datasets. The estimated cluster number is defined as <bold>the X value of the first data point with higher Y value than the bottom of error bar for its instant right neighbor</bold>. During the experiments, the "real" dataset consists of two clusters and different reference datasets are used, <italic>Left</italic>, uniform reference distribution are used, sample number differences are equal, 2-fold, 3-fold and 5-fold from bottom to top, gap statistics works; <italic>middle</italic>, uniform reference are used, sample number differences are 7-fold, 9-fold and 10-fold from bottom to top, gap statistic fails; <italic>right</italic>, two clusters having 10-fold difference in sample number, Gaussian distribution is used as reference distribution for the cluster with larger sample numbers, and the cluster number is estimated accurately.</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p>Information on seven polygon phenotypes used in simulation.</p></caption></fig> <fig position="float" id="F4"><label>Figure 4</label><caption><p><bold>Performance of our method on synthetic datasets with different sets of existing phenotypes</bold>. For different number of "existing phenotypes" (X-axis), the performance on all seven types of polygons is summarized. Accuracy (Y-axis) indicates the ratio of test samples restored into its original clusters. All accuracy values are averaged across experiments with 50 different orders of image input and different composition of existing phenotypes (for number of existing phenotype 1–6, we have 7, 21, 35, 35, 21 and 7 different compositions, respectively).</p></caption></fig> <fig position="float" id="F5"><label>Figure 5</label><caption><p><bold>Box and whisker plots indicating the robustness of performance under different condition</bold>. The accuracy of each experiment is sorted in descending order and plotted on the Y-axis, the two horizontal edges of boxes indicate upper and lower quartile of accuracy values while the red line in the box body shows the median value. The whiskers and lines extending from the end of boxes show the extent of the rest data, and red crosses (+) are outliers with accuracy values beyond 1.5 times of inter quartile range. The performances on two polygon types are shown. Accuracy values of different experiments with different image input order but the same number of existing phenotypes are summarized in box and whisker plots. <italic>Upper</italic>, performance on ellipses phenotype; <italic>Lower</italic>, performance on 16-point stars phenotype.</p></caption></fig> <fig position="float" id="F6"><label>Figure 6</label><caption><p><bold>Performance comparison between our methods and SVM based methods on two occasions</bold>. In each experiment, six polygon types are used as existing phenotypes. Accuracy denotes the ratio of samples restored to its original phenotypes. All the accuracy values are averaged across 100 tests having different order of image input. Four different sets of parameters are used for SVM based method. <italic>Left </italic>Ellipses serve as novel phenotype, the other six serve as existing phenotype; <italic>Right </italic>16-point stars serve as novel phenotype.</p></caption></fig> <fig position="float" id="F7"><label>Figure 7</label><caption><p>Information of four existing phenotypes in training dataset.</p></caption></fig> <fig position="float" id="F8"><label>Figure 8</label><caption><p><bold>Performance comparison between our method and SVM based methods with multiple phenotypes in images</bold>. Given certain group of existing phenotypes, and images including multiple phenotypes, the accuracy values for four phenotypes across 50 image input orders are shown. Four different sets of parameters are used for SVM based method. <italic>Left </italic>Normal and LPA as existing phenotypes; <italic>Middle </italic>Normal and CCA as existing phenotypes; <italic>Right </italic>Normal and Rho as existing phenotypes.</p></caption></fig> <fig position="float" id="F9"><label>Figure 9</label><caption><p><bold>Box and whisker plots indicating the robustness of performance with multiple phenotypes in images</bold>. The accuracy of each experiment is sorted in descending order and plotted on the Y-axis, the two horizontal edges of boxes indicate upper and lower quartile of accuracy values while the red line in the box body shows the median value. The whiskers and lines extending from the end of boxes show the extent of the rest data, and red crosses (+) are outliers with accuracy values beyond 1.5 times of inter quartile range. Given certain group of existing phenotypes, and images including multiple phenotypes, the accuracy values for four phenotypes across 50 image input orders are shown. <italic>Top </italic>Normal and LPA are existing phenotypes; <italic>Middle </italic>Normal and CCA are existing phenotypes; <italic>Bottom </italic>Normal and Rho are existing phenotypes.</p></caption></fig> <fig position="float" id="F10"><label>Figure 10</label><caption><p><bold>Information for the <italic>rl</italic>/tear-drop phenotype</bold>. "Typical cells" summarizes the properties of the <italic>rl</italic>-tear drop phenotype and "Typical image" shows an image with cells merged by <italic>rl</italic>-tear drop, LPA and Normal phenotype respectively.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Cross validation results on overcoming the bias of cluster size difference. By using distribution models as reference distribution gap statistics can give correct result even under 10-fold difference.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Difference between sample number of <italic>ℙ</italic><sub>1 </sub>and <italic>ℙ</italic><sub>2</sub></td><td align="left">Average cluster number estimation accuracy % (Uniform reference distribution)</td><td align="left">Average cluster number estimation accuracy % (GMM as reference distribution for <italic>ℙ</italic><sub>1</sub>, uniform reference for <italic>ℙ</italic><sub>2</sub>)</td></tr></thead><tbody><tr><td align="left">Equal</td><td align="left">100</td><td align="left">100</td></tr><tr><td align="left">2-fold</td><td align="left">88.5</td><td align="left">98.1</td></tr><tr><td align="left">3-fold</td><td align="left">81.8</td><td align="left">93.3</td></tr><tr><td align="left">5-fold</td><td align="left">69.2</td><td align="left">91.0</td></tr><tr><td align="left">7-fold</td><td align="left">&lt;20</td><td align="left">89.5</td></tr><tr><td align="left">9-fold</td><td align="left">&lt;20</td><td align="left">88.9</td></tr><tr><td align="left">10-fold</td><td align="left">&lt;15</td><td align="left"><bold>87.4</bold></td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Cross validation results on merging cells into existing phenotypes</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Phenotype</td><td align="left">Average merging accuracy and standard deviation %</td><td align="left">Typical Mistakes</td></tr></thead><tbody><tr><td align="left">Normal</td><td align="left">98.6 (1.7)</td><td align="left">left alone</td></tr><tr><td align="left">LPA</td><td align="left">93.8 (2.9)</td><td align="left">Merged into Normal, left alone</td></tr><tr><td align="left">CCA</td><td align="left">92.4 (2.4)</td><td align="left">left alone</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T3"><label>Table 3</label><caption><p>Cross validation results on discovering new phenotypes</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Phenotype to be identified</td><td align="left"># of cells to be identified</td><td align="left">Average accuracy with standard deviation %</td><td align="left">Typical Mistakes</td></tr></thead><tbody><tr><td align="left">Normal</td><td align="left">1000</td><td align="left">95.2 (3.5)</td><td align="left">Left alone</td></tr><tr><td align="left">LPA</td><td align="left">1000</td><td align="left">90.3 (3.1)</td><td align="left">Merged into Normal, left alone</td></tr><tr><td align="left">CCA</td><td align="left">600</td><td align="left">89.6 (2.7)</td><td align="left">Merged into Rho1</td></tr><tr><td align="left">Rho1</td><td align="left">600</td><td align="left">87.4 (4.2)</td><td align="left">Left alone</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-264-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>≜</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mn>...</mml:mn><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-264-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>≜</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-264-i4" overflow="scroll"><mml:semantics><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi mathvariant="double-struck">S</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∪</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>s</mml:mtext><mml:mtext>.t</mml:mtext><mml:mtext>. </mml:mtext><mml:mo>∀</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>∈</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2...</mml:mn><mml:msub><mml:mi>K</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>∩</mml:mo><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>∅</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-264-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" name="1471-2105-9-264-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>v</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M24" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M25" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M26" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M27" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M28" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M29" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M30" name="1471-2105-9-264-i10" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup><mml:mo>∪</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M31" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M32" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M33" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M34" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M35" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M36" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M38" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M39" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M40" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M41" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M42" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M43" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M44" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M45" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M46" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M47" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M48" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M49" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M50" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M51" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M52" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M53" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M54" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M55" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M56" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M57" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM3"><label>(3)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M58" name="1471-2105-9-264-i11" overflow="scroll"><mml:semantics><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>∼</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:msub><mml:mi>π</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mi>N</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>π</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>Σ</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>...</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:msub><mml:mi>π</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>π</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M59" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M60" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M61" name="1471-2105-9-264-i12" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>π</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>π</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi>μ</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>μ</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi>Σ</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>Σ</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M62" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M63" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M64" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M65" name="1471-2105-9-264-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M66" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M67" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M68" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M69" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M70" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M71" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M72" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M73" name="1471-2105-9-264-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>i</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>∈</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:munderover><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mstyle></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M74" name="1471-2105-9-264-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mi>n</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:msub><mml:mi>D</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M75" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M76" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M77" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M78" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M79" name="1471-2105-9-264-i15" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>...</mml:mn><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>...</mml:mn><mml:mi>K</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M80" name="1471-2105-9-264-i16" overflow="scroll"><mml:semantics><mml:mrow><mml:mover><mml:mi>l</mml:mi><mml:mo>_</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mi>b</mml:mi></mml:munder><mml:mrow><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mo>∗</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo>/</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M81" name="1471-2105-9-264-i17" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>s</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mi>b</mml:mi></mml:munder><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mo>∗</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mover><mml:mi>l</mml:mi><mml:mo>_</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>/</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:msqrt></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M82" name="1471-2105-9-264-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msqrt><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>B</mml:mi><mml:mrow><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msqrt></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM4"><label>(4)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M83" name="1471-2105-9-264-i19" overflow="scroll"><mml:semantics><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>G</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>B</mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mi>b</mml:mi></mml:munder><mml:mrow><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>b</mml:mi></mml:mrow><mml:mo>*</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>G</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>G</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>k</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>inf</mml:mi><mml:mo>⁡</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>...</mml:mn><mml:mi>K</mml:mi></mml:mrow></mml:munder><mml:mo stretchy="false">(</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>≥</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M84" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M85" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M86" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M87" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M88" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M89" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M90" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M91" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M92" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M93" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M94" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M95" name="1471-2105-9-264-i20" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="double-struck">F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo>∪</mml:mo><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM5"><label>(5)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M96" name="1471-2105-9-264-i21" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mo>_</mml:mo><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="double-struck">F</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>∪</mml:mo><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M97" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M98" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M99" name="1471-2105-9-264-i22" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>∪</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>'</mml:mo></mml:msup></mml:mrow></mml:munderover><mml:mrow><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mstyle><mml:mo>,</mml:mo><mml:mo>∀</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>∈</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2...</mml:mn><mml:msup><mml:mi>K</mml:mi><mml:mo>'</mml:mo></mml:msup></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>∩</mml:mo><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>∅</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M100" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M101" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M102" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M103" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M104" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M105" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M106" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M107" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M108" name="1471-2105-9-264-i23" overflow="scroll"><mml:semantics><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo>←</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo>−</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>∩</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>←</mml:mo><mml:msub><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>∪</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>∩</mml:mo><mml:mi mathvariant="double-struck">E</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M109" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M110" name="1471-2105-9-264-i24" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi mathvariant="double-struck">F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>⊇</mml:mo><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M111" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M112" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M113" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M114" name="1471-2105-9-264-i9" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">F</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M115" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M116" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M117" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M118" name="1471-2105-9-264-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi mathvariant="double-struck">S</mml:mi><mml:mi>m</mml:mi><mml:mo>'</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M119" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M120" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M121" name="1471-2105-9-264-i6" overflow="scroll"><mml:semantics><mml:mi mathvariant="double-struck">E</mml:mi></mml:semantics></mml:math></inline-formula>
<supplementary-material content-type="local-data" id="S1"><caption><title>Additional file 1</title><p><bold>Supplementary materials on performance validation and algorithm details</bold>. Methods of simulating real cells using polygons are noted. Documents and results for two more validation experiments are provided, and two published dataset using different organisms were involved in these experiments. More details of four existing phenotypes used in the main text are presented, including the histogram of specific feature and key parameters for estimated GMM. Our improvement on gap statistics method and one-class SVM novelty detection are also discussed in detail.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S2"><caption><title>Additional file 2</title><p><bold>Performance comparison on restoring biological meaningful cluster from published high throughput screen dataset</bold>. These two histograms report the comparisons on the ability of restoring biological meaningful pheno-clusters between our method and SVM based method. The comparison carried out on a published high throughput screen dataset based on <italic>Drosophila </italic>BG-2 cell line, and results using two different groups of existing phenotypes are presented separately.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S3"><caption><title>Additional file 3</title><p><bold>Typical images and information for datasets of four cell cycle phases in HeLa cells</bold>. In this figure, typical images and some information from a published dataset of HeLa cells are summarized. This dataset consists of single channel fluorescent images of HeLa nuclei in four cell cycle phases and it was used to illustrate the prospect of combining our method to dataset from various organisms.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S4"><caption><title>Additional file 4</title><p><bold>Performance comparison on cell cycle phase identification using HeLa dataset</bold>. These three histograms report performance comparisons between our method and SVM based method. The comparisons were carried out on the HeLa dataset described in Additional file ##SUPPL##2##3##, and the results using three different groups of existing phenotypes are presented separately.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S5"><caption><title>Additional file 5</title><p><bold>Information on four existing phenotypes for case 1–4: histogram for major axis length and complete model parameters</bold>. This figure extends the information in Figure ##FIG##6##7## of main text. The histogram for major axis length helps to show the necessity of modelling each morphological feature using GMM, and the parameters of estimated models are also available.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S6"><caption><title>Additional file 6</title><p><bold>Improving the strategy of taking reference dataset for gap statistics: motivation and innovation</bold>. This figure illustrates why we have to modify the strategy of taking reference dataset in the context of online phenotype discovery and how we work it out. The limitations of existing method, as well as the idea of our improvement are illustrated.</p></caption></supplementary-material>
<graphic xlink:href="1471-2105-9-264-1"/> <graphic xlink:href="1471-2105-9-264-2"/> <graphic xlink:href="1471-2105-9-264-3"/> <graphic xlink:href="1471-2105-9-264-4"/> <graphic xlink:href="1471-2105-9-264-5"/> <graphic xlink:href="1471-2105-9-264-6"/> <graphic xlink:href="1471-2105-9-264-7"/> <graphic xlink:href="1471-2105-9-264-8"/> <graphic xlink:href="1471-2105-9-264-9"/> <graphic xlink:href="1471-2105-9-264-10"/>
<media xlink:href="1471-2105-9-264-S1.doc" mimetype="application" mime-subtype="msword"><caption><p>Click here for file</p></caption></media> <media xlink:href="1471-2105-9-264-S2.tiff" mimetype="image" mime-subtype="tiff"><caption><p>Click here for file</p></caption></media> <media xlink:href="1471-2105-9-264-S3.tiff" mimetype="image" mime-subtype="tiff"><caption><p>Click here for file</p></caption></media> <media xlink:href="1471-2105-9-264-S4.tiff" mimetype="image" mime-subtype="tiff"><caption><p>Click here for file</p></caption></media> <media xlink:href="1471-2105-9-264-S5.tiff" mimetype="image" mime-subtype="tiff"><caption><p>Click here for file</p></caption></media> <media xlink:href="1471-2105-9-264-S6.tiff" mimetype="image" mime-subtype="tiff"><caption><p>Click here for file</p></caption></media>
[{"surname": ["Zhou", "Liu", "Bradley", "Perrimon", "Wong"], "given-names": ["X", "KY", "P", "N", "STC"], "article-title": ["Towards automated cellular image segmentation for RNAi genome-wide screening"], "source": ["Lecture Notes in Computer Science (MICCAI 2005)"], "volume": ["3749"], "fpage": ["885"], "lpage": ["892"]}, {"surname": ["Xiong", "Zhou", "Ji", "Bradley", "Perrimon", "Wong"], "given-names": ["G", "X", "L", "P", "N", "STC"], "article-title": ["Automated segmentation of "], "italic": ["Drosophila "], "source": ["IEEE Transactions on Circuit and Systems"], "year": ["2006"], "volume": ["53"], "fpage": ["2415"], "lpage": ["2424"]}, {"surname": ["Huang", "Velliste", "Murphy"], "given-names": ["K", "M", "RF"], "article-title": ["Feature reduction for improved recognition of subcellular location patterns in fluorescence microscope images"], "source": ["Proceedings of SPIE"], "year": ["2003"], "volume": ["4692"], "fpage": ["307"], "lpage": ["318"]}, {"surname": ["Tibshirani", "Walther", "Hastie"], "given-names": ["R", "G", "T"], "article-title": ["Estimating the number of clusters in a dataset via the gap statistic"], "source": ["Journal of Royal Statistics Society"], "year": ["2001"], "volume": ["32"], "fpage": ["411"], "lpage": ["423"]}, {"surname": ["Sugar", "James"], "given-names": ["C", "G"], "article-title": ["Finding the number of clusters in a dataset: An information-theoretic approach"], "source": ["Journal of the American Statistical Association"], "year": ["2003"], "volume": ["98"], "fpage": ["750"], "lpage": ["763"]}, {"surname": ["Tibshirani", "Walther"], "given-names": ["R", "G"], "article-title": ["Cluster validation by prediction strength"], "source": ["Journal of Computational & Graphical Statistics"], "year": ["2005"], "volume": ["14"], "fpage": ["511"], "lpage": ["528"]}, {"surname": ["Gangnon", "Clayton"], "given-names": ["R", "M"], "article-title": ["Cluster detection using Bayes factors from over-parameterized cluster models"], "source": ["Environmental and Ecological Statistics"], "year": ["2007"], "volume": ["14"], "fpage": ["69"], "lpage": ["82"]}, {"surname": ["Zhou", "Wang"], "given-names": ["X", "X"], "article-title": ["Optimisation of Gaussian mixture model for satellite image classification"], "source": ["IEE Proceedings-Vision, Image and Signal Process"], "year": ["2006"], "volume": ["153"], "fpage": ["349"], "lpage": ["356"]}, {"italic": ["Drosophila "]}, {"surname": ["Wang", "Zhou", "Bradley", "Perrimon", "Wong"], "given-names": ["J", "X", "PL", "N", "STC"], "article-title": ["Cellular phenotype recognition for high-content RNAi genome-wide screening"], "source": ["Journal of Molecular Screening"], "year": ["2008"], "volume": ["13"], "fpage": ["29"], "lpage": ["39"]}, {"surname": ["Manjunath", "Ma"], "given-names": ["BS", "WY"], "article-title": ["Texture features for browsing and retrieval of image data"], "source": ["IEEE Transactions on Pattern Analysis and Machine Intelligence"], "year": ["1996"], "volume": ["18"], "fpage": ["837"], "lpage": ["842"]}, {"surname": ["Cohen", "Daubechies", "Feauveau"], "given-names": ["A", "I", "JC"], "article-title": ["Bi-orthogonal bases of compactly supported wavelets"], "source": ["Communications on Pure and Applied Mathematics"], "year": ["1992"], "volume": ["45"], "fpage": ["485"], "lpage": ["560"]}, {"surname": ["Zernike"], "given-names": ["F"], "article-title": ["Beugungstheorie des schneidencerfarhens undseiner verbesserten form, der phasenkontrastmethode"], "source": ["Physica"], "year": ["1934"], "volume": ["1"], "fpage": ["689"], "lpage": ["704"]}, {"surname": ["Haralick", "Shanmugam", "Dinstein"], "given-names": ["RM", "K", "I"], "article-title": ["Textural features for image classification"], "source": ["IEEE Transactions on Systems, Man and Cybernetics"], "year": ["1973"], "volume": ["6"], "fpage": ["610"], "lpage": ["620"]}, {"surname": ["Mitra", "Murthy", "Pal"], "given-names": ["P", "CA", "S"], "article-title": ["Unsupervised feature selection using feature similarity"], "source": ["IEEE Transactions on Pattern Analysis and Machine Intelligence"], "year": ["2002"], "volume": ["24"], "fpage": ["301"], "lpage": ["312"]}, {"surname": ["Kaufman", "Rousseeuw"], "given-names": ["L", "P"], "source": ["Finding groups in data: an introduction to cluster analysis"], "year": ["1990"], "publisher-name": ["Wiley, New York"]}]
BMC Bioinformatics. 2008 Jun 5; 9:264