Lecture

Single Proteins Maps: Sabrina Simoncelli

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.

Description

This lecture by the instructor covers the methodology of single-molecule localization microscopy, focusing on the transition from single-molecule localizations to single proteins maps. The presentation includes details on biological samples, DNA-PAINT, protein distribution, k-means clustering, and the application of these techniques in T-cell signaling. Pros and cons of the methodology are discussed, highlighting the limitations when counting localizations and the reliability of k-means clustering. The lecture concludes with acknowledgments to collaborators and funding sources.

Official source

Related concepts (19)

Cluster analysis

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters). It is a main task of exploratory data analysis, and a common technique for statistical data analysis, used in many fields, including pattern recognition, , information retrieval, bioinformatics, data compression, computer graphics and machine learning.

K-means clustering

k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells. k-means clustering minimizes within-cluster variances (squared Euclidean distances), but not regular Euclidean distances, which would be the more difficult Weber problem: the mean optimizes squared errors, whereas only the geometric median minimizes Euclidean distances.

Hierarchical clustering

In data mining and statistics, hierarchical clustering (also called hierarchical cluster analysis or HCA) is a method of cluster analysis that seeks to build a hierarchy of clusters. Strategies for hierarchical clustering generally fall into two categories: Agglomerative: This is a "bottom-up" approach: Each observation starts in its own cluster, and pairs of clusters are merged as one moves up the hierarchy. Divisive: This is a "top-down" approach: All observations start in one cluster, and splits are performed recursively as one moves down the hierarchy.

Protein complex

A protein complex or multiprotein complex is a group of two or more associated polypeptide chains. Protein complexes are distinct from multidomain enzymes, in which multiple catalytic domains are found in a single polypeptide chain. Protein complexes are a form of quaternary structure. Proteins in a protein complex are linked by non-covalent protein–protein interactions. These complexes are a cornerstone of many (if not most) biological processes.

Protein structure

Protein structure is the three-dimensional arrangement of atoms in an amino acid-chain molecule. Proteins are polymers - specifically polypeptides - formed from sequences of amino acids, which are the monomers of the polymer. A single amino acid monomer may also be called a residue, which indicates a repeating unit of a polymer. Proteins form by amino acids undergoing condensation reactions, in which the amino acids lose one water molecule per reaction in order to attach to one another with a peptide bond.

Related lectures (64)

Graph metrics: Statistical analysis

Explores graph metrics and statistical analysis in network clustering, including ERGMs application in sociology and asymptotics.

Clustering: k-means

Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.

Statistical Analysis of Networks: Link Prediction and Biclustering

Explores link prediction, logistic regression, causal inference, and biclustering in statistical network analysis.

K-Means Clustering: Basics and Applications

Introduces K-Means Clustering, a simple yet effective algorithm for grouping data points into clusters.

Supervised Learning Overview