Florian Steinberg

Learn More
Retromer is a protein assembly that orchestrates the sorting of transmembrane cargo proteins into endosome-to-Golgi and endosome-to-plasma-membrane transport pathways. Here, we have employed quantitative proteomics to define the interactome of human VPS35, the core retromer component. This has identified a number of new interacting proteins, including(More)
Retromer is a protein assembly that plays a central role in orchestrating export of transmembrane-spanning cargo proteins from endosomes into retrieval pathways destined for the Golgi apparatus and the plasma membrane [1]. Recently, a specific mutation in the retromer component VPS35, VPS35(D620N), has linked retromer dysfunction to familial autosomal(More)
The FERM-like domain-containing sorting nexins of the SNX17/SNX27/SNX31 family have been proposed to mediate retrieval of transmembrane proteins from the lysosomal pathway. In this paper, we describe a stable isotope labeling with amino acids in culture-based quantitative proteomic approach that allows an unbiased, global identification of transmembrane(More)
The sorting nexin 27 (SNX27)-retromer complex is a major regulator of endosome-to-plasma membrane recycling of transmembrane cargos that contain a PSD95, Dlg1, zo-1 (PDZ)-binding motif. Here we describe the core interaction in SNX27-retromer assembly and its functional relevance for cargo sorting. Crystal structures and NMR experiments reveal that an(More)
We promote the theory of computational complexity on metric spaces: as natural common generalization of (i) the classical discrete setting of integers, binary strings, graphs etc. as well as of (ii) the bit-complexity theory on real numbers and functions according to Friedman, Ko (1982ff), Cook, Braverman et al.; as (iii) resource-bounded refinement of the(More)
We extend the framework by Kawamura and Cook for investigating computational complexity for operators occuring in analysis. This model is based on second-order complexity theory for functionals on the Baire space, which is lifted to metric spaces by means of representations. Time is measured in terms of the length of the input encodings and the required(More)
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared to more natural representations for these spaces. The formal framework for the comparisons is provided by Weihrauch(More)