Search PubMed⌕ Search

Biomedical subjects

Ramit Mehr

Publications and source records attributed to Ramit Mehr.

20 records · Page 2Linked to original sources

Models for natural killer cell repertoire formation.

Natural killer (NK) cells lyse only cells that do not express sufficient levels of self class I MHC molecules. Inhibition of lysis is mediated by inhibitory receptors expressed by NK cells, such as the murine Ly49 receptors, that bind to MHC class I molecules. Since inhibitory receptor genes and MHC class I genes are located on different chromosomes, and are hence not automatically co-inherited, NK cells apparently adapt to the MHC environment during their development. Two models have been proposed to account for this "education" process of NK cells. The two-step selection model postulates that developing NK cells initiate the stable expression of a random set of Ly49 genes, and then undergo two selection steps, one for cells that express a sufficient number of self-MHC receptors, and one against cells that express too many inhibitory receptors. The sequential model postulates that a cell keeps initiating the stable expression of additional inhibitory receptors until a sufficient expression level of self-MHC specific receptors is reached, and the cell matures. In this study we implement both models in computer simulations, and compare simulation results to experimental data, in order to evaluate the relative plausibility of the two models.

Animals↗

Designing an A* algorithm for calculating edit distance between rooted-unordered trees.

Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natural comparison metric is the "Tree Edit Distance," the number of simple edit (insert/delete) operations needed to transform one tree into the other. Rooted-ordered trees, where the order between the siblings is significant, can be compared in polynomial time. Rooted-unordered trees are used to describe processes or objects where the topology, rather than the order or the identity of each node, is important. For example, in immunology, rooted-unordered trees describe the process of immunoglobulin (antibody) gene diversification in the germinal center over time. Comparing such trees has been proven to be a difficult computational problem that belongs to the set of NP-Complete problems. Comparing two trees can be viewed as a search problem in graphs. A* is a search algorithm that explores the search space in an efficient order. Using a good lower bound estimation of the degree of difference between the two trees, A* can reduce search time dramatically. We have designed and implemented a variant of the A* search algorithm suitable for calculating tree edit distance. We show here that A* is able to perform an edit distance measurement in reasonable time for trees with dozens of nodes.

Algorithms↗