Lecture

Methods in Immunology: Part I

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

BIO-310: Immunology

Ce cours décrit le fonctionnement du système immunitaire humain et les bases immunologiques de la vaccination, de la transplantation, de l'immunothérapie, et de l'allergie. Il présente aussi le rôle des cellules souches dans la formation des tissus, notamm ...

Description

This lecture covers the identification of molecules using antibodies, including the use of a mouse coupled to a fluorophore, primary antibody detection, and the detection and quantification of molecules from complex mixtures. It also explains ELISA techniques, standard curve establishment, and signal amplification for direct and indirect detection methods.

In MOOC

Introduction to immunology (part 2)

Instructors (2)

Bruno Lemaitre

Personal Webpage http://brunolemaitre.ch Personal Webpage http://brunolemaitre.ch Teaching & PhD PhD Students Blandine Ribotta, Yao Tian, Désirée Popelka, Prince Kumar Sah, Siqi Wang, Kenan Krakovic, Nathan Alexandre Klotz Past EPFL PhD Students Sveta Chakrabarti, Olivier Binggeli, Jeremy Keith Herren, Juan Camilo Paredes Escobar, Alfred Chng, Maroun Bou Sleiman, Jan Paul Dudzic, Mario Gonzalo Garcia Arraez, Claudia Melcarne, Alice Marra, Bianca Marie Petrignani, Mark Austin Hanson, Alexia Laurie Carboni

David Michael Suter

Teaching & PhD PhD Students Ekaterina Lyublinskaya, Yuliia Romaniuk, Joanna Agnieszka Dembska, Solomon Nshemereirwe Past EPFL PhD Students Onur Tidin, Aleksandra Mandic, Daniel Strebinger, Andrea Brigitta Alber, Mahé Raccaud, Torgil Elias Friman, Shoujie Sun, Silja Michelle Placzek, Romane Mizeret, Benjamin Martin, Sim Sakong, Stella Katharina Krämer Past EPFL PhD Students as codirector Damien Lionel Nicolas, Isabelle Chareyron, Christopher Tadhg James Wall, Kolly Dominique Courses Immunology BI

Official source

Quiz

Related concepts (15)

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula.

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

Existential quantification

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier ("∃x" or "∃(x)" or "(∃x)"). Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain.

Branching quantifier

In logic a branching quantifier, also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering of quantifiers for Q ∈ {∀,∃}. It is a special case of generalized quantifier. In classical logic, quantifier prefixes are linearly ordered such that the value of a variable ym bound by a quantifier Qm depends on the value of the variables y1, ..., ym−1 bound by quantifiers Qy1, ..., Qym−1 preceding Qm. In a logic with (finite) partially ordered quantification this is not in general the case.

Uniqueness quantification

In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition. This sort of quantification is known as uniqueness quantification or unique existential quantification, and is often denoted with the symbols "∃!" or "∃=1". For example, the formal statement may be read as "there is exactly one natural number such that ". The most common technique to prove the unique existence of a certain object is to first prove the existence of the entity with the desired condition, and then to prove that any two such entities (say, and ) must be equal to each other (i.

Related lectures (64)

Inference Engines: Resolution and Horn Clauses

Covers inference engines based on resolution, Horn clauses, filtering, and unification in artificial intelligence.

The Role of Symmetries

Delves into symmetries in physics, covering group theory, perturbation, and quantification.

Risk Analysis in Project Management

Explores risk analysis in project management, covering identification, prevention, quantification, and lean management.

Predicate Logic: Quantifiers, CNF, DNF

Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.

Physics-guided NMF for STEM/EDXS Data Analysis