An expectation–maximization approach to quantifying protein stoichiometry with single-molecule imaging
Bibliographic record
Abstract
Motivation: Single-molecule localization microscopy (SMLM) is a super-resolution technique capable of rendering nanometer scale images of cellular structures. Recently, much effort has gone into developing algorithms for extracting quantitative features from SMLM datasets, such as the abundance and stoichiometry of macromolecular complexes. These algorithms often require knowledge of the complicated photophysical properties of photoswitchable fluorophores. Results: Here, we develop a calibration-free approach to quantitative SMLM built upon the observation that most photoswitchable fluorophores emit a geometrically distributed number of blinks before photobleaching. From a statistical model of a mixture of monomers, dimers and trimers, the method employs an adapted expectation-maximization algorithm to learn the protomer fractions while simultaneously determining the single-fluorophore blinking distribution. To illustrate the utility of our approach, we benchmark it on both simulated datasets and experimental datasets assembled from SMLM images of fluorescently labeled DNA nanostructures. Availability and implementation: An implementation of our algorithm written in Python is available at: https://www.utm.utoronto.ca/milsteinlab/resources/Software/MMCode/. Supplementary information: online.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.010 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".