skip to main content


Title: Engineering heterologous enzyme secretion in Yarrowia lipolytica
Abstract Background

Eukaryotic cells are often preferred for the production of complex enzymes and biopharmaceuticals due to their ability to form post-translational modifications and inherent quality control system within the endoplasmic reticulum (ER). A non-conventional yeast species,Yarrowia lipolytica, has attracted attention due to its high protein secretion capacity and advanced secretory pathway. Common means of improving protein secretion inY. lipolyticainclude codon optimization, increased gene copy number, inducible expression, and secretory tag engineering. In this study, we develop effective strategies to enhance protein secretion using the model heterologous enzyme T4 lysozyme.

Results

By engineering the commonly used native lip2prepro secretion signal, we have successfully improved secreted T4 lysozyme titer by 17-fold. Similar improvements were measured for other heterologous proteins, including hrGFP and$$\alpha$$α-amylase. In addition to secretion tag engineering, we engineered the secretory pathway by expanding the ER and co-expressing heterologous enzymes in the secretion tag processing pathway, resulting in combined 50-fold improvement in T4 lysozyme secretion.

Conclusions

Overall, our combined strategies not only proved effective in improving the protein production inYarrowia lipolytica, but also hint the possible existence of a different mechanism of secretion regulation in ER and Golgi body in this non-conventional yeast.

 
more » « less
NSF-PAR ID:
10368503
Author(s) / Creator(s):
;
Publisher / Repository:
Springer Science + Business Media
Date Published:
Journal Name:
Microbial Cell Factories
Volume:
21
Issue:
1
ISSN:
1475-2859
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1.  
    more » « less
  2. Abstract Background

    Rapid improvements in inexpensive, low-power, movement and environmental sensors have sparked a revolution in animal behavior research by enabling the creation of data loggers (henceforth, tags) that can capture fine-grained behavioral data over many months. Nevertheless, development of tags that are suitable for use with small species, for example, birds under 25 g, remains challenging because of the extreme mass (under 1$$\textrm{g}$$g) and power (average current under 1$$\upmu$$μA) constraints. These constraints dictate that a tag should carry exactly the sensors required for a given experiment and the data collection protocol should be specialized to the experiment. Furthermore, it can be extremely challenging to design hardware and software to achieve the energy efficiency required for long tag life.

    Results

    We present an activity monitor, BitTag, that can continuously collect activity data for 4–12 months at 0.5–0.8$$\textrm{g}$$g, depending upon battery choice, and which has been used to collect more than 500,000 h of data in a variety of experiments. The BitTag architecture provides a general platform to support the development and deployment of custom sub-$$\textrm{g}$$gtags. This platform consists of a flexible tag architecture, software for both tags and host computers, and hardware to provide the host/tag interface necessary for preparing tags for “flight” and for accessing tag data “post-flight”. We demonstrate how the BitTag platform can be extended to quickly develop novel tags with other sensors while satisfying the 1g/1$$\upmu$$μA mass and power requirements through the design of a novel barometric pressure sensing tag that can collect pressure and temperature data every 60$$\textrm{s}$$sfor a year with mass under 0.6$$\textrm{g}$$g.

     
    more » « less
  3. null (Ed.)
    Abstract Background Eukaryotes use distinct networks of biogenesis factors to synthesize, fold, monitor, traffic, and secrete proteins. During heterologous expression, saturation of any of these networks may bottleneck titer and yield. To understand the flux through various routes into the early secretory pathway, we quantified the global and membrane-associated translatomes of Komagataella phaffii . Results By coupling Ribo-seq with long-read mRNA sequencing, we generated a new annotation of protein-encoding genes. By using Ribo-seq with subcellular fractionation, we quantified demands on co- and posttranslational translocation pathways. During exponential growth in rich media, protein components of the cell-wall represent the greatest number of nascent chains entering the ER. Transcripts encoding the transmembrane protein PMA1 sequester more ribosomes at the ER membrane than any others. Comparison to Saccharomyces cerevisiae reveals conservation in the resources allocated by gene ontology, but variation in the diversity of gene products entering the secretory pathway. Conclusion A subset of host proteins, particularly cell-wall components, impose the greatest biosynthetic demands in the early secretory pathway. These proteins are potential targets in strain engineering aimed at alleviating bottlenecks during heterologous protein production. 
    more » « less
  4. Abstract Background

    Given a sequencing read, the broad goal of read mapping is to find the location(s) in the reference genome that have a “similar sequence”. Traditionally, “similar sequence” was defined as having a high alignment score and read mappers were viewed as heuristic solutions to this well-defined problem. For sketch-based mappers, however, there has not been a problem formulation to capture what problem an exact sketch-based mapping algorithm should solve. Moreover, there is no sketch-based method that can find all possible mapping positions for a read above a certain score threshold.

    Results

    In this paper, we formulate the problem of read mapping at the level of sequence sketches. We give an exact dynamic programming algorithm that finds all hits above a given similarity threshold. It runs in$$\mathcal {O} (|t| + |p| + \ell ^2)$$O(|t|+|p|+2)time and$$\mathcal {O} (\ell \log \ell )$$O(log)space, where |t| is the number of$$k$$k-mers inside the sketch of the reference, |p| is the number of$$k$$k-mers inside the read’s sketch and$$\ell$$is the number of times that$$k$$k-mers from the pattern sketch occur in the sketch of the text. We evaluate our algorithm’s performance in mapping long reads to the T2T assembly of human chromosome Y, where ampliconic regions make it desirable to find all good mapping positions. For an equivalent level of precision as minimap2, the recall of our algorithm is 0.88, compared to only 0.76 of minimap2.

     
    more » « less
  5. Abstract

    A wide range of dark matter candidates have been proposed and are actively being searched for in a large number of experiments, both at high (TeV) and low (sub meV) energies. One dark matter candidate, a deeply bounduuddsssexaquark,$$S$$S, with mass$$\sim 2$$2GeV (having the same quark content as the hypothesized H-dibaryon, but long lived) is particularly difficult to explore experimentally. In this paper, we propose a scheme in which such a state could be produced at rest through the formation of$$\bar{p}$$p¯$$^3$$3He antiprotonic atoms and their annihilation into$$S$$S+$$K^+K^+\pi ^-$$K+K+π-, identified both through the unique tag of a$$S=+2, Q=+1$$S=+2,Q=+1final state, as well as through full kinematic reconstruction of the final state recoiling against it.

     
    more » « less