Transport of LAPTM5 to lysosomes requires association with the ubiquitin ligase Nedd4, but not LAPTM5 ubiquitination
Bibliographic record
Abstract
LAPTM5 is a lysosomal transmembrane protein expressed in immune cells. We show that LAPTM5 binds the ubiquitin-ligase Nedd4 and GGA3 to promote LAPTM5 sorting from the Golgi to the lysosome, an event that is independent of LAPTM5 ubiquitination. LAPTM5 contains three PY motifs (L/PPxY), which bind Nedd4-WW domains, and a ubiquitin-interacting motif (UIM) motif. The Nedd4-LAPTM5 complex recruits ubiquitinated GGA3, which binds the LAPTM5-UIM; this interaction does not require the GGA3-GAT domain. LAPTM5 mutated in its Nedd4-binding sites (PY motifs) or its UIM is retained in the Golgi, as is LAPTM5 expressed in cells in which Nedd4 or GGA3 is knocked-down with RNAi. However, ubiquitination-impaired LAPTM5 can still traffic to the lysosome, suggesting that Nedd4 binding to LAPTM5, not LAPTM5 ubiquitination, is required for targeting. Interestingly, Nedd4 is also able to ubiquitinate GGA3. These results demonstrate a novel mechanism by which the ubiquitin-ligase Nedd4, via interactions with GGA3 and cargo (LAPTM5), regulates cargo trafficking to the lysosome without requiring cargo ubiquitination.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".