Lecture

Molecular Assays: Types and Applications

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

EE-515: Fundamentals of biosensors and electronic biochips

The labels "biosensor" and "eBiochip" have been employed to refer to the most diverse systems and in several fields of application. The course is meant not only to provide means to dig into this sea

Description

This lecture covers the classifications and configurations of molecular assays, including homogeneous and heterogeneous assays such as direct, sandwich, competition, and inhibition assays. It discusses the main issues encountered in surface sensing, such as reagent availability, mass-transport phenomena, interference in matrices, ligand design, stability, and regeneration. The lecture also delves into molecular quantification, explaining the upper and lower limits of measurable concentrations and the impact of excess reagent conditions. Additionally, it explores the challenges related to target molecule availability, interference from non-specific molecules, and the kinetics of binding and dissociation on surfaces.

Instructor

Carlotta Guiducci

Teaching & PhD PhD Students Micaela Siria Cristofori, Edoardo Bargis, Yide Jiao, Seyyed Hamid Sadat Mansoury Past EPFL PhD Students Giulia Cappi, Enrico Accastelli, Anna Ferretti, Enrica Rollo, Samuel Kilchenmann, Elena-Diana Bojescu, Kevin Keim, Pierre-Emmanuel Marie Thiriet, Saurabh Tomar, Gloria Porro, Till Jonathan Ryser Past EPFL PhD Students as codirector Yüksel Temiz Courses Electrical systems and electronics I EE-295 The course has the aim to provide the fundamental knowledge and e

Official source

Related concepts (26)

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.

Small molecule

In molecular biology and pharmacology, a small molecule or micromolecule is a low molecular weight (≤ 1000 daltons) organic compound that may regulate a biological process, with a size on the order of 1 nm. Many drugs are small molecules; the terms are equivalent in the literature. Larger structures such as nucleic acids and proteins, and many polysaccharides are not small molecules, although their constituent monomers (ribo- or deoxyribonucleotides, amino acids, and monosaccharides, respectively) are often considered small molecules.

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.

Related lectures (58)

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.

Physics-guided NMF for STEM/EDXS Data Analysis

Explores Physics-guided NMF for STEM/EDXS data analysis, covering challenges, optimization, constraints, and advantages of the modelization.

Predicate Logic: Quantifiers, CNF, DNF

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

Automated PV Hosting Capacity Quantification