THREE-COLOR FLOW CYTOMETRY WITH AUTOMATIC GATING FUNCTION

Abstract: A flow cytometry based system (100) is provided which uses a three color reagent panel (an isotypic control, a helper/T-cytotoxic suppressor/total T-cell reagent, and a NK/B/T-cell reagent) in conjunction with a cytometer which permits direct absolute cell counts. Additionally, a system for automatic accurate selection of subpopulations is provided.

Description: THREE-COLOR FLOW CYTOMET Y WITH AUTOMATIC GATING FUNCTION This application is a continuation-in-part of pending applications Nos. 074,065 and 207,302, filed June 8, 1993 and March 7, 1994 respectively for "Three-Color Flow Cytometry with Automatic Gating Function." BACKGROUND OF THE INVENTION Worldwide, the number of individuals infected with the Human Immunodeficiency Virus (HIV) continues to rise. The World Health Organization estimates over 30-40 million HIV+ cases by the year 2000. Progression of HIV disease to Acquired Immunodeficiency Syndrome (AIDS) now takes, on average, a half-time of approximately 10 years in developed countries. These two factors combined result in an ever increasing need for better tools to monitor HIV disease progression. Understanding of the clinically important factors for monitoring HIV infection has increased significantly in the past few years. This increased understanding has lead the Centers for Disease Control (CDC) to re-evaluate how the stages of HIV disease progression are to be classified. The CDC report concludes that absolute CD4 "1 " T-Lymphocyte count (absolute CD4" " coxint) is the most important marker available to clinicians for staging purposes. Further, the report proposes that AIDS may be defined solely on the basis of absolute CD4 " * " count when it falls below 200. Thus, the CDC has expanded the previous definition of AIDS beyond clinical presentation of "indicator diseases". Finally, the CDC report recommended that physicians use a patient's absolute CD4 "1" count to decide when to begin anti-retroviral and prophylactic therapies. Conflicting reports have been published concerning the benefits to be gained from prophylactic azidothymidine (AZT) therapy in individuals with CD4 " " T-lγmphocyte counts less than 500/uL. However, in clinical practice, initiation of AZT and other therapies is typically based upon absolute CD4 "4" count. Perhaps the most successful of the prophylactic therapies has been against Pneumocystis carini pneumonia (PCP) , the most common opportunistic infection in AIDS. PCP prophylaxis is usually begun at an absolute CD4" " count below 200. Proper timing of prophylactic therapy is a major reason people infected with HIV are living longer, healthier lives than in the early days of the pandemic. Thus, resulting from both the CDC recommendation and accepted clinical practice, the absolute CD4" " count has become the most important criterion in the laboratory determination of AIDS. HIV has been strongly implicated as the causative agent of AIDS. The virus recognizes and binds to "helper" T-lymphocytes via the CD4 antigen expressed on their surface. HIV eventually compromises immunity presumably by mediating the elimination of CD4* T-lymphocytes. Since the CD4 " ' " T-lymphocyte is known to play an important role in the human immune response, the decrease in the absolute number of circulating CD4* T-lymphocytes following HIV infection has been shown to correlate closely with the development of HIV-related conditions. These conditions include pronounced immunodeficiency, opportunistic infections, and cancers. CD4 and other cell-surface antigens are identified by monoclonal antibodies. These antibodies are grouped into "clusters of differentiation" (CD) depending upon the antigen against which they are directed. Specific lymphocyte subsets may be identified by labeling cells with monoclonal antibodies directed against these CD antigens. Conjugating each antibody type with a dye of distinguishable fluorescence allows individual cells to be classified based upon the binding of one or more antibodies in a simultaneous assay. This type of analysis constitutes a direct identification of specific cell types as contrasted with indirect methods such as ELISA which require more controls, and can potentially result in a higher chance of false identification. Flow cytometers are widely used to enumerate cell subsets based upon the binding of fluorescent monoclonal antibodies. These instruments are designed to cause cells in suspension to travel in single-file through a laser beam for interrogation. Cells are then classified by the way in which they scatter the incident laser light, which provides information on the size and internal granularity of the cells. Further, any fluorescent light they may emit permits the detection of specific antibody binding, and thus subsequent cell-subset identification. A general description of standard flow cytometry apparatus and methods is provided in U.S. Patent No. 4,284,412 to Hoffman and Hansen entitled "Method and Apparatus for Automated Identification and Enumeration of Specified Blood Cell Subclasses" and incorporated by reference herein. Many laboratories use two tests to derive the CD4 count. A fluorescence flow cytometer is used to measure the fraction of lymphocytes that are CD4 "" and a hematology instrument is used to count the number of lymphocytes per unit volume of blood. The product of the two measurements gives the CD4 "4 " count. By using the two separate tests, the error is multiplied, making the total variability much greater than for each test alone. Typically, the tests are done in different parts of the laboratory. It is also typical for each test to be done using two different tubes of blood, each collected in a different type of anticoagulant. The samples may not be handled identically, or be run at the same time. These factors further contribute to the error of the determination of CD4 "1" count. Finally, and probably most critically, the hematology portion of the test lacks standardization. Every manufacturer's hematology instrument uses a different technology for determining the lymphocyte count. This can result in a difference in lymphocyte count of 30% or greater between labs that use different hematology instruments. Other laboratory tests have been proposed for monitoring the progression of HIV disease, including CD8"*" T-lγmphocyte count, serum neopterin, beta-2 microglobulin, HIV p24 antigen, soluble interleukin-2 receptors, and immunoglobulin A. None of these cellular or serological markers have been as strongly predictive of disease progression, nor as specific for HIV-related immunosuppression as absolute CD4 " * " T-lymphocyte count. The absolute CD4 "1" count remains the essential laboratory measurement for proper monitoring, staging and clinical management of the HIV infected patient. The current CDC recommended panel for HIV immunophenotyping consists of a six reagent, two-color panel consisting of the following reagents in conjunction with an absolute lymphocyte determination: Hematology or cytometer derived absolute count sample CD45/CD14 CD3/CD4 CD3/CD8 CD3/CD19 CD3/CD16 &/or CD56 These reagents are used in a variety of systems and analysis schemes, each having its own advantages and disadvantages. However, inherent in all are several sources of error. The current CDC recommended panel requires that a patient sample be separated into six aliquots for an analysis on the flow cytometer to obtain the information necessary for a complete T-lymphocyte analysis. Furthermore, this reagent format does not permit direct absolute counts of subsets of cell types. Subpopulations of CD4 T-lymphocytes, for example, are enumerated by determining the ratio of CD4 cells to total lymphocytes. Any error in the initial total lymphocyte count is reflected in the CD4 count. Current algorithms for automatic cell subpopulation detection in flow cytometry are cytσgram specific and cell type specific. Such algorithms typically can only be applied on a forward vs. right scatter cytogram and can only detect lymphocyte populations. Thus, it is an object of the present invention to provide a method for detecting cell subpopulations which can be applied to any cytogram, independent of the parameters which define the cytogram. It is also an object of the invention to provide such a method which is capable of detecting any type of subpopulation represented in a cytogram. The technology for generating absolute CD4 "4" counts has changed little since before the HIV pandemic. The present methods being used to measure absolute CD4 "1" counts reflect little change over the flow cytometry methods in use in 1980. In particular, current flow cytometry methods, by themselves, generally do not enable absolute cell counts, and a separate analysis, such as a hematology test, is required to determine cell counts. It is an object of the present invention to provide an apparatus and method for obtaining direct absolute cell counts in a flow cytometry system. SUMMARY OF THE INVENTION The system of the present invention comprises a cell analysis instrument and method based upon flow cytometry, in conjunction with three components: (1) flow cytometer calibrators; (2) cell labeling reagents; and (3) software for automatically selecting cell populations. When used together, systems in accordance with the present invention provide precise and accurate absolute counts of total cells and subset populations, including absolute CD4* count. The invention encompasses two main aspects. Firstly, a flow cytometry instrument capable of metering a known number of cells per unit volume is used in conjunction with a reagent panel formatted to render detectable specific cells of interest, to permit direct absolute counts of total cells and cell subpopulations. Secondly, a method for identifying and selecting a subpopulation of data points accurately defines the gate region which encompasses the subpopulation of interest, and excludes data points which are not part of the subpopulation. Embodiments disclosed herein are consistent with the recommendations of the CDC. All data and patient reports are generated by completely automated software. Compared to other systems, the present system provides sample preparation which is faster and safer; fewer steps are required and centrifugation is completely eliminated. The data produced are of higher quality than in other systems. The overall result is a savings of time, reduced expense, and less retesting. The present invention provides for automatic cell subpopulation detection that can be applied on any cytogram and can detect any cell subpopulation on that cytogram. Because the algorithm is general, it can be applied in HIV immunophenαtyping, leukemia and lymphoma detection and other areas of research and clinical diagnosis where flow cytometric techniques are used. The present invention incorporates advances in immunology, reagents, instrumentation and automation into an improved system for absolute cell subset analysis. The present invention utilizes a flow cytometer which performs absolute cell-subset counts without the need for additional tests, such as hematology. The result is accurate and reproducible injection of sample at a known rate past the laser beam. Since the time of sample injection may be easily measured, the volume of sample analyzed is known. This principle has been shown to be accurate and reproducible in determining absolute total lymphocyte and CD4* T-lymphocyte levels in peripheral blood. When used in conjunction with the associated reagents and software of the invention, it is possible to: (1) calibrate, verify, and quality control the absolute count function of the flow cytometer, as well as to cross- calibrate individual instruments; (2) obtain all the information provided by the CDC recommended panel, more quickly and safely with less steps than in other systems; (3) provide for patient sample, reagent and system quality control; and (4) to obtain automated data analysis immediately following sample acquisition, while providing for instrument and reagent quality control. Additionally, the instrument design allows function without a significant possibility of aerosol being produced from potentially hazardous samples. When used with an optional automated sample handling unit, the system further reduces the chance of laboratory contamination; once samples are prepared, all additional manipulation and analysis is completely automated in an entirely isolated environment. The system design allows laboratories to routinely acquire accurate and reproducible absolute CD4 counts in a manner superior to other means for measuring CD4, which are more prone to variability. BRIEF DESCRIPTION OF THE FIGURES Figure 1 is a diagrammatic representation of the optical system of a flow cytometer of the present invention using 3-color detection; Figure 2 is a portion of a spreadsheet showing data that may be measured by the flow cytometer. Figures 3 and 4 are a representation of analysis of sample plus control reagent; Figure 5 is a representation of analysis of sample plus labelled CD4/CD8/CD3 reagent; Figures 6 and 7 are a representation of analysis of sample plus labelled CD16/CD19/CD3 reagent; Figure 8 schematically represents three fluid samples that may be analyzed during the operation of the present invention. Figure 9 schematically represents three lists of data that are recorded and used in the present invention. Figure 10 illustrates a processing system that may be used in the practice of this invention. Figures 11A and 11B show a cytogram and a histogram formed from the data measured and recorded by the flow cytometer. Figure 12 schematically illustrates a protocol file used to store data used in the practice of the present invention. Figure 13 is a portion of a matrix of data values. Figures 14A and 14B illustrate a procedure for analyzing data obtained from the first fluid sample. Figures 15A-15F show plots formed from the data obtained from the first fluid sample. Figure 16A and 16B outline a procedure for analyzing data obtained from the second fluid sample. Figures 17A-17D show plots formed from the data obtained from the second fluid sample. Figures 18A-18C illustrate a process for analyzing data obtained from the third fluid sample. Figures 19A-19F are plots formed from the data obtained from the third fluid sample. Figure 19G shows an alternate plot that may also be formed from the data obtained from the third fluid sample. Figure 20 is a cytogram showing a boundary around a cell population. Figure 21 describes some of the variable used in the algorithm employed to identify the boundaries of cell populations. Figure 22 lists the types of cell populations that the boundary algorithm may be used to identify. Figure 23A-23E illustrate a preferred embodiment of the algorithm used to determine the boundaries of cell populations. Figure 24 is a portion of a matrix of data values that may be used in the operation of the algorithm. Figure 25 is a portion of another matrix of data values that may be used in the algorithm. Figure 26 is a graph illustrating several steps of the algorithm. Figure 27 is a table of values used or determined in the operation of the algorithm. Figure 28 is a histogram formed from values in the table of Figure 27. Figure 29 is another table of values used or determined in the operation of the algorithm. Figure 30 is a graph also illustrating several steps of the algorithm. Figure 31 shows the cytogram of Figure 20 after the plots of one cell population have been erased from the cytogram. Figure 32 shows data that may be generated in the operation of this invention. DETAILED DESCRIPTION OF THE INVENTION Flow Cytometer Capable of Direct, Absolute Cell Counts The flow cytometer component of the present invention is capable of metering a known volume of sample at a known rate past the laser. Its syringe-drive fluidics system uses syringes that are driven by precision stepping motors. This is accomplished by the use of a calibration kit which is used to calibrate and quality control the absolute count function of the flow cytometer using a system of microparticle suspensions containing a known number of particles per unit volume. A well-known and widely available flow cytometer and calibration kit useful for this embodiment are available from Ortho Diagnostic Systems Inc., Raritan, New Jersey, under the trade name CYTORONABSOLUTE™. A users' manual titled "Immuno Count User Guide," which describes in detail the instrument and its function is incorporated by reference herein, and is also available from Ortho Diagnostics Systems, Inc. Microparticle calibration offers greater convenience over other protocols since there is no need for separate hematological instrumentation. Conversely, if hematology instrumentation were used in calibration, the accuracy of the flow cytometer would be completely dependent on the accuracy of the hematology instrumentation. Absolute lymphocyte counts performed using hematological methods have been shown to vary by as much as 40% depending on which hematological instrument is used. However, the number per unit volume of stable microparticles in suspension used in the present system are well known. Calibration of the flow cytometer is entirely software-driven. The instrument samples the suspension, and counts the particles up to a predetermined number, while also recording the time required to make the count. From these data, and from the concentration of the calibrators, the instrument calculates the time required to deliver a known volume of sample. Thus, whenever the flow cytometer delivers a sample for that calibrated amount of time, the number of events are measured per known volume. To assure the accuracy of the calibration process, the calibration suspension requires no user intervention prior to sampling. Calibration is thereby made independent of the user's precision pipetting or other dilution, and the risks associated with introduction of a pipette in the calibrator suspension is eliminated. The calibration kit also provides for daily verification of instrument calibration. Three additional suspensions of particles at known number per unit volume are also supplied. The number/volume of these suspensions correspond roughly to values expected from patients with low, normal and high white blood cell counts, respectively. If the concentration values determined by the flow cytometer are within specification, the calibration is verified. Keeping a record of these verification results monitor performance over time and document quality assurance of the instrument's count function. As a result, the data generated with respect to any individual cell type being analyzed, represents an absolute count of those cells. The optical system of a flow cytometer of a preferred embodiment of the invention is shown diagrammatically in Figure 1 and referenced generally therein at 100. Focal to system 100 is a flow channel 102 wherein cells in liquid suspension are passed, in single file and at a rapid rate (e.g. 2500 cells per second), through a sensing zone. The sensing zone is defined by the intersection of cell flow and an incident light beam, typically focused coherent light from a gas laser. As each cell passes through the sensing zone, the cell interacts with incident light in a variety of ways. Some light, of course, is absorbed by the cell, other light is scattered at relatively narrow angles to the axis of incident light, and still other light is scattered at angles quite divergent from the axis of the incident light, for example, at right angles to that axis. Furthermore, depending on the nature of the cell itself, and any dyeing or staining to which the cell may previously have been subjected, fluorescence emissions may also occur. System 100 is configured, in a common manner, to detect light, referred to as forward scattered light, that is scattered forward of cell 102, within a predetermined, relatively narrow angle to the axis of the incident light; and to detect light, referred to as right angle scattered light, that is scattered within a predetermined range of a right angle to the axis of incident light. System 100 also measures three colors of fluorescence, namely green, orange, and red, emitted within a predetermined range, coincident to that of the right angle scattered light. With the preferred embodiment of system 100 illustrated in Figure 1, an argon ion laser 104 emits a laser beam 106 through beam select filter 110 and laser focusing lens 112, from which the beam is directed onto sample dispensed through flow cell 102. Forward scattered light is directed through forward objected lens 114, forward pinhole 116, forward diffuser 120, and into optical fiber cable 122, which collects and directs the forward scattered light to detector 124, referred to as the forward detector. Light that is scattered by the sample in flow cell 102 at, or within a given range of, a right angle to the axis of incident light is directed through right angle objective lens 126 and beam splitter 130. The beam splitter directs part of this right angle scattered light through pinhole 132, laser pass filter 134, diffuser 136, and then is sensed by detector 140, referred to as the right angle detector. The remainder of the right angle scatter light passes through beam splitter 130, fluorescence pinhole 142, green pass filter 144, and then to green dichroic mirror 146, which reflects part of the light incident thereon to green filter 150, detector lens 152 and green fluorescence detector 154. The light passing through green dichroic mirror 146 passes through columnate lens 156 and to orange dichroic mirror 160, where part of the light is deflected through orange filter 162, detector lens 164, and onto orange fluorescence detector 166. The remaining light passing through orange dichroic mirror 160 proceeds through three color red filter 170 and detector lens 172 to red fluorescence detector 174. The optic system shown diagrammatically in Figure 1 represents the system used in CYTORONABSOLUTE™ and is presented to illustrate one embodiment of a flow cytometer that may be employed in this invention. Those skilled in the art will recognize that a flow cytometer optic system may be configured in other ways to achieve the same or suitable results. In the preferred operation of the present invention, a patient's sample is mixed with a reagent, such as one of the three reagents discussed below, and then passed through flow cell 102. As each cell in the sample passes through the sensing zone in the flow cell, the cell interacts with incident light. Typically, the patient's sample includes materials other than cells, and these other materials also pass through flow cell 102 and interact with the incident light. Each interaction of the incident light with an item passing through the flow cell —whether that item is a cell or some other matter— is referred to as an event. For each event —that is, each time the incident light beam 106 interacts with a respective one item or particle in the patient's sample— five parameters are measured and recorded: the intensity of the forward scattered light, as measured by detector 124; the intensity of the right angle scattered light, as measured by detector 140; and the intensities of the green, orange, and red fluorescence emitted by the event, as measured by detectors 154, 166 and 174 respectively. The total range over which each parameter can be measured is divided into a number of channels, such as 256 channels. When the intensity of a particular type of light is measured, the channel relative to the intensity measured is recorded, rather than the actual intensity itself. Thus, for instance, for a particular event, the measured forward scattered light may be recorded as "72," indicating that the intensity of that light was measured in the 72nd of the 256 available channels that cover the total range over which the forward scattered light can be measured by the cytometer. For another event, the measured red fluorescence may be recorded as "134," indicating that the measured value of the red fluorescence caused by that event was measured in the 134th of the 256 channels available over the range that the red fluorescence can be measured by the cytometer. Preferably, for each measured type of parameter, the channels used to measure the parameter are contiguous but do not overlap, so that each measured value, within the range of the cytometer, falls into one and only one of the 256 available channels. Moreover, preferably these channels have equal widths —that is, the difference between the upper and lower limits of each channel is the same for all the channels. To identify the channels, they may be numbered in consecutive order, with the channel numbers increasing in the same order or direction as the value of the parameter represented by those channels. Figure 2 is a portion of a spreadsheet illustrating the manner in which data is preferably recorded. On this spreadsheet, the intensities of the forward scattered light, the right angle scattered light, and the green, orange, and red fluorescence are represented by FW-SC, RT- SC, GR-FL, OR-FL, and RD-FL respectively. Also, each event is identified by a number; and, for example, the events may be numbered in sequence in the order in which they occur. Figure 2 shows data recorded from 12 different events. For instance, for event number 16, the measured forward scattered and right angle scattered light are 63 and 86 respectively, and the measured green, orange, and red fluorescence are 150, 13, and 30 respectively. For event number 742, the measured forward scattered light and right angle scattered light are 124 and 52 respectively; and the measured green, orange, and red fluorescence are 14, 184 and 18 respectively. Three Color Reagent Panel The reagents used in the present invention are an immunophenotyping system using specifically formatted 3- color monoclonal antibody reagents. When used in a preferred embodiment, these provide for the identification and enumeration of T, B and NK cell lymphocyte subsets, as well as total lymphocyte counts, using only three sample tubes. This reagent system represents a reduction in the amount of tubes required to obtain the same amount of data as obtained from the CDC recommended two-color panel using six tubes. Additionally, the reagents distinguish between specific and non-specific antibody/cell interactions, allow for spectral compensation of the instrument, correct for inherent sources of error, and provide for the quality control of the patient sample, reagent, and system. When formatted to analyze lymphocytes, the system comprises three reagents: an isotypic control, a T- helper/T-cytotoxic suppressor/total T-cell reagent, and a NK/B/T-cell reagent. Each reagent consists of three monoclonal antibodies, each with different specificities, each conjugated to a different fluorochrome. The fluorochromes chosen must either have emission spectrums which are non-overlapping or whose overlap can be electronically or mathematically compensated. If spectral compensation is necessary, the antibody-fluorochrome conjugate combinations must be chosen so that compensation can be checked and adjusted using either one or both of the two positive staining reagents. Identical conjugates of non-leukocyte specific mouse monoclonals of the same isotype as the positive specificities are also necessary for use as negative staining controls. A specific example of antibody-conjugate combinations to produce a reagent panel with the desired characteristics for analyzing lymphocytes are: 1. Control IgGl-Fluorescein Isothiocyanate (FITC) + IgG2a-FITC/IgGl-Phycoerythrin (PE) + IgG2a-PE/IgG2a- Carbonocyanine-5/Phycoerythrin Tandem (CyP) 2. CD4-FITC/CD8-PE/CD3-CyP 3. CD16-FITC/CD19-PE/CD3-CyP These fluorochromes are all excited by the 488 nm emission line from an argon laser, and permit their fluorescence detection in the green (FITC), orange (PE), and red (CyP) regions of the spectrum, respectively. Spectral compensation is accomplished electronically. The assay format used produces staining of all lymphocyte subsets with sufficient signal to noise S/N ratios. Typically, the red cells must be lysed, and the leukocyte viability and light scatter characteristics must be maintained to allow identification of the leukocyte populations. Acceptable resolution between cell populations and debris is also important. Any physical manipulation which may cause random or specific cell loss within the WBC subsets is not present in the procedure. In a manner more specifically discussed below, each reagent provides for the following when used on flow cytometry: Isotypic Control - By gating on the lymphocyte population of cells, as determined by light scatter, the absolute lymphocyte count may be determined. The green, orange, and red fluorescence of the lymphocyte population may be examined, and statistical regions may be set to delineate levels of non-specific binding and autofluorescence. These phenomena are thereby elminated in measurements of negative and positive staining with subsequent reagents. CD4/CD8/CD3 - Based on light scatter parameters, an lymphocyte count may be obtained. Plotting red fluorescence against right-angle light scatter permits the CD3 " * " cells to be distinguished from the other populations, and an absolute count to be obtained. Examining this CD3 "1" population further for green and orange fluorescence permits the identification of CD4" ~ and CD8 " * " populations as well as an absolute count of each. CD16/CD19/CD3 - Again an absolute lymphocyte and absolute T-cell count may be determined using the methods above. Examination of the orange fluorescence versus right angle scattering permits measurement of the absolute B-cell count. Examination of the green fluorescence versus right angle scattering allows a determination of the absolute count of CD16 "1" cells, and examination of the red fluorescence of the CD16 " * " population enables the detection of an absolute count of CD16 ~ CD3 ' * ~ cells. Subtracting the count of cells that are CDlβ^CDS "4" from the count of cells that are CD16 " * " produces a count of the number of cells that are CDlδ^CDS " . These latter cells are the NK cells. Using this complete set of reagents for each patient sample permits the determination of triplicate direct absolute total lymphocyte count, duplicate direct absolute CD3 "4" T-cell count, absolute NK cell count, and absolute B cell count. A positive, immunological determination of the absolute lymphocyte count can also be determined from the absolute T cell, NK cell, and B cell counts. This latter method is free from potential RBC, monocyte and platelet contamination, which often compromise determinations based exclusively upon light scatter parameters. The lymphocyte population may be determined more positively than with a CD45/CD14 reagent. Antibody against CD45 is not specific for lymphocytes and only about 80% of contaminating monocytes would be expected to bear CD14. In contrast, the present reagents are used with immunoscatter gating to positively identify the three subsets of cells that comprise lymphocytes. The lymphocyte absolute count is quality controlled by comparing the sum of NK*, B* , and T-cell subsets to the light scatter-gated lymphocyte determination. The present reagents use anti-CD16 instead of anti-CD56 to identify NK cells; compared to CD56, CD16 antigen expression on NK cells remains relatively constant during the course of HIV infection. A data acquisition and analysis scheme is diagrammatically represented in the attached Figures 3-7, using the three tube reagent panel given as an example above. The results obtained from each tube are also listed. The control stained patient sample is run or processed first. A light scatter lymphocyte gate is either manually or, in the preferred embodiment, automatically set around the lymphocyte population, and an absolute lymphocyte count is determined (Figure 3). The green and orange fluorescent distributions for the negative control stained lymphocytes are then plotted on a green vs. orange fluorescence cytogram. Statistical regions are set in order to delineate double negative, orange only, green only, and green + orange stained cells from one another in the other two tubes of the assay (Figure 3). The red fluorescent disbribution for the negative control stained lymphocytes is then plotted on a red fluorescence histogram. Statistical regions are set in order to delineate negative and positive cells from one another in the other two tubes of the assay. The non- specific fluorescent background in each of the three immunoscatter gate search regions to be used in the following two tubes, is also determined (Figure 4). The CD4/CD8/CD3 stained sample is run or processed next (Figure 4). An absolute lymphocyte count is determined using a light scatter gate, and an "immunoscatter" gate is set around the CD3 "1" events, resulting in an absolute T-cell determination. The CD3 " * " cells are then plotted on the green vs. orange (CD4 vs. CD8) fluorescence cytogram, resulting in absolute CD4 and CD8 count determinations. A CD4 to CD8 ratio could be calculated at this point, as well. An additional CD3" 1" absolute T-cell determination may also be made by plotting the light scatter gate lymphocytes on a red fluorescence histogram. Finally, the CD16/CD19/CD3 sample is run or processed. Again, an absolute lymphocyte count is determined using a light scatter gate, and an immunoscatter gate is set around the CD3* events, resulting in another absolute T-cell determination (Figure 6). The absolute count of the CD16 "1" and CD19 "1" events are determined using two immunoscatter gates (Figure 7). Examination of the red fluorescence of the CD16 "1" population permits the detection of the absolute count of D16- t O 3- > - cells (Figure 7). Although it is rare for T- cells to express CD16, if such T-cells are present they must be subtracted from the absolute CD16" " count determination in order to determine accurately the number of NK-cells, all of which are CD16*CD3 " . An absolute count of the NK cells is therefore determined by subtracting the number of cells that are CD16" ~ CD3 " " from the number of cells that are CD16" ~ . A summary of the results and data corrections. calculations, and cross-checks obtained from a sample are listed below. RESULTS AND CROSS-CHECKS Tube Specific Raw Data: Control Tube: Absolute Lymph: 2441 FL 1 Immunoscatter Gate Fluor Bkgrd: 1 FL 2 Immunoscatter Gate Fluor Bkgrd: 0 FL 3 Immunoscatter Gate Fluor Bkgrd: 0 CD4/CD8/CD3 Tube: Absolute Lymph: 1922 Absolute CD3 (Immunoscatter Gate) 1410 Absolute CD4+ T-cells: 737 Absolute CD8+ T-cells: 592 Absolute CD3 (Lymph Gate): 1350 NK/B/T Tube Absolute Lymph: 1833 Absolute CD3 (Immunoscatter Gate): 1355 Absolute CD19+ B-cells: 200 Absolute CD3+CD16+ Lymphs: 5 Absolute CD16+ Lymphs: 279 Absolute CD3 (Lymph Gate) 1285 Cross-checks/Corrected data Mean Absolute Lymph: 2065 Sum of CD3+CD19+CD16*CD3-: 1830 Mean Absolute CD3 (Immunoscatter Gate): 1382 CD16*CD3- NK-cells: 274 Mean Absolute CD3 (Lymph Gate) 1318 Sum of CD4* + CD8 * 1330 CD3 Immunoscatter Gate I Bkgrd Fluor 0.0% CD3 Immunoscatter Gate II Bkgrd Fluor 0.0% CD 16 Immunoscatter Gate Bkgrd Fluor 0.6% CD 19 Immunoscatter Gate Bkgrd Fluor 0.0% REPORTED RESULTS Lymphocyte Count (ImmuneSum) : 1830 cells/ul Mean Absolute CD3: 1382 cells/ul Absolute CD4 " * " T-cells 734 cells/ul Absolute CD8 "1" T-cells 592 cells/ul Absolute CD19 " " B-cells 200 cells/ul Absolute CD16 ÷ CD3 " NK cells 274 cells/ul CD4/CD8 Determination: 1.2 CD4* T-cells as % of ImmunoSum 40.3% CD8+ T-cells as % of ImmunoSum 32.4% CD3+ T-cells as % of ImmunoSum 75.5% CD19+ B-cells as % of ImmunoSum 10.9% CD16+CD3- NK-cells as % of ImmunoSum 15.0% If fluorescent background events were detected in the immunoscatter gates of the Control sample, their statistical significance can be determined, or possibly subtracted from the appropriate absolute count determinations. If events were detected, they can be subtracted from the CD16" " absolute count determination. In addition, within each patient sample, triplicate absolute lymphocyte counts, and duplicate absolute CD3 determinations were made which can be compared, a confidence level determined, and if applicable, their mean taken. The sum of the CD3*, CD19 " * " , and CD16 " * " CD3 ~ events can be calculated. This provides an absolute lymphocyte count derived by a method which does not include the potential RBC, monocyte, and platelet contamination possible in light scatter gate determinations. This sum, referred to as the immunosum absolute lymphocyte count may then be compared to the mean absolute lymphocyte determination by light scatter. This provides a more thorough check of lymphocyte determination, than with the use of a CD45/CD14 reagent. All potential contaminating cell types are eliminated from this determination, not just the monocytes eliminated by CDC recommended CD45/CD14. The end result is a patient summary report which contains all of the clinically relevant data which can be obtained from the larger CDC recommended 2-color panel. The advantages of the present invention are faster and safer preparation of samples, higher sample through-put, reduced need for retesting, and more accurate data. In addition, since the sample preparation is simplified, and the analysis algorithm is similar for each reagent, the result is a system which can be easily automated. This translates into substantial cost savings for the large clinical laboratory, and clinically relevant results which can be reported with a high level of confidence. Automatic Selection of Cell Populations The software component of the invention allows for the flow cytometer to collect and automatically analyze data, and generate reports for each sample at run time. The algorithm provides for the quality control of patient samples, reagents, and instrumentation. For the automatic identification of cell populations, the software provides for predefined automatically generated gate detection regions. These detection regions may be positioned anywhere in two-parameter data space. After data acquisition from each sample, the software automatically attempts to detect a cell population within each defined region. This process of automated population identification is referred to as "autogating". The ability to autogate a cell population is a criterion for abnormal sample detection used in quality control. If the system is unable to successfully autogate the lymphocyte population, or any other population of interest, or if the lymphocyte peak is in an abnormal position, the sample is flagged for reanalysis. Further sample quality control is obtained through several internal data checks. The lymphocyte count obtained from forward versus right angle light scatter is compared to the sum of the counts of the NK" " , B" " , and T "4" cells. When the comparison falls out of range, the sample is flagged as suspect. The preferred software also monitors instrument quality control by tracking the sensitivity and stability of the flow cytometer. The system allows the user to enter, acquire, track and maintain instrument quality control data. The stability of the optical components of the system is monitored by measuring the mean and co¬ efficient of variance of the two light scatter parameters, and three fluorescent parameters of the instrument. The stability of the fluids system and absolute count capabilities are also quality controlled. The software also allows for tracking reagent quality control in a lot- specific manner. All quality control information is stored in the data base. The user may view or print Levy- Jennings charts for each of the quality control parameters, on a weekly or monthly basis, for a time interval specified by the user. In addition to quality control reports, the software also preferably generates system configuration, sample configuration, and patient test result reports. With regard to lymphocyte analysis, in particular, patient test results can include (1) absolute counts of total lymphocytes, T-cells, CD4* T-Cells, CD8 " * " T-cells, B-cells, and NK-cells; (2) a calculated CD4/CD8 ratio; and (3) CD3*, CD4- 4" , and CDδ* T-cells, B-cells, and NK-cells expressed as a percentage of total lymphocytes. The ImmunoSum is preferably used as the total lymphocyte count, and in preferably used as the denominator when expressing the lumphocyte subsets as a percentage of lymphocytes. Flexible patient identification and comment fields are also a standard part of these reports. If a display of the actual data is desired, a cytogram or histogram may also be printed in a choice of formats. The related statistical results associated with any region or gates may also be printed. The algorithm is adaptable to be applied to any data list displayed in any number of parameters. In its presently preferred embodiment, the algorithm works on any two parameter cytogram. The user specifies a detection region, which is typically rectangular, within which the software is to detect some cell subpopulation, represented by some cluster of data points. The software detects the cluster and specifies the cluster boundaries by drawing around the cluster a polygon, referred to as the autogate. In a preferred embodiment, the autogate is defined by 36 points. In addition, the user specifies, via an input parameter, how closely around the cluster to draw the 36 point polygon. The algorithm is generally applicable to any cytogram. The algorithm uses image processing techniques to detect patterns within the user defined autogate zone (sensing zone). In a preferred embodiment, the cytogram data is stored in a 256 by 256 channel matrix. The algorithm transforms the 256 by 256 cytogram matrix according to a user specified parameter. If the parameter is 1 the cytogram matrix is left undisturbed (still a 256 by 256 matrix). If the parameter is 2, the algorithm applies a 2 by 2 convolution kernel (low pass filter), thus effectively reducing the cytogram to a 128 by 128 matrix. The low pass filter has the effect of blurring the image so that details can be removed and large object (cell subpopulation) extraction can take place. In effect, this kernel transforms the 256 by 256 matrix to a 128 by 128 matrix. If the user defined parameter is 4, the matrix is transformed to a 64 by 64 matrix (a 4 by 4 convolution kernel is applied) . The user defined parameter determines how fuzzy the transformed image is in relation to the original 256 by 256 matrix and how tight the autogate is around a cell subpopulation. A parameter of 1 creates a very tight gate (the polygon is close to boundaries of the cell subpopulation) around a pattern on a cytogram. A parameter of 2 defines a looser gate around a cell subpopulation because the pattern within the autogate zone has been blurred. A parameter of 4 defines an even looser gate. The ability to tune the algorithm gives the researcher and the clinical technician great flexibility because the algorithm can be customized to specific needs. The algorithm then finds a peak within the user defined autogate zone (sensing region) on the transformed matrix. The algorithm scans the portion of the cytogram matrix within the autogate zone an element at a time. Edge matrix elements may be excluded in the scan. The autogate zone may be separated into a multitude of overlapping subzones of matrix elements, with each subzone consisting of, for example, a three-by-three group of matrix elements. The edge matrix elements are not included in the 3 by 3 regions. Each of these groups of matrix elements is provided with a value equal to the sum of the number of events in each element in the group. The algorithm then searches for the group of matrix elements having the largest of these sums, and the peak is considered to be the matrix element in the middle of the 3 by 3 matrix group having that largest sum. The algorithm then calculates the x and y coordinates of each of 36 points defining the boundary of the autogate using a 10 degree radial projection algorithm, following radial projections from the gate peak at 10 degree intervals. The x, y coordinates for a boundary point are determined by scanning along a radial projection from the peak point. The boundary point is that point at which there is a minimum density of data points, usually 0. After the boundary points have been determined, it is desirable to recalculate the position of the peak as the average of the 36 points defining the autogate, and then to recalculate the 36 point autogate using the algorithm based on the new gate peak. The peak and autogate are recalculated because a detected peak may lie close to the edge of an autogate zone. In order to move or pull the peak closer to the center of the autogate zone, the new peak is calculated by averaging the values of the x and y coordinates of the points defining the first calculated autogate. The newly calculated peak is then used to recalculate a new 36 point autogate. The peak is pulled closer to the center since the algorithm follows the rule that the autogate must be inside the autogate zone (clipped within the autogate zone) . The algorithm can be further extended by specifying to it, via the use of the mini interpreted language, to clip within the autogate zone or not to clip within the autogate zone. In addition, the user may define multiple overlapping autogate zones. This technique can be used, especially in flow-cytometry, to detect and distinguish overlapping cell populations. The data within the calculated autogate is then subtracted from the transformed cytogram matrix. The process of finding and subtracting peaks from the cytogram matrix may be repeated until a number of peaks have been found. In a preferred embodiment, the algorithm can find up to five peaks representing five cell subpopulations, within the same autogate zone. The algorithm then evaluates which of the peaks is more pronounced or more important. The evaluation criteria are: (1) count of cells within the autogate, i.e. the autogate is more important if it has more cells in it (linear proportionality law); and (2) The gate is more important if it is closer to the center of the autogate zone (inverse square law). In a preferred embodiment, the count of cells within the autogate is divided by r 2 , where r is the distance from the peak of the autogate to the edge of the autogate zone. Thus, the most intense peak which is closest to the center of the autogate zone is selected, and peaks closer to the edge, which belong to cell populations other than the one being selected, are excluded. The autogating capability of the present invention enables the selection of particular data subsets, or cell populations, to be made more accurately than previous gating methods, which specified a fixed rectangular gate region around the selected population. By forming a polygonal gate region around the population, which varies in configuration according to the density of the data points enclosed therein, the present invention provides a higher degree of certainty that all of the data points of a selected population are included in the gate, and that data points representing other populations are excluded. Furthermore, the ability to adjust the tightness of the autogate avoids the possibility that a boundary point generated by a radial projection from the peak point will be located inside the actual boundary of the selected population. That is, it is possible that when a radial projection is scanned, a density minimum will be encountered which is located within, rather than at, the actual boundary of the selected population. In this case, a false boundary point would be generated and some of the desired data points would be excluded from the resulting gate. This problem may be avoided by the choice of the convolution kernel which transforms the matrix. By fuzzing the matrix, such false density minima are eliminated. The criteria outlined above are specific to a preferred implementation of the algorithm. The evaluation criteria can change from one algorithm implementation to the next. Therefore, one can extend this system by enabling the algorithm to read evaluation criteria from a file. The evaluation criteria can be easily changed with an editor. The algorithm will be language driven. A small language interpreter can be implemented to read, interpret and implement the algorithm's evaluation criteria. Further enhancements to this algorithm include the actual identification of specific cell subpαpulations by using statistical fitting techniques to the cell subpopulations detected, for example, by fitting to a Gaussian distribution. One preferred embodiment of the invention may be further understood by referring to the following pseudocode description of the autogate algorithms. AUTOGATE ALGORITHM: INPUT PARAMETERS: Gate_Tightness (possible values 1,2,4). Upper_Left_Autogate_Zone_X. Upper_Left_Autogate_Zone_Y. Lower_Right_Autogate_Zone_X. Lower_Right_Autogate_Zone_Y. Cytogram Matrix. OUTPUT PARAMETERS: A list of 36 (X,Y) points forming the autogate. START ALGORITHM BODY. Transform_Cytogram_To_Convolved_Cytogram( ) while (Find _Peak( ) ) do set Autogate zone equal to edges of convolved matrix. call Make_Autogate( ) // // create a new peak by taking the average of the autogate // call Average_Autogate( ) // // Pass the new peak along with the dimensions of the autogate zone. // set Autogate zone equal to edge of search region, call Make_Autogate( ) Subtract the data within the final 36 point autogate from the Cytogram Matrix bounded by the Autogate Zone. Save the peak and the corresponding 36 point autogate. If the number of peaks detected is greater than 5 then exit the while loop, endif done for each detected peak do Score for current peak is number of cells within the autogate zone/the distance of the peak from the center of the autogate squared, if the score for the current peak is better than the best peak score found then replace the best peak score with the current score. endif done The 36 point autogate is the one corresponding to the peak with the best score. END ALGORITHM PROCEDURE Transform_Cytogram_To_Convolved_Cytogram( ) INPUT PARAMETERS: Cytogram Matrix Size of the Convolved Cytogram Matrix OUTPUT PARAMETERS: Convolved Cytogram Matrix START PROCEDURE BODY if Gate_Tightness is 1 then for each element of the Convolved Matrix Convolved Cytogram Matrix element is equal to Cytogram Matrix element, end for else if GateJTightness is 2 then for each element of the Convolved Matrix Convolved Cytogram Matrix element is equal to the sum of the elements of the 2 by 2 subraatrix formed when grouping the Cytogram Matrix elements in rows and columns of 2s end for else if Gate_Tightness is 4 then for each element of the Convolved Matrix Convolved Cytogram Matrix element is equal to the sum of the elements of the 4 by 4 submatrix formed when grouping the Cytogram Matrix elements in rows and columns of 4s end for endif END PROCEDURE PROCEDURE Make_Autogate( ) INPUT PARAMETERS: Cytogram matrix. Upper Left (X,Y) coordinates of the Autogate Zone. Lower Right (X,Y) coordinates of the Autogate Zone. Peak in the autogate zone. OUTPUT PARAMETERS: The list of X and Y coordinates for the 36 point autogate polygon. START PROCEDURES BODY do 10 degrees at a time (36 iterations total) Initialize the radial histogram to 0. do starting from the peak of the pattern Calculate the x and y coordinates for the next point of the radial histogram. if the next point is outside the autogate zone then Done with the current radial histogram. Go to next radial histogram (next 10 degrees) . endif Update the radial histogram. done Smooth the radial histogram with a 7 point weighted average. Find the minimum of the smoothed radial histogram and save it as part of the 36 point boundary. done Smooth the 36 point boundary with a 5 point weighted average. Convert the 36 point boundary to x and y coordinates. END PROCEDURE PROCEDURE Average_Autogate( ) INPUT PARAMETERS: A list of the (X,Y) coordinates of the 36 autogate points. OUTPUT PARAMETERS: The X average of the 36 autogate points. The Y average of the 36 autogate points. START PROCEDURE BODY Form the sum of the X coordinates of the 36 autogate points. Form the sum of the Y coordinates of the 36 autogate points. Calculate the average of the X coordinates of the 36 autogate points. Calculate the average of the Y coordinates of the 36 autogate points. END PROCEDURE PROCEDURE Find_Peak( ) INPUT PARAMETERS: Cytogram matrix. Upper Left coordinates and lower right coordinates of the autogate zone. OUTPUT PARAMETERS: Peak in the autogate zone. START PROCEDURE BODY temporary sum of the Cytogram matrix elements covered by the 3 by 3 scan matrix is 0. do Form the sum of all Cytogram matrix elements covered by the 3 by 3 scan matrix. If the sum calculated is greater than the temporary sum then Current peak is designated as the (X,Y) pair in the middle of the Cytogram matrix elements covered by the 3 by 3 scan matrix, endif Move the 3 by 3 scan matrix by 1 element in the x or y direction to cover the next 3 by 3 Cytogram matrix elements, until the 3 by 3 scan matrix has covered the Cytogram matrix. END PROCEDURE A specific example of the operation of the present invention, including the above-discussed algorithm, will now be given with reference to Figures 8-32. As schematically represented by Figure 8, in the preferred operation of the invention, blood samples are analyzed in groups of three, with each group of three samples taken from the same patient. The first, second, and third samples in each group are mixed with the above-discussed first, second, and third reagents, respectively. The first sample, referred to as the control sample, is processed and analyzed to determine a count of the number of lymphocyte cells in the sample, and to determine various threshold and background values that are used in the analysis of the second and third samples. The second sample, referred to as the CD4/CD8/CD3, or the 4/8/3 sample, is processed and analyzed to determine a count of the number of lymphocyte cells in the sample, and to determine a count of the number of T cells in the sample. This second sample is also processed and analyzed to determine a count of the number of the T cells that are helper cells, and a count of the number of the T cells that are suppressor cells. The third sample, referred to as the CD16/CD9/CD3, or the 16/9/3 sample, is processed and analyzed to determine a count of the number of lymphocyte cells and a count of the number of T cells in the sample. This third sample is also analyzed to determine counts of the NK and B cells in the sample. After the appropriate reagent has been added to the sample, each sample is analyzed by conducting the sample through flow cytometer 100, in the manner discussed above. Also, as discussed above, as the sample passes through the flow cytometer, laser beam 106 interacts with each particulate item passing through flow cell 102, and eac interaction is referred to as an event. The events that occur when the first sample is conducted through the flow cytometer are referred to herein as the E^. events, and the events that occur when the second and third samples are conducted through the flow cytometer are referred to herein as the E 2 and E 3 events, respectively. For each event, five parameters are measured and recorded. Specifically, records, schematically represented in Figure 9, are made of the forward light scatter, the right angle light scatter, and the red, green, and orange fluorescence caused by each event. Preferably, electric signals identifying each event and the values of the parameters measured during those events are transmitted from flow cytometer 100 to processing system 200, shown in Figure 10. Preferably, processing system 200 includes preprocessor 202, main processor 204, and input means such as keyboard 206. More specifically, the electric signals from cytometer 100 are conducted to preprocessor 202, which then converts those signals into digital data values and stores those data values in memory area 210 of the preprocessor. For example, memory area 210 may include a multitude of sections 210a, 210b, 210c and 210d; and the data values generated from the events E , E 2 , and E 3 may be stored in memory sections 210a, 210b and 210c respectively. In each memory section, the data values generated from each event are stored in a manner that associates those data values with that event. For instance, in each memory section, data may be stored in rows and columns. Each row may be associated with a respective one event; and the columns of each row may identify the channel numbers of the forward scatterred light, right angle scatterred light, and red, green, and orange fluorescence measured from the event associated with that row. The data values stored in preprocessor 202 are available to main processor 204, which is connected to the preprocessor to obtain data values from and to transmit data values to that preprocessor. Preferably, main processor 204 is, or is a component of, a personal computer also having keyboard 206 and terminal 212. Keyboard 206 is connected to processor 204 to allow operator input thereto, and terminal 212 is used to visually display data or messages being input into the processor. In addition, monitor 214 may be connected to processor 204 to produce video images from the data values stored in the processor or in preprocessor 202. Printer 216 may be connected to processor 204 to provide a visual, permanent record of selected data values or images transmitted to the printer from the processor. As will be understood by those of ordinary skill in the art, processing system 200 may be provided with other or additional input or output devices to allow an operator or analyst to interact with processors 202 and 204. Also, the individual components of system 200 are conventional and well known by those of ordinary skill in the art. For instance, monitor 214 may be a high resolution color monitor and, as discussed above, processor 204 may be a component of a personal computer. After receiving the data signals from cytometer 100, processing system 200 processes the data, pursuant to the preferred algorithm discussed below in detail, to determine counts of various types of cells, including lymphocytes, T cells, T helper cells, T suppressor cells, B cells, and NK cells. In the operation of the algorithm, data acquisition and analysis are driven by reagent specific protocols and their association into panels. Panel specific properties define the operations performed and the reporting structures associated with the reagent panel. These properties include the reagent protocols used and, in some instances, the order in which the samples are acquired and analyzed. The algorithm employed in the present invention is based on the principle that information about the content of the patient samples can be deduced from various plots or graphs made from the data measured as the samples pass through flow cell 102. Two types of graphs are of particular interest. The first type, referred to as a cytogram or cytoplot, is a graph in which two of the measured values of each event are plotted against each other, and for example, Figure 11A shows a cytogram made by plotting the right angle scatterred light of each event Ei versus the forward scatterred light of the event. The second type of graph of particular interest, referred to as a histogram, shows the number of events measured in each channel of one of the measured parameters, and Figure 11B, for instance, is a histogram showing the number of events E__, having a red fluorescence measurement in each red fluorescence channel. It is known that on certain cytograms, virtually all of the cells of a particular type will be found in a comparatively well defined area or region, and, moreover, in that region, the cells of that particular type will be clustered together. For example, on the cytogram of Figure 11a, virtually all of the events E n . caused by lymphocytes in the first patient sample will be clustered together somewhere in region R x . The preferred algorithm employs the more specific principle that the lymphocyte cells, the T cells, the T helper cells, the T suppressor cells, the B cells, and the NK cells may each be found clustered together in a particular area of a respective cytogram. The lymphocyte cells in each of the three patient samples, may be found clustered together in a defined region of a cytogram formed by plotting forward scatterred light versus right angle scattered light; and the T cells in each of the second and third patient samples may be found clustered together in a defined region of a cytogram formed by plotting red fluorescence versus right angle scattered light. Also, the NK cells in the third patient sample may be found clustered together in a particular region of a cytogram formed by plotting green fluorescence versus right angle scatterred light, and the B cells in the third patient sample may be found clustered together in a region of a cytogram formed by plotting orange fluorescence versus right angle scattered light. Preferably, processor 202 or 204, specifically a memory thereof, includes a protocol file, schematically illustrated at 216 in Figure 12, identifying the boundaries of each cytogram region R lf R 2 , R 3 and R 4 that may be searched for a cluster of cells. For example, these regions may be listed in the protocol file in the order in which the regions are searched —that is the first time the algorithm searches for a cell type, it searches in the first region listed in the protocol file; and the second time the algorithm searches for a cell type, it searches in the second region listed in the protocol file. Alternatively, the protocol file may contain information associating each listed region with the cell type for which that region is searched. In addition, preferably, the user can adjust, add, and delete region boundaries listed or defined in the protocol file. At various steps in the algorithm employed in the present invention, the algorithm counts the number of events having respective given values for two parameters, and these count values may be stored in processor memory 210. With the preferred arrangement employed in the present invention —where each measured parameter is recorded as being in a channe — when the algorithm makes the above-mentioned counts, the algorithm counts the number of events that have both (i) a measured value for a first parameter in a given channel thereof, and (ii) a measured value for a second parameter in a given channel thereof. Each such count may be identified by an (x,y) combi ation or address, where x identifies that given channel of the first parameter and y identifies that given channel of the second parameter. The (x,y) address of each count may also be used to identify the location in processor memory 210 where the count value is stored. Preferably, the algorithm employs a two-dimensional matrix arrangement, specifically a 256 x 256 matrix, to record and to keep track of the various counts made during the operation of the algorithm. In each series of counts, for each count in the series, the (x,y) combination used to make the count is also used to identify the (x,y) address of the location in the matrix at which the count value is stored. For instance, in a first series of counts, the algorithm may count the number of the events E x having a right angle scatter in channel 17 and a forward light scatter in channel 125. If that coxint is three, then the value 3 is located at the matrix address (17,125). Figure 13 shows a part of a matrix formed from various counts of the right angle scattered light and forward scattered light measurements of events E___ . Figxire 13 shows 81 matrix locations (x,y) where x and y each range from 21 to 29. The value located at the matrix location (x,y) is the number of the events E x having a right angle scattered light in channel x and a forward light scattering in channel y. Thus, for instance, six of the events E__. had right angle scattered light in channel 21 and forward scattered light in channel 21; and seven of the events had right angle scattered light in channel 25 and forward scattered light in channel 28. As previously mentioned, during the operation of the algorithm, several series of coxints are made; and dxiring each series, a respective one coxint value is or may be associated with, or stored at, each matrix location. In order to distinguish between the count values determined during different series of counts, a multitude of variables V ...V„ are associated with each matrix location; and dxiring each series of coxints, a respective one of these variables is used to designate the coxints made during that series. Thus, for example, Va. is used to designate the counts made during the first series of counts, and V 2 is used to designate the coxints made dxiring the second series of counts. More specifically, in the first series of counts, when a count is made for a particular pair of parameter values, the V x value for the matrix address associated with that pair of parameter values is set equal to that count; and in the second series of counts, when a count is made for a particular pair of parameter values, the V 2 value for the matrix address associated with that pair of parameter values is set equal to that count. As will be appreciated by those of ordinary skill in the art, storing these count values in this matrix arrangement facilitates preparation of cytograms, of the type shown in Figure 11a. Likewise, these cytograms help to understand the processing of the data stored in the data matrix. In particular, each cytogram corresponds to a respective one set of the V x ...V ± ...V„ values stored in the data matrix. In addition, each cytogram is comprised of a 256 x 256 grid, with each block or rectangle on that grid corresponding to a respective one matrix address. To form a cytogram illustrating a respective pair of parameters, each block on the grid may be illximinated at an intensity proportional to the coxint value, in the corresponding set of V values, associated with the matrix address corresponding to that grid block. Thus, for example, to form the cytogram of Figure 11A, each block on the cytogram may be illximinated at an intensity equal to or proportional to the V x value associated with the data matrix address corresponding to the block. Alternatively, each of these blocks may be illximinated with a nximber of points equal to or proportional to the corresponding matrix data value. In the preferred operation of this invention, the patient samples are processed in a particular order, and specifically, the control sample is processed first. The CD4/CD8/C3 sample and the CD16/CD19/CD3 sample are processed following the control sample, the order in which the 4/8/3 and 16/9/3 samples are processed not being pertinent to the preferred operation of this invention. Figures 14A and 14B illustrate an algorithm for analyzing the data obtained from the control sample. The first steps in the algorithm are performed to determine an absolute count of the total number of lymphocytes in the sample. At step 302, a value V x is determined for each address (x,y) in the above-discussed data matrix. In particular, for each matrix address (x,y), the algorithm counts the number of events E x having a right-angle scatter in channel x and a forward light scatter in channel y, and sets the variable V x for that matrix address equal to that count. Then, at step 304, the autogate routine, discussed in detail below, is invoked to determine a boxindary or gate G x aroxind the group or cluster of matrix locations that represent the lymphocyte population. In particular, the autogate routine identifies a cluster of matrix locations whose V x coxint values are taken from events considered to be caused by lymphocytes. At step 306, Lp x , which is the total coxint of lymphocytes in the first sample, is then set equal to the sum of the V x values of the matrix addresses in gate G x . Figure 15A is a cytogram illustrating steps 302, 304 and 306 of the algorithm. In particular, this cytogram shows, for the events E x , right angle light scattering plotted versus forward light scattering. This cytogram may be formed by separating the plot into a 256 x 256 grid, assigning each block of the grid an (x,y) address, where x and y each range in sequence from 0 to 255, and then illuminating each block on the grid at an intensity proportional to the V x value of the matrix location having the same (x,y) address as the grid block. The autogate routine, when invoked at step 304, draws a boundary or gate G x aroxind the cluster of events considered to be lymphocyte cells. At step 306, the algorithm coxints or determines the nximber of events plotted inside that gate G x . With reference to Figure 14A, the algorithm, at steps 310 through 314, then determines various statistical values or regions. In particular, at step 310, a list E Xaι is made of the event E x that were plotted inside gate G x —that is, were coxinted when determining the V x values of the matrix locations having addresses inside gate G x . These events E xβ are identified from the addresses of the matrix locations inside that gate. Specifically, for each matrix address (x,y) inside the gate G x the algorithm searches through the list of events E x and then adds to list E xβ each event E x having a right angle scattering in channel x and a forward light scattering in channel y. Then, at step 312, a new value V 2 is determined far each matrix address (x,y) from the events on list E XΛ . In particular, for each matrix address (x,y) the algorithm counts the number of events E Xa that have a green fluorescence measurement in channel x, and an orange fluorescence measurement in channel y, and sets the variable V 2 for that matrix address equal to that count. From these V 2 values, the algorithm, at step 314, determines the green fluorescence channel below which a certain percentage, such as 95% or 98%, of all green fluorescence measurements occurred. This determined channel, referred to as the green threshold channel, is used in the analysis of the second and third samples discussed below. Similarly, from these V 2 values, the algorithm determines the orange fluorescence channel below which a certain percentage, again such as 95% or 98%, of all orange fluorescence measurements occurred. This determined channel, referred to as the orange threshold channel, is also used in the analysis of the second and third samples. Figure 15B illustrates a cytogram formed from these V 2 values. The cytogram is comprised of a 256 x 256 grid, and each block on the grid is illximinated at an intensity proportional to the V 2 value of the matrix location having the same address as that block. The green and orange threshold channels are indicated by the line segments designated as ThC G and ThC 0 respectively. At steps 324 and 326 of the algorithm, a measurement is made of the red fluorescence backgroxind of the lymphocyte cells. Specifically, for each red fluorescence channel RFC X , the algorithm coxints the nximber of events E XΛ having a red flxiorescence measxireraent in that channel, and sets the variable rf A for that channel equal to that count. From these rf x values, the algorithm determines the red fluorescence channel below which a given percentage of the red fluorescence measxirements of events E xa. occurred. That determined red fluorescence channel is referred to as the red fluorescence threshold channel, and is also used in the analysis of the second and third samples. Figure 15F is a histogram formed from these rf A values. In particular, the RFC^ channels are plotted along the x-axis, and each channel is provided with a bar representing the rf ± value for that channel. The red fluorescence threshold channel is represented by line segment designated ThC R . Preferably, data identifying the above-mentioned green, orange and red fluorescence threshold channels are stored in the protocol file shown in Figure 12. Also, the various percentages used to determine these channels, which preferably may be adjusted by the user, are also stored in that protocol file. At steps 332, 334 and 336, the algorithm determines backgroxind values for the red, green, and orange fluorescence measurements in search regions R 2 , R 3 , and R_», in which the algorithm later searches for certain cell populations. These search regions are identified in, and can be obtained from, the protocol file in the processor memory. At step 332, a value V 3 is determined for each matrix address; and this is done by counting, for each matrix address (x,y), the number of events E x having right angle scattering measurements in channel x and red fluorescence measurements in channel y, and setting the V 3 value of the matrix address equal to that count. At step 334, the algorithm counts, for each matrix location (x,y) the number of events E x having right angle scattering measurements in channel x and green fluorescence measurements in channel y, and the algorithm sets the V 4 value of the matrix address to that coxint. At step 336, a value V 5 is determined for each matrix address; and this is done by counting, for each matrix address (x,y), the number of events E x having right angle scattering measurements in channel x and orange fluorescence measurements in channel y. At step 340, the algorithm sxims the V 3 values of all the matrix locations inside search region R 2 , and this is the background count of cells in that search region. Similarly, at step 342 the algorithm sxims the V 4 values of all the matrix locations inside search region R 3 ; and at step 344, the algorithm sxims the V 5 values of all the matrix locations inside search region R 4 . These sxims, which preferably are stored in the protocol file, are the background counts of cells in search regions R 3 and R 4 respectively. Figures 15C, 15D and 15E graphically illustrate these procedures for determining the backgroxmd cell coxints in regions R 2 , R 3 , and R_». In these Figures, the right angle light scattering of each event E x is plotted on the x axis and the green, orange, and red fluorescence measurements of the E x events are plotted on the respective y-axes. Regions R 2 , R 3 , and R 4 are outlined in Figures 15C, 15D and 15E, and the number of cells in each region is the background count for that region. Figures 16A and 16B show a preferred algorithm for processing data from the second sample —that is, the CD4/CD8/CD3 sample. Steps 402, 404 and 406 of this algorithm are performed to determine a count, Lp 2 , of the total number of lymphocytes in that sample-. Specifically, at step 402, a V 6 value is determined for each matrix address; and this is done by coxinting, for each matrix address (x,y), the nximber of events E 2 having a right angle scatter measxirement in channel x and a forward light scatter measurement in channel y, and then setting the V β value of the matrix address to that coxint. Then, at step 404, the autogate routine is invoked to determine a gate G 2 around the group or cluster of matrix locations that represent the lymphocyte population. Lp 2 is then, at step 406, set equal to the sum of V β values of the matrix addresses inside gate G 2 . Figure 17A is a cytogram illustrating steps 402, 404 and 406 of the algorithm. Specifically, this cytogram shows, for the events E 2 , right angle light scattering plotted versus forward light scattering. The cytogram may be formed by separating the plot into a 256 x 256 grid, and assigning each block of the grid an (x,y) address, where x and y each range in sequence from 1 to 256. Then, each block on the grid may be illximinated at an intensity proportional to the V s value of the matrix location having the same (x,y) address as the grid block. When the autogate algorithm is invoked, it is used to draw gate G 2 aroxind the cluster of plots that represent lymphocyte cells. With reference again to Figure 16A, at steps 410, 412 and 414, a count, T x is made of the T-cells in the lymphocyte population. To do this, each matrix address is provided with a V 7 value. At step 410, for each matrix address (x,y), the algorithm coxints the number of events E 2 having a right angle scattering measurement in channel x and a red fluorescence measurement in channel y, and the V- 7 value of the matrix address is set equal to that count. The autogate routine is invoked at step 412 to determine a gate G 3 aroxind the group or cluster of matrix addresses that represent T- cells, and then T x is set equal to the sum of the V v values of the matrix addresses inside gate Figure 17B is a cytogram showing, for the events E 2 , right angle light scattering plotted versus red fluorescence, and this cytogram may be formed in a manner similar to the way in which the cytogram of Figure 17A is formed. For instance, the cytogram may be separated into a 256 x 256 grid, and each block of the grid may be illximinated at an intensity proportional to the V 7 value of the corresponding matrix address. Gate G 3 is shown aroxind the cluster or population of cells considered to be the T-cells, and the total count T x of the T cells may be considered as being the total coxint of the nximber of cells inside gate G 3 . To provide a check on this T x value, a second absolute count of the T-cells is obtained from the second patient sample in a second manner. To do this, a list E 2a . is made, at step 416, of the events plotted inside gate G 2 . In particular, for each matrix location (x,y) inside gate G 2 , the algorithm searches through the list of events E 2 and adds to list E 2Λ each event E 2 having a right angle scattering in channel x and a forward light scattering in channel y. Next, at step 420, for each red fluorescence channel RFC ± , the algorithm coxints the number of events E 2Λ having red fluorescence measurements in that channel, and the algorithm sets the rf ± value for that channel equal to that count. Then, at step 422, the algorithm sxims the rf ± values of all the red fluorescence channels above the threshold channel ThC R , and the variable T Xa . is set equal to that sum. Figure 17D is a histogram illustrating steps 420 and 422. This histogram shows the number of the cells inside the lymphocyte gate G 2 of Figure 17A, that had red fluorescence measurements in each red fluorescence channel. All of these numbers that are contained in the positive region, as determined by the red fluorescence channel ThC ^ , are then sximmed to provide an absolute count of the number of lymphocytes that are CD3+. Since T- lymphocytes are CD3+ and other lymphocytes are CD3-, this absolute count thus provides an absolute count of the number of T-lymphocytes in the second patient sample. The. CD3 gated cells --that is, the cells plotted inside the autogate of Figxire 17B— are then analyzed to determine, first, the nximber of these cells that are also CD4+ and CD8-, and second, the number of these cells that are also CD8+ and CD4-. To do this, the algorithm, at step 424, forms a list E 2to of the events E 2 that fall inside gate G 3 . In particular, for each matrix location (x,y) inside gate G 3 , the algorithm searches through the list of events E-_ and adds to list E 2to each event having a right angle scattering in channel x and a red fluorescence measurement in channel y. Then, for each matrix location (x,y), the algorithm, at step 426, coxints the number of events E 2tl having a green fluorescence measurement in channel x and an orange fluorescence measurement in channel y, and the algorithm sets the V 8 value for the matrix address equal to that count. Figure 17C is a cytogram made from these V β values. In particular, the cytogram is comprised of a 256 x 256 grid, and each block of the grid is provided with an (x,y) address, with x and y each ranging in sequence from 1 to 256. Each block in the grid is illuminated at an intensity equal or proportional to the V s value of the matrix location having the same (x,y) address as the block. With reference to Figures 15B and 17C, all the events plotted in Figure 17C above the threshold value ThC^, determined during the analysis of the first patient sample, are considered to be green positive; and all the events plotted in Figure 17C below that threshold channel are considered to be green negative. The CD4+ cells are green positive, and hence to determine the nximber of CD4+ cells, the algorithm sxims the V s values for all matrix locations having an x value greater than ThC w . The CD4- cells are green negative, and to determine the nximber of these cells, the algorithm sxims the V a values for all matrix locations having an x value less than ThCς-. A similar procedxire is used to determine the number of CD3+ cells that are also either CD8+ or CD8-. Specifically, all the events plotted in Figure 17C above the threshold channel ThC 0 , which is determined at step 314, are considered to be CD8+, and all the events plotted in Figure 17C below that threshold channel are considered to be CD8-. To determine the number of CD3+ cells that are also CD8+, the algorithm sxims the V a values for all matrix locations having a y value greater than ThC 0 ; and to determine the number of CD3+ cells that are also CD8-, the algorithm sxims the V s values for all the matrix locations having a y value less than ThC 0 . Nximerous other values may be determined from the V a values of the matrix addresses. For instance, by summing the V 8 values of all matrix locations (x,y) having an x value less than ThC σ and a y value less than ThC of the algorithm may determine the nximber of CD3+ cells that are both CD4- and CD8-; and by sximming the V a values of all matrix locations (x,y) having x and y values greater than ThCg. and ThC α , respectively, the algorithm may determine the nximber of CD3+ cells that are also both CD4+ and CD8+. The number of CD3+ cells that are CD4+ and CD8- may be calculated by summing the V a values of all matrix locations (x,y) having x values greater than ThC^ and y values less than ThC 0 ; and the nximber of CD3+ cells that are CD4- and CD8+ may be calculated by summing the V s values of all matrix locations (x,y) having x values less than ThC w and y values greater than ThC 0 . Figures 18A, 18B and 18C show a preferred algorithm for processing the data obtained from the third patient sample --the CD16/CD19/CD3 sample. Steps 502, 504 and 506 of the algorithm are performed to determine a coxint, Lp 3 , of the total nximber of lymphocytes in that sample, and this coxint is determined in a manner similar to the ways in which Lp x and Lp 2 were determined. In particular, at step 502, a value V 9 is determined for each matrix address; and this is done by counting, for each matrix address (x,γ), the nximber of events E 3 that have a right angle scattering measurement in channel x, and a forward light scattering measurement in channel y, and then setting the V 9 value of the matrix address equal to that count. Next, at step 504, the autogate routine is invoked to determine a gate G 4 aroxind the group or cluster of matrix locations that represent the lymphocyte population; and at step 506, Lp 3 is then set equal to the sum of the V 9 values of the matrix addresses inside gate G 4 . Figure 19A is a cytogram illustrating steps 502, 504 and 506 of the algorithm. Specifically, this cytogram shows, for the events E 3 , right angle scattering plotted versus forward scattering. The cytogram may be formed by separating the plot into a 256 x 256 grid, and assigning each block on the grid an (x,y) address, where x and y each range in sequence from 1 to 256. Then, each block on the grid may be illximinated at an intensity proportional to the V 9 value of the matrix location having the same (x,y) address as the grid block. With reference to Figure 18A, at steps 510, 512 and 514, a count T 2 is made of the T cells in the lymphocyte population, and this is done by a procedure similar to the procedure used to determine the T x coxint. At step 510, each matrix address is provided with a V xo value. For each matrix address (x,y) , the algorithm coxints the number of events E 3 having a right angle scattering measurement in channel x and a red fluorescence measurement in channel y, and the V o value of the matrix address is set equal tα that count. The autogate routine is invoked at step 512 to determine a gate G 5 around the group or cluster of matrix addresses that represent T cells, and at step 514, T 2 is set equal to the sum of the V xo values of the matrix addresses inside gate G s . Figure 19B is a cytogram showing, for the events E 3 , right angle scattered light plotted versus red fluorescence, and this cytogram may be formed in a manner similar to the way in which the cytogram of Figxire 17B is formed. For instance, the cytogram may be separated into a 256 x 256 grid, and each block of that grid may be illximinated at an intensity proportional to the V xo value of the corresponding matrix address. Gate G 5 is shown around the cluster or population of cells considered to be the T cells, and the total count T 2 of the T cells may be considered as being the total count of the number of cells inside gate G s . A check is made of this T-cell coxint by sending the lymphocyte gate G 4 to a red fluorescence histogram. More specifically, at step 516, a list E 3β is made of the events E 3 inside gate G 4 . To do this, the algorithm searches through the list of events E 3 and, for each matrix location (x,y), adds tα list E 3β each event E 3 having a right angle scattering in channel x and a forward light scattering in channel y. Then, at step 520, the algorithm counts, for each red fluorescence channel RFC ± , the nximber of the events E 3a having red fluorescence measurements in that channel, and the algorithm sets rf x equal to that count. At step 522, the algorithm sums the rf ± values of all the red fluorescence channels above the threshold channel ThC R , and sets the variable T 2a equal to that sum. Steps 520 and 522 are illustrated in the histogram of Figure 19F. Of the cells plotted inside the lymphocyte gate G 4 of Figure 19A, this histogram shows the number of those cells in each of the red fluorescence channels. All of these nximbers in channels above the threshold channel ThC R are sximmed to provide an absolute count of the number of lymphocytes that are CD3+. After these T-cell counts are made, absolute counts are made of the number of cells in the third patient that are CD16+ and CD19+, and this is done by analyzing the green and orange fluorescence of the E 3 events. At step 524, each matrix address is provided with a value V xx . For each matrix address (x,y), the algorithm coxints the number of events E 3 that have right angle scatter measurements in channel x and green fluorescence measurements in channel y, and the V xx value of the matrix address is set equal to that count. The autogate routine is invoked at step 526 to determine a gate G 6 aroxind the CD16+ cell population --that is, to draw a gate around the matrix addresses representing CD16+ cells. NK 0 is then set equal, at step 530, to the sum of the V xx values of the matrix locations inside gate G e . Figure 19C is a cytogram illustrating steps 524, 526 and 530. The cytogram is comprised of a 256 x 256 grid, and each block on the grid is illximinated at an intensity proportional to the V x value of the corresponding matrix address. Gate G β is drawn aroxind the cluster of cells that are CD16+, and NK ^ is equal to the number of cells in the cluster. The algorithm also determines the nximber of cells in the third sample that are CD19+. At step 532, for each matrix address (x,y), the algorithm coxints the nximber of events E 3 that have a right angle scattering measurement in channel x and an orange fluorescence measurement in channel y, and the V X2 value of the matrix address is set equal to that count. The autogate routine is invoked, at step 534, to identify gate G-, around the group or cluster of matrix addresses that are considered to be the CD19+ cells, which are the B cells in the sample. Then, at step 536, B is set equal to the sum of the V x2 values of the matrix addresses inside gate G-7. Steps 532, 534 and 536 are illxistrated in the cytogram of Figure 19D. The cytogram is comprised of a 256 x 256 grid, and each block on the grid is illuminated at an intensity proportional to the V x2 value of the corresponding matrix address. Gate G 7 is drawn around the cluster of cells that are CD19+, and B is set equal to the number of cells in that cluster. As mentioned above, some CD16+ cells are also CD3+. While the nximber of such cells is usually small, they preferably are accounted for when determining a count of the NK cells in the sample. To do this, the CD16+ autogated cells are plotted onto a red fluorescence histogram. The number of these CD16+ cells that are also T-cells —that is, CD3 — is then determined, and this latter number is then subtracted from the count of NK o cells in order to determine the number of NK cells in the sample. More specifically, at step 540, for each matrix address (x,y) inside gate G 6 , the algorithm identifies the event or events E 3 having a right angle scattering measurement in channel x and a green fluorescence measurement in channel y, and the algorithm adds that event or those events to the list E 3£> . Then, at step 542, for each red fluorescence channel RFC A , the algorithm coxints the nximber of events E 3to having a red fluorescence measurement in that channel, and sets the rf ± value for that channel equal to that count. At step 542, the algorithm sxims the τf ± values of all the red fluorescence channels above the red threshold channel, which was determined at step 326, and then at step 544, the algorithm sets the variable TCD16+ equal to that count. Next, at step 546, to determine the nximber of NK cells in the sample, which are CDlδ^CDS " , the algorithm sxibtracts the nximber of cells that are CD16 * CD3" " from the total nximber of cells that are CD16+, and the algorithm sets the variable NK equal to that difference. Thus, NK = NK ^ - TCD16+. Figure 19E is a histogram illustrating steps 540, 542 and 544. This histogram shows the number of cells inside the CD16+ gate G β of Figure 19C that have red fluorescence measurements in each red fluorescence channel. All of these numbers that are contained in the positive region, are then summed to provide an absolute count of the T- cells that are also CD16+. This latter number may be estimated by means of an alternate procedure. In accordance with this alternate procedure, the CD3 gated cells of Figxire 19B are sent to an orange fluorescence versus green fluorescence graph, as shown in Figure 19G. In particular, for each cell in the CD3 gate of Figure 19B, the green and orange fluorescence values of the cell are plotted, respectively, along the x- and y-axes of the graph of Figure 19G. The number of cells having green fluorescence values above and orange fluorescence values below the threshold values are counted, providing an absolute count of the number of cells that are both CD3 positive and CD16 positive. This number may then be sxibtracted from the total nximber of cells that are CD16 positive, as determined at step 530, to provide a coxint of the nximber of cells that are CD16 positive and CD3 negative. The former of the two-above procedxires for determining the number of CD16 positive and CD3 negative cells is preferred because the latter procedure may underestimate the total number of NK cells, particularly when the blood sample is taken from some HIV-positive patients. To elaborate, certain HIV-positive patient samples contain a fairly high frequency of low intensity CD16 positive cells that also bear CD3. These cells. which are not found in appreciable numbers in HIV-negative donor samples, are known to be CD8 cells and are responsible for ADCC. These ADCC cells, because of their low CD16 expression, might not be counted in the CD16 cells from the plot of Figure 19C. As discussed above, and with reference to Figure 20, during each operation of the autogate algorithm, a cell population is identified in a region of interest, and in particular, a boundary or gate is defined for that cell population. With the preferred embodiment of the autogate algorithm described herein in detail, during each operation of the algorithm, a multitude of cell population boundaries are defined, and then the algorithm identifies one of those multitude of cell populations as the most significant one. Generally, the boundary for each cell population is determined by finding a first matrix address in that population, and then, from that one address, making a first estimate of the boundary. From that first boundary estimate, a second matrix address in the cell population is identified; and then this second matrix address is used to make a second, final estimate of the boxindary of the cell population. These first and second matrix addresses in each cell population are referred to as first and second peaks or first and second peak locations. In order to determine the first estimate of the boundary for each cell population, a series of radial lines are drawn from the first peak location in the cell population. On each of these radial lines, a respective one point is identified by means of a procedure, discussed below in detail. These identified points are considered to be the first estimates of boxindary points, and the first estimate of the boundary can be formed by connecting together these identified points. A similar procedure is used to make the second, final estimate of the boundary from the second peak location in the cell population. The autogate algorithm may be designed to determine the desired boundaries based on images, or data derived from images, of the type shown in Figure 20. Preferably, though, the autogate algorithm determines the desired boundaries based on the V x ...V n values established or determined in the algorithms shown in Figures 14A and B, 16A and B and 18A, B and C. As previously mentioned, each Vi value has an associated (x,y) address, and each set of Vi values corresponds to a 256 x 256 matrix, with the (x,y) address of each V value in the set corresponding to and identifying a respective one location in that 256 x 256 matrix. For example, Figure 13 shows a portion of a matrix formed from the V x values. Each address on the matrix corresponds to a respective one V x value, and each V x value corresponds to a respective one matrix address. With this preferred arrangement, when the autogate algorithm identifies a boundary of a cell population, the algorithm, in fact, identifies the addresses of the relevant matrix that form the boxindary of the locations in that matrix that correspond to V values that are, or are considered to be, counts of events caused by cells in that population. With reference to Figure 21, the autogate algorithm employs a nximber of variables, including those identified as s, n, and q. The variable s keeps track of the number of different cell populations identified by the algorithm during each operation thereof, and the variable n is used to identify various line segments used to determine points on the first and second boundary estimates of each cell population. The variable q is used to differentiate between, on the one hand, the first peak location of each cell population and various data derived therefrom, and on the other hand, the second peak location of each cell population and various data related or derived therefrom. The variable P s , <:r (x,y) is used to identify the q ttl peak location of the s tl * cell population. The variable G a , <a , rι (x,y) is used to identify a raw boundary point on the n tlri line segment drawn from the q tl1 peak location of the s th cell population; and the variable is used to identify a processed, or smoothed, boundary point on the n th line segment drawn from the q tix peak location of the s til cell population. Each time the autogate algorithm is invoked, the algorithm operates on or with a particular data set, which varies depending on the particular type of cell population that the algorithm was invoked to identify. Each such data set includes one set of the V*. values and data identifying the search region in which the algorithm searches for the cell population. Specifically, with reference to Figxire 22, when the autogate is invoked to determine the lymphocyte populations of the first, second, and third patient samples, the algorithm operates on the V x , V 6 , and V 9 values, respectively, and for each of these searches, the algorithm searches in region R x . When the algorithm is invoked to determine the T cell population of the second and third patient samples, the algorithm operates on the V 7 and V xo values respectively, and the algorithm searches in region R 2 . When the autogate is invoked to determine the CD16+ cell population in the third patient sample, the autogate algorithm operates with the V xx values and searches in region R 3 ; and when the autogate algorithm is invoked to determine the CD19+ cells in the third patient sample, the algorithm operates on the V X2 valxies and searches in region R 4 . In the discussion below, and in the figures, the set of V values that the algorithm is using at any point in time or during any one operation is generally designated as V-, , and the particular region in which the autogate searches for the cell population of interest is generally designated R d . Figures 23A-23D illustrate a preferred embodiment of the autogate algorithm. At step 602, the user determines the size, or resolution, of the matrix of values which the algorithm prossesses, and this is done by selecting a value for the convolution factor C. If C is set equal to one, then the matrix is a 256 x 256 matrix; if C is set equal to two, then the matrix is a 128 x 128 matrix; and if C is set equal to four, then the matrix is a 64 x 64 matrix. The smaller C is —and hence the larger the number of matrix addresses— the closer, or tighter, the resulting gate is drawn aroxind the desired cell population. When the user selects a value for C other than one, the algorithm automatically adjusts the Vj values that it will process, as represented by step 604, to account for the change in the number of address locations in the matrix. For instance, if the algorithm is processing the V x values and the user sets C equal to two, then each respective 2 x 2 group of V x values in the original 256 x 256 matrix are summed to form a new U x value. Figure 24 shows a portion of an adjusted matrix formed from V x values in the matrix portion shown in Figure 13. Each U x value in the adjusted matrix of Figure 24 is the sum of a respective group of four values in the original matrix. For instance, the U x value at address (11,11) in the adjusted matrix of Figure 24 is the sum of the V x values at addresses (21,21), (22,21), (21,22), and (22,22) of the original matrix of Figure 13; and the U x value at address (13,13) in the adjusted matrix is the sum of the V x values at addresses (25,25), (26,25), (25,26), and (26,26) in the original matrix. Other data values may also be adjusted to account for the change in the number of address locations in the matris. For instance, the boundaries of the search regions R x , R 2 , R 3 , and R 4 are adjusted so that the search region employed by the algorithm covers the same events — or, more specifically, the plots of the same events, or the matrix locations having Vj values determined by coxints of the same events —regardless of the C value chosen by the user. Typically, if a convolution factor C other than one is chosen, then, in order to determine the appropriate x and y values for the edges of the search region, the x and y values for the basic or standard search region on the 256 x 256 matrix are divided by the chosen convolution factor. For example, a search region on a 256 x 256 matrix might comprise the addresses having x values between 10 and 40 and y values between 50 and 180. If a convolution factor of two is chosen, the search region on the adjusted 128 x 128 matrix would comprise the addresses having the x values between 5 and 20 and y values between 25 and 90. In addition, if necessary, the search regions are modified so that the edges of the search regions are not within two matrix addresses of the edge of the convolved matrix. With reference again to Figxire 23A, at step 606 of the autogate algorithm, the variables s and q are set to one. At steps 610 and 612, the search region R-, is defined, and the matrix addresses in that region are identified and a list MX X is made of those matrix addresses. At step 614, R(x,y) is set equal to the coordinates of the matrix address at the center of the search region. These coordinates, which are used later in the algorithm, are stored in the processor memory. Steps 620 and 622 are performed in order to select a first or initial peak location in the search region. To do this, each matrix address in that region is provided with an additional value U 2 . More specifically, each matrix address is assigned a U 2 value equal to the sum of its U x value and the U x values of its eight immediate neighbors. Then, at step 622, the algorithm searches for the largest U 2 value in the search region. As the search progresses, the matrix address with the largest U 2 value is saved in the processor memory. At the completion of the search, the address remaining in memory is assigned, at step 624, as the first peak location, and P s , x (x,y) is set equal to the coordinates or address of that matrix location. It may be desired to provide a threshold value that must be met before a matrix address will be recognized as a peak location. For example, any convolved matrix address value less than 20 events may not be recognized or utilized as a peak address. The selection of the peak location may be illustrated with reference to Figure 25, which shows U 2 values of some of the matrix location, shown in Figure 13. For example, the U 2 value of 39 at address (22,22) is obtained by summing the U x values (which are equal to the V x values) of the 3 x 3 group of matrix addresses centered on location (22,22); and the U 2 value of 47 at address (28,22) is obtained by summing the U x values of the 3 x 3 group of matrix addresses centered on that matrix address (28,22). The matrix location (25,25) has the largest U 2 value of all those shown in Figure 25, and if the search region consisted of those matrix locations, then address (24,25) would be the first peak location. Next, steps 626, 630, 632, 634 and 636 are performed to determine boundary points of an area covering a cell population. Generally, this is done by drawing a series of radial lines, angularly equally spaced apart, extending outward from the first peak location. On each of these lines, a matrix location is identified that is estimated to be on the edge of the cell population, and these matrix locations are used to determine the second peak location. A second series of radial lines are drawn outward from the second peak location, and a matrix location is identified on each of these lines that is considered to be on the edge of the cell population. As will be understood by those of ordinary skill in the art, the algorithm may be designed to determine any suitable number of these boundary points. As described below, the algorithm determines 36 of these boxindary points. Thus, the variable n ranges from one to 36. More specifically, at step 626, the search region may be reset. In particular, if q=l, then the search region is reset to be the entire convolved matrix; and if q=2, then the search region is set according to step 610, that is, to R-,. At step 628, the algorithm projects thirty six lines L„ outward from P s , x (x,y). These lines are angularly spaced apart 10° and are projected outward to the edge of the transformed matrix. Along each line L„, a weighted, floating seven point average is applied to each transformed matrix address. In particular, for each matrix address m^ on line L Λ , the algorithm, at step 630, determines a weighted average U 2 value for the seven matrix addresses ± - 3 to m x+3 on the line —that is, the seven matrix addresses on line L„ extending from three address locations before m x to three address locations after m x . The algorithm then sets the variable U 3 of the matrix address m x equal to that weighted average value. Preferably, in determining the U 3 value for each matrix m ± , the U 2 value for each of these seven matrix addresses mi_ 3 -m x _. 3 is weighted depending on the distance between the matrix address and m x . For instance, U 2 values of the addresses m x _ 3 to m ±→ . 3 .may be assigned weight values of 1, 2, 3, 4, 3, 2, 1, respectively. Steps 628 and 630 are illustrated in Figures 26 and 27. Figure 26 shows a grid with each block on the grid corresponding to a respective one matrix location. This Figure 26 also shows one matrix designated at P x , x (x,y), and a line segment L x extending outward from P x , x (x,y), and the matrix locations on line L x may be designated m x - m 2S . Figure 27 shows a file or list M x that lists the matrix locations m x -m xs and also lists the U 2 and U 3 values for the matrix locations m 4 -m X5 . As can be seen, for example, the U 3 value of matrix location m xo is the average of the U 2 values of matrix locations m v -m X3 , and the U 3 value of matrix location m X4 is the average of the U 2 values of matrix locations m xx -m x -7. With reference to Figure 23B, at step 632 the algorithm searches, for each line L„, for the matrix address on the line having the minimum U 3 value. If the matrix address having that minimxm U 3 value is not P___.,α(x,y) then G β , x IΪ (x,y) is set equal to the address of the matrix address having that minimum U 3 value. However, if the peak P s „_ι(x,y) has the absolute minimxim U 3 valxie, then G e , x ,„(x,y) is set equal to the address of the matrix location on line L„ at the edge of the transformed matrix. Step 632 is pictorially illustrated in Figxire 28 which is a histogram showing the U 3 values for the matrix locations m 4 -m xs on list M x . At step 634, the algorithm, in effect, searches along this histogram for the minimum U 3 value. With reference again to Figure 23B, if, P s , x (x,y) has the minimxim U 3 value, then G β , x , n (x,y) is set equal to the address of the matrix location on line L„ at the edge of the search region. However, if the matrix address having the minimxim U 3 value is other than P s ,ι(x,Y)/ then G a , x ,r x (x,y) is set equal to the address of the matrix location having that minimum U 3 value. With this procedure, 36 points G β , x ,„(x,y) are determined. After these G a , x ,„(x,y) points are determined, a smoothing process is employed to smooth the polygon defined by those points. Generally, the boundary point on each line L„ is adjusted on the basis of the weighted average distance between P s , x (x,y) and the boundary points on lines L„_ 2 through L„ ^2 . More particularly, at step 646, for each line L„, the algorithm calculates the length, represented by the variable LNGTH1„, between P β , x (x,γ) and G s , x ,„(x,y). Then, at step 650, for each line L„, the algorithm calculates a new length, represented by the variable LNGTH2 n , which is equal to a weighted average of the LNGTH1 values for line L n , the two immediately preceding lines L„_ x and L„_ 2 and the two immediately following lines L n→ . x and L„ 2 . Then, at step 652, for each line L„, the variable H s , x ,„(x,y) is set egxial to the address of the matrix location on line L„ at a distance LNGTH2„ from F»,χ(x,Y). Preferably, when determining the LNGTH2 value for each line L„, the LNGTH1 values for the five lines L„_ 2 to L„ +2 are weighted depending on how close the line is to L„. For example, the LNGTH1 values for the lines L„_ 2 to L„ +2 may be assigned weight values of 1, 2, 3, 2, 1, respectively. Steps 646, 650 and 652 are generally illustrated in Figures 29 and 30, although for the sake of simplicity only six, rather than thirty-six, lines are shown in Figure 30. Six points G s , x , n (x,y) are referenced in Figure 29 at G x -G 6 , and twelve points H β , x ,„(x,y) are referenced therein at H x -H β . After these boundary points H β , x ,„(x,y) are determined, a second peak location, s , 2 (X y) is determined. The x and y coordinates of the second peak location are set equal to the average x and the average y values, respectively, of the coordinates of the H s , x , n (x,y) matrix locations. After this new peak location P s , 2 (x,y) is determined, steps 626-652 are repeated to calculate a new series of boundary points H s , 2 , n (x,y) by drawing a series of new radial lines outward from the new peak location. These new, projected lines are analyzed no further than the edges of the search region when determining the new series of boundary points Hβ, 2 ,„(x,y) . However, the boxindary points H β , 2 ,„(x,y) may be addresses that are found outside of the search region boundaries, depending on the effect of the five point averaging process employed in the determination of those H β , 2 ,„(x,y) points. The series of boundary points H β , 2 ,„(x,y) determined during the second pass through steps 626-652, are considered to be the boundary points of a cell population, and the actual boundary of that cell population is formed by connecting together adjacent boundary points. The boundary, thus, comprises thirty-six line segments connected together to form a polygon, referred to as a gate or an autogate. After this first gate is determined, the matrix locations inside that gate are identified, and the U 2 values of the matrix locations inside that gate are set to zero, as pictorially represented in Figure 31. Next, steps 614-664 are repeated to identify a second cell population and a gate around that second cell population. The location of the peak of that second gate is represented by the term P 2 „ 2 (x,γ), and the boxindary points of that second gate are represented by the term H 2 , 2 , Λ (x,y) , where n equals 1,2..., 36. After the second boundary gate is identified, the matrix locations inside the gate are identified and their U 2 values are all set to zero. With the preferred embodiment of the algorithm illustrated in Figs. 23A through 23D, steps 614-666 are repeated three more times to identify three additional gates in the search region. The peak location of the three cell populations bounded by these three additional gates are represented by the terms P 3 , 2 (x,y), P 4 , 2 (x,γ) and P 5 , 2 (x,y) . Steps 676-690 of the algorithm are then performed to determine which of the five identified cell populations is the one of most interest. With the preferred embo i ent of the algorithm, the most important of these populations is determined by a combination of factors —the sum of all convolved matrix addresses inside the population, and the distance between the peak location of the population and the center of the search region. More specifically, for each cell population or gate, a variable is calculated according to the equation ά__ = Σ__/r B z where ∑ s is the sxim of the convolved matrix addresses inside the gate and r β is the distance between the peak location inside the gate and the center of the search region. Even more specifically, at step 674, the U x value for each matrix address is reset to the original U 2 value for the matrix address. Then, at steps 680 and 682, for each gate, G a , the value ∑ β is set equal to the sum of the U x values of the matrix locations inside the gate, and r β is set equal to the distance between the peak location inside the gate and R(x,y). At step 684, the value d a = Σ„/r « is calculated for each gate, and the algorithm searches for the largest d β value. The algorithm then identifies the autogate having that largest d β values, and identifies the boundary points H β , 2 ,„(x,y) of that gate as the boxindary points of the cell population of interest. From the above discussed data —and in particular, by summing the CD3 positive, the CD19 positive, and the CD16 positive CD3 negative lymphocyte coxints— a value, referred to as the immunosum, may be generated for the sxm of the T-cells, B-cells and NK-cells. The use of the above-described algorithm provides such a value with greater purity, recovery and consistency than traditional light scatter gating. With the above-described algorithm, purity and recovery both, approach 100% in most cases. In addition, by virtue of the direct absolute counting nature of the system, it is possible to directly compare and combine results originating from other samples in the panel. This unique ability allows the use of the immunosum as a denominator for expressing the subsets as percentages of lymphocytes, without the need for an inaccurate and often inappropriate CD45/CD14 lymphocyte gate correction. This ability also allows considerable cross checks to be made between the duplicate measurements obtained from the samples in the panel, and is the basis for a quality control report which may be generated as a result of the analysis. An example of such a report is given in Figure 32. The quality control report is separated into several sections. Each section of the report checks areas in which automatic analysis of the data may require expert review, and helps to determine whether re-analysis of the data is warranted. If any section does not meet the defined criteria, the result is flagged and a data review may be suggested. A background immxinofluorescence check is performed in which the event counts found in the immunoscatter gates of the control sample are expressed as a percentage of the absolute counts obtained in the corresponding immunoscatter autogates of the positive specificities. If the percentages obtained are greater than an acceptance value such as 10%, then a data inspection is suggested. The lymphocyte light scatter gates are cross checked. The mean of the triplicate determinations is calculated, and each lymphocyte gate count must fall within an acceptance range such as 10% of the mean to meet the criteria for acceptance. The CD3 immunoscatter gates are validated as well, as the CD3 count values obtained from the lymphocyte gated CD3 histogram. The mean of each of the duplicate determinations is calculated and each CD3 cαund must fall within an acceptance range such as 5% about the mean of the corresponding two duplicates. The mean CD3 count value obtained from the immunoscatter gates is further validated by comparison to the mean CD3 count obtained from the lymphocyte light scatter gates. The mean CD3 count from the immunoscatter gates is expressed as a percentage of the mean CD3 coxint obtained from the light scatter gates. This CD3 immunoscatter gate recovery must fall within an acceptance range such as 95 to 105%. Additional CD3 gate validation is achieved by comparison to the T-sxim. The T-sum is determined by sximming the 003*004*008 ~ and CD3*CD8" " CD4 ~ counts obtained from the CD4 vs CD8 cytogram. The CD4*CD8* events are excluded from the calculation, thus providing a check on compensation as well. The T-sum is expressed as a percentage of the mean CD3 count obtained from the immunoscatter autogates. This value must fall within an acceptance range such as 90 to 100% for the result to be considered acceptable. The final quality control check performed has with experience proven to be, overall, the most informative. The immunosxim is validated against the mean, light scatter determined lymphocyte count. The immunosxim is expressed as a percentage of the mean lymph count from light scatter. An acceptance range such as 95 to 105% is used for the validation. The examples provided herein exemplify a preferred embodiment of the invention. Those skilled in the art will understand from the description that many further applications, other than those specifically exemplified, are within the scope of invention.

