Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/994Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vashisht, Piyush | - |
| dc.contributor.author | Gupta, Anubha (Advisor) | - |
| dc.date.accessioned | 2022-03-31T10:21:01Z | - |
| dc.date.available | 2022-03-31T10:21:01Z | - |
| dc.date.issued | 2021-05 | - |
| dc.identifier.uri | http://repository.iiitd.edu.in/xmlui/handle/123456789/994 | - |
| dc.description.abstract | The analysis of flow cytometry data requires identification of cell clusters. This clustering is done manually by applying gating techniques and by analyzing the plot scatter across each dimension. Since all of this is done manually it becomes really hard to find some rare event or to identify the cluster. The aim of this project is to develop a clustering algorithm that would automate the process of cluster formation on large flow cytometric data.Flow cytometry (FCM) is a technique used to detect and measure physical and chemical characteristics of a population of cells or particles.(Wikipedia)The cells are placed in a column filled with saline(NaCl+H2O).The cells exits the column one at a time. Saline helps in this process through hydro focalization’s soon as the cell exit the column a laser beam hits them and the cell scatters the laser beam in accordance to its size and complexity. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | IIIT- Delhi | en_US |
| dc.subject | clustering algorithm | en_US |
| dc.subject | cytometric data | en_US |
| dc.subject | cell clusters | en_US |
| dc.subject | Flow cytometry (FCM) | en_US |
| dc.title | Developing a clustering algorithm to analyse flow cytometric data | en_US |
| dc.type | Other | en_US |
| Appears in Collections: | Year-2021 | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Piyush Vashisht_2017303.pdf Restricted Access | 927.63 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.