Claims: WHAT IS CLAIMED IS; 1. A method of selecting a subset of data from a matrix representing a data list comprising: (a) defining within the matrix a search region containing the sxibset; (b) locating a maximxim density of data points within the search region; (c) locating a series of minimxim densities of data points which define a boundary surrounding the maximum; and (d) isolating the data points within the region surrounded by the boundary points. 2. A method of selecting from a matrix of data points representing cells, a set of data points representing a population of cells comprising: (a) specifying within the matrix, a search region which contains the population; (b) locating within the search region, a peak point which represents a maximxim density of data points within the population; (c) locating a series of boundary points surrounding the peak point which represent minimxim densities of data points surrounding the peak point; (d) generating a polygon defined by the boundary points surrounding the data points representing the population. 3. The method of Claim 2, wherein the peak point is located by dividing the search region into discrete sxbregions and determining which sxibregion includes a maximxim density of data points. 4. The method of Claim 3, wherein the sxibregions are grouped in 3 X 3 blocks and the peak point is located by determining which block includes the sxibregion with the maximxim density of data points. 5. The method of Claim 2, wherein the boxindary points are located by sequentially determining the minimxim density of data points on successive radial projections from the peak point. 6. The method of Claim 5 wherein the radial projections are at radial intervals of 10°. 7. A method of isolating from a flow cytometry cytogram matrix, a set of population data points corresponding to a specific population of cells for further analysis, comprising: (a) defining a search region, within the cytogram matrix, which includes the population data; (b) dividing the search region into discrete sxibregions; (c) determining the density of population data points within each sxibregion; (d) locating a peak point in the center of a sxibregion having the highest density of data points; (e) determining a point of minimxim density along each of a series of radial projections from the peak point; (f) locating a boundary point at each of the minimxim density points; (g) defining a polygon which connects the boundary points and surrounds the population data points; and (h) subtracting the population data within the polygon from the cytogram matrix data. 8. In a flow cytometry system for optically analyzing a sample in which data points representing cells in the sample are aggregated in a matrix based on selected optical parameters, a method of isolating a group of data points representing cells in an identified population, comprising: (a) specifying within the matrix, a search region which contains the identified population; (b) locating within the search region, a peak point which represents a maximxim density of data points within the population; (c) locating a series of boundary points surrounding the peak point which represent minimxim densities of data points surrounding the peak point; (d) generating a polygon defined by the boundary points; and (e) subtracting from the matrix the data points within the polygon. 9. A method of identifying cells of a given type in a group of cells, comprising the steps of: plotting the group of cells on a graph; identifying the plot on the graph of one cell of the given type; defining a boundary on the graph for the plots of the cells of the given type and extending around said one cell of the given type; and identifying the cells plotted on the graph inside said boundary. 10. A method according to claim 9, wherein the step of defining the boxindary for the plots of the cells of the given type includes the step of identifying a multitude of points on said boundary. 11. A method according to claim 10, wherein: the step of defining the boundary for the plots of the cells of the given type further includes the step of defining a multitude of line segments on the graph extending outward from the plot on the graph of said one cell of the given type; and the step of identifying the multitude of points on said boundary includes the step of identifying a respective one point on each of the multitude of line segments and said boundary. 12. A method according to claim 11, wherein the step of identifying a respective one point on each of the line segments includes the steps of: separating each line segment into a multitude of sections; assigning a density value to each section of each line segment; and searching outward along each line segment, from the plot of said one cell of the given type, for one of the sections of the line segment having a relative minimxim density value. 13. A method according to claim 12, further including the step of identifying a search region on the graph, and wherein: the step of identifying the plot on the graph of said one cell of the given type includes the step of searching only in the search region for the plot of said one cell; and the step of searching outward along each line segment includes the step of limiting the search outward along each line segment to the search region. 14. A method according to claim 9, further including the step of determining the nximber of cells plotted on the graph inside said boundary. 15. A method according to claim 9, wherein the plotting step includes the steps of: measuring values for first and second parameters associated with each of the group of cells; and for each of the group of cells, plotting the measured value for the first parameter associated with the cell versus the measured value for the second parameter associated with the cell. 16. A method according to claim 9, wherein the step of identifying the plot on the graph of said one cell includes the steps of: separating at least a portion of the graph into a multitude of zones; assigning each of the zones a density value based on the density of the number of cells plotted in the zone; and searching for the zone having the largest density value. 17. A method of analyzing a fluid solution containing cells, comprising the steps of: measuring values for first and second parameters associated with each of a set of cells in the fluid solution; assigning a cell address to each cell in said set of cells based on the measured values for the first and second parameters associated with the cell; and analyzing the cell addresses according to a predetermined program to determine a population of at least one type of cell in the fluid solution. 18. A method according to claim 17, wherein each cell address corresponds to a respective one matrix address in a matrix, and the analyzing step includes the steps of: identifying the matrix addresses corresponding to the cell addresses assigned to the cells of said one type; and determining the number of cells having cell addresses corresponding to the identified matrix addresses. 19. A method according to claim 18, wherein the matrix includes a multitude of locations, each of said locations having a respective one matrix address, and the matrix locations having addresses corresponding to the cell addresses assigned to the cells of said one type form a cluster, and wherein the step of identifying the matrix addresses corresponding to the cell addresses assigned to the cells of said one type includes the steps of: identifying a border of the cluster; and identifyingmatrix locations inside said border. 20. A method according to claim 19, wherein the step of identifying a border of the cluster includes the step of identifying matrix locations on said border. 21. A method according to claim 20, wherein the step of identifying matrix locations on said border includes the steps of: defining a multitude of line segments intersecting with said border; and for each of said line segments, identifying one matrix location on said each line segment and the border of the cluster. 22. A method according to claim 21, wherein the step of identifying one matrix location on said each line segment includes the steps of: assigning a density value to each matrix location on said each line segment; and identifying the matrix location on said each line segment having a relative minimum density value. 23. A method of identifying a population of a given type of cell in a group of cells, comprising the steps of: plotting the group of cells on a graph; defining boundaries for each of a multitude of clusters of the cells plotted on the graph; and identifying one of the clusters of cells as a cell population of the given type. 24. A method according to claim 23, wherein the step of identifying one of the clusters of cells as a cell population of the given type includes the steps of: determining the number of cells in each cluster of cells; assigning a value to each cluster of cells base on (i) the number of cells in the cluster, and (ii) the location of the cluster on the graph; and identifying the cluster of cells having the largest of said values as the cell population of the given type . 25. A method according to claim 24, wherein the step of assigning a value to each cluster of cells includes the steps of: identifying a predetermined point on the graph; identifying the location of one point in the cluster of cells; determining the distance between said predetermined point and said one point in the cluster of cells; and assigning the value to the cluster of cells based on (i) the number of cells in the cluster, and (ii) said distance. 26. A method according to claim 25, wherein: the step of identifying one of the clusters of cells as a cell population of the given type further includes the step of identifying a search region on the graph; and the step of identifying a predetermined point on the graph includes the step of identifying the location of a mid point of the search region. 27. A method according to claim 26, wherein the step of defining boxindaries for the clusters of cells includes the step of maintaining said boundaries in the search region. 28. A method according to claim 23, wherein the plotting step includes the steps of: measuring values for first and second parameters associated with each of the group of cells; and plotting on the graph, the measured value for the first parameter versus the measured value for the second parameter for each of the group of cells. 29. A system for analyzing a fluid solution having cells, comprising: a flow cytometer including i) a flow cell to conduct the cells of the solution along a predetermined path, ii) means to illuminate the cells in the flow cell, and iii) means to measure values for at least first and second optical parameters of the cells, and to generate signals representing said first and second optical parameters; and processing means to receive the signals from the flow cytometer, and including i) means to use the measured values for the first and second optical parameters to plot the cells on a graph, ii) means to define a boundary on the graph for the plots of the cells of a given type, and iii) means to determine the number of cells plotted inside the boundary on the graph. 30. A system according to claim 21, wherein the graph has first and second axes, and the means to plot the cells on the graph includes: means to locate the plot of each cell along the first axis on the basis of the measured value for the first optical parameters of the cell; and means to locate the plot of each cell along the second axis on the basis of the measxired value for the second optical parameter of the cell. 31. A system according to claim 29, wherein the means to define the boundary on the graph includes means to define a multitude of boundary points on the graph for the plots of the cells of the given type. 32. A system according to claim 31, wherein the means to define the boxindary points includes: means to define a multitude of line segments extending through the plots of the cells of the given type ; and means to define a respective one boundary point on each of said line segments. 33. A system according to claim 29, wherein the means to define the boundary on the graph for the plots of the cells of the given type includes: means to define boundaries for each of a multitude of clusters of cells plotted on the graph; and means to identify one of the clusters as a cluster of cells of the given type. 34. A system according to claim 29, wherein the means to define the boxindary on the graph for the plots of the cells of the given type includes: means to identify on the graph the plot of one of the cells of the given type; and means to define a boundary around the plot of said one of the cells of the given type. 35. A system according to claim 34, wherein the means to identify the plot of one of the cells of the given type includes: means to separate at least a portion of the graph into a multitude of zones; means to assign to each zone a value based on the number of cells plotted in the zone; and means to identify the zone having the largest of said values. 36. Apparatus for analyzing a fluid solution containing cells, comprising: a flow cytometer to measure values for first and second parameters associated with the cells, and to generate signals representing said measured values; and a processing system connected to the flow cytometer to receive the signals therefrom, to process said signals according to a predetermined program to determine a population of at least one type of cell in the fluid solution, and to generate an output signal representing said population. 37. Apparatus according to claim 36, wherein the processing system includes: means to assign a cell address to each of a multitude of cells based on the measured values for the first and second parameters associated with the cell; and means to analyze the cell addresses according to a predetermined program to determine the population of said at least one type of cell. 38. Apparatus according to claim 37, wherein each cell address corresponds to a respective one matrix address in a matrix, and the means to analyze includes: means to identify the matrix addresses corresponding to the cell addresses assigned to the cells of said one type; and means to determine the nximber of cells having cell addresses corresponding to the identified matrix addresses. 39. Apparatus according to claim 38, wherein the matrix includes a multitude of locations, each of said locations has a respective one matrix address, and the matrix locations having addresses corresponding to the cell addresses assigned to the cells of said one type form a clxister on the matrix, and the means to identify the matrix addresses corresponding to the cell addresses assigned to the cells of said one type includes: means to identify a border of the cluster; and means to identify the matrix locations inside said border. 40. Apparatus according to claim 36, wherein the processing system includes: means to plot the cells on a graph using the measured values for the first and second parameters associated with the cells; means to define boundaries for each of a multitude of clusters of the cells plotted on the graph; and means to identify one of the cluster of cells as the cell population of said at least one type. 41. Apparatus according to claim 40, wherein the means to identify one of the clusters of cells as the cell population of said at least one type includes: means to determine the number of cells in each cluster of cells; means to assign a value to each cluster of cells based on (i) the number of cells in the cluster, and (ii) the location of the clxister on the graph; and means to identify the cluster of cells having the largest of said values as the cell population of said at least one type. 42. Apparatus according to claim 41, wherein the means to define boundaries for the clusters of cells includes: means to define, for each cluster, a multitude of line segments extending through the cluster; and means to define, for each line segment of each cluster, a point on the line segment and the border of the cluster. 43. A method of obtaining a count of the number of lymphocytes in a solution, comprising: obtaining values for at least two parameters of each cell in the solution; identifying a cluster of values for the two parameters associated with lymphocytes; and determining the number of cells having values for the two parameters in said cluster of values. 44. A method according to claim 43, wherein the obtaining step includes the steps of: conducting the solution through a cytometer; directing a light beam onto the solution conducted through the cytometer; and measuring values for at least two parameters of the light beam after the beam is incident on the solution. 45. A method according to claim 43, wherein: the identifying step includes the steps of plotting the values for the two parameters of each cell on a graph, and identifying a cluster of cells on the graph that are associated with lymphocytes; and the determining step includes the step of determining the nximber of cells plotted in the cluster. 46. A system for obtaining a count of the number of lymphocytes in a solution, comprising: means to obtain values for at least two parameters of each cell in the solution; means to identify a cluster of values for the two parameters associated with lymphocytes; and means to determine the nximber of cells having values for the two parameters in said cluster of values. 47. A system according to claim 46, wherein the means to obtain values includes: a flow cytometer; means to conduct the solution through the flow cytometer; means to direct a laser beam onto the solution conducted through the cytometer; and means to measure values for at least two parameters of the light beam after the beam is incident on the solution. 48. A system according to Claim 46, wherein: the means to identify the cluster of values includes means to plot the values for the two parameters of each cell on a graph, and to identify a cluster of cells on the graph that are associated with lymphocytes, and the means to determine includes means to determine the nximber of cells plotted in the clxister.

Inventors: DECHIRICO GIOACCHINO, GRIFFIS MARK D, MERCOLINO THOMAS J, MEYER ERIC J, PETROU GEORGE V, DECHIRICO, GIOACCHINO, GRIFFIS, MARK, D., MERCOLINO, THOMAS, J., MEYER, ERIC, J., PETROU, GEORGE, V.
Applicants: DECHIRICO GIOACCHINO, GRIFFIS MARK D, MERCOLINO THOMAS J, MEYER ERIC J, ORTHO DIAGNOSTIC SYSTEMS INC, PETROU GEORGE V, DECHIRICO, GIOACCHINO, GRIFFIS, MARK, D., MERCOLINO, THOMAS, J., MEYER, ERIC, J., ORTHO DIAGNOSTIC SYSTEMS, INC., PETROU, GEORGE, V.
Application year: 1994
Main classification: G06F15
IPC codes: G01N15, G01N33