Skip to main content

Synthesis for Vesicle Traffic Systems

  • Conference paper
  • First Online:
Book cover Computational Methods in Systems Biology (CMSB 2018)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 11095))

Included in the following conference series:

Abstract

Vesicle Traffic Systems (VTSs) are the material transport mechanisms among the compartments inside the biological cells. The compartments are viewed as nodes that are labeled with the containing chemicals and the transport channels are similarly viewed as labeled edges between the nodes. Understanding VTSs is an ongoing area of research and for many cells they are partially known. For example, there may be undiscovered edges, nodes, or their labels in a VTS of a cell. It has been speculated that there are properties that the VTSs must satisfy. For example, stability, i.e., every chemical that is leaving a compartment comes back. Many synthesis questions may arise in this scenario, where we want to complete a partially known VTS under a given property. In the paper, we present novel encodings of the above questions into the QBF (quantified Boolean formula) satisfiability problems. We have implemented the encodings in a highly configurable tool and applied to a couple of found-in-nature VTSs and several synthetic graphs. Our results demonstrate that our method can scale up to the graphs of interest.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/arey0pushpa/pyZ3.

References

  1. Alberts, B., et al.: Essential Cell Biology. Garland Science, Auerbach (2013)

    Google Scholar 

  2. Bonifacino, J.S., Glick, B.S.: The mechanisms of vesicle budding and fusion. Cell 116(2), 153–166 (2004)

    Article  Google Scholar 

  3. Hong, W.J., Lev, S.: Tethering the assembly of snare complexes. Trends Cell Biol. 24(1), 35–43 (2014)

    Article  Google Scholar 

  4. Chanaday, N.L., Kavalali, E.T.: How do you recognize and reconstitute a synaptic vesicle after fusion? F1000Research 6, 1734 (2017)

    Article  Google Scholar 

  5. D’Agostino, M., Risselada, H.J., Lürick, A., Ungermann, C., Mayer, A.: A tethering complex drives the terminal stage of snare-dependent membrane fusion. Nature 551(7682), 634 (2017)

    Google Scholar 

  6. Rodepeter, F.R.: Indication for differential sorting of the rat v-SNARE splice isoforms VAMP-1a and -1b. Biochem. Cell Biol. 95(4), 500–509 (2017)

    Article  Google Scholar 

  7. Zhao, Y., Holmgren, B.T., Hinas, A.: The conserved SNARE SEC-22 localizes to late endosomes and negatively regulates RNA interference in Caenorhabditis elegans. RNA 23(3), 297–307 (2017)

    Article  Google Scholar 

  8. Jahn, R., Scheller, R.H.: SNAREs-engines for membrane fusion. Nat. Rev. Mol. Cell Biol. 7(9), 631 (2006)

    Article  Google Scholar 

  9. Shukla, A., Bhattacharyya, A., Kuppusamy, L., Srivas, M., Thattai, M.: Discovering vesicle traffic network constraints by model checking. PloS ONE 12(7), e0180692 (2017)

    Article  Google Scholar 

  10. Gupta, A., Shukla, A., Srivas, M., Thattai, M.: SMT solving for vesicle traffic systems in cells. In: SASB (2017)

    Google Scholar 

  11. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24

    Chapter  Google Scholar 

  12. Qbflib.org: QDIMACS Standard Version 1.1 (2018)

    Google Scholar 

  13. Lonsing, F., Biere, A.: DepQBF: a dependency-aware QBF solver. J. Satisf. Boolean Model. Comput. 7, 71–76 (2010)

    Google Scholar 

  14. Burri, L., Lithgow, T.: A complete set of snares in yeast. Traffic 5(1), 45–52 (2004)

    Article  Google Scholar 

  15. Solar-Lezama, A.: The sketching approach to program synthesis. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 4–13. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10672-9_3

    Chapter  Google Scholar 

  16. Alur, R., et al.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, 20–23 October 2013, pp. 1–8 (2013)

    Google Scholar 

  17. Gulwani, S.: Automating string processing in spreadsheets using input-output examples. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26–28 January 2011, pp. 317–330. ACM (2011)

    Google Scholar 

  18. de Moura, L., Bjørner, N.: Efficient E-matching for SMT solvers. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 183–198. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73595-3_13

    Chapter  Google Scholar 

  19. Shavit, Y.: Automated synthesis and analysis of switching gene regulatory networks. Biosystems 146, 26–34 (2016)

    Article  Google Scholar 

  20. Fisher, J., Köksal, A.S., Piterman, N., Woodhouse, S.: Synthesising executable gene regulatory networks from single-cell gene expression data. In: Kroening, D., Păsăreanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 544–560. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21690-4_38

    Chapter  Google Scholar 

  21. Cardelli, L., et al.: Syntax-guided optimal synthesis for chemical reaction networks. In: Majumdar, R., Kunčak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 375–395. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63390-9_20

    Chapter  Google Scholar 

  22. Wickner, W., Schekman, R.: Membrane fusion. Nat. Struct. Mol. Biol. 15(n7), 658 (2008)

    Article  Google Scholar 

  23. Rothman, J.E.: The machinery and principles of vesicle transport in the cell. Nat. Med. 8(10), 1059–1063 (2002)

    Article  Google Scholar 

  24. Van Den Bogaart, G., Holt, M.G., Bunt, G., Riedel, D., Wouters, F.S., Jahn, R.: One snare complex is sufficient for membrane fusion. N. Struct. Mol. Biol. 17(3), 358 (2010)

    Article  Google Scholar 

  25. Hong, W.: Snares and traffic. Biochimica et Biophysica Acta (BBA)-Mol. Cell Res. 1744(2), 120–144 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Ashutosh Gupta , Somya Mani or Ankit Shukla .

Editor information

Editors and Affiliations

Appendices

Appendix

A Discussion on the Choice of VTS Model

The molecules transported by the VTS are themselves its regulators. The molecules in a compartment/vesicle may be active or inactive. The molecules that are responsible for vesicle fusion are called SNARE proteins [8, 22]. Active SNAREs present on vesicles (v-SNAREs) bind with their cognate active SNAREs on the target compartment (t-SNAREs) to enable vesicle fusion. A cell contains multiple kinds of v- and t-SNAREs. Only specific pairs of v and t SNAREs can bind to each other and participate in fusion. Fusion compatible v- and t- SNAREs are determined by biological experiments. Different vesicle-compartment fusions in the cell are brought about by different v- and t-SNARE pairs. A molecule that participates in a given fusion reaction must not interfere with fusion at different compartments or vesicles. Therefore, SNAREs must be kept in an inactive form in appropriate compartments/vesicles. The activity of molecules is regulated by the other molecules, i.e., the presence and absence of the other molecules in a compartment or vesicle may make the molecule active or inactive. We call this regulation as activity functions. In the VTS model, we assume that the system is in steady state and the concentrations of the molecules in the compartments do not change over time. We define SNARE pairing specificity by a fusion pairing relation containing pairs of SNAREs and molecular regulation by activity Boolean functions. Since the system is in steady state, we expect that any molecule that leaves a compartment must come back via some path on the graph. We call this property of VTS as stability.

Our model is inspired by [9]. On the timescales of minutes, our following assumptions reasonably capture the important aspects of the Rothman-Schekman-Sudhof (RSS) model [23] of vesicle traffic system.

  1. 1.

    A cell is a set of compartments exchanging vesicles.

  2. 2.

    Compartments are neither created nor destroyed.

  3. 3.

    Each compartment is in steady state, gain and loss balance.

  4. 4.

    Molecules are neither created nor destroyed.

  5. 5.

    Molecules move via vesicles of uniform size.

  6. 6.

    Identical vesicles have identical target compartments.

  7. 7.

    Fusion of vesicles to compartments is driven by specific SNARE pairing.

  8. 8.

    The activity of a SNARE can be regulated by other molecules present on the same compartment or vesicle.

  9. 9.

    An active SNARE pair is necessary and sufficient for fusion.

SNARE proteins are the agents of vesicle fusion in eukaryotic cells. When SNAREs on vesicles (v-SNAREs) encounter their cognate SNAREs on target compartments (t-SNAREs), they form SNARE complexes [8], and a single SNARE complex releases enough energy to enable membrane fusion [24]. SNAREs are identified by the presence of a conserved 60–70 stretch of amino acids called the SNARE motif. Based on amino acid sequence, SNARE motifs fall into 4 classes: Qa, Qb, Qc, and R [8]. Across all intracellular vesicle fusion reactions, the associated SNARE complexes contain one of each of the four kinds of SNARE motifs; the v-SNARE contributes a single SNARE motif, usually it is an R-SNARE (although, exceptions are known: Sec22b and Ykt6 are both R-SNAREs which form parts of t-SNAREs [25]) and the rest of the three SNARE motifs are contributed by the t-SNARE. In the cell, different vesicle fusion reactions are associated with distinct v- and t-SNARE pairs.

The paper [9] consider three Q SNARES as a single molecule, we have extended this model by considering each complex molecule as distinct. In contrast to the [9], we allow Q and R-SNARE type distribution across the whole system to be uneven. In our model fusion is driven by an active combination of three Q SNARE and one R SNARE molecule. We have relaxed the pairing matrix constraint to comply with this fact. For biological efficiency and optimality reasons, we do not allow self-edges to be present in the VTS.

Fig. 1.
figure 1

A found-in-nature VTS. Nodes and edges are labelled with sets of molecules. \(\hat{}\) indicates that the molecule is active.

B The Natural VTSs

Here we will present the two VTS collected from the literature.

1.1 B.1 Mammalian VTS

The Fig. 1 represent mammalian SNARE map created by studying the wide array of literature. To construct the map, we have assumed that vesicles only contain a single active v-SNARE, and we have attributed t-SNAREs and inactive v-SNAREs that travel between compartments to one of the known vesicles that go between the same source and target compartments. In order to identify the active SNARE complex involved in any particular vesicle fusion, we used two criteria. The SNARE complex is formed in vivo. In most papers, this is determined by immunoprecipitation of the SNARE complex from the relevant cell fraction. Blocking SNARE complex formation (for example, using antibodies against these SNAREs, or using cytosolic forms of these SNAREs) blocks the specific transport step. Note that these vesicles have been collected from multiple cell types, and any given cell type is likely to contain only a subset of the vesicles in the map.

In this figure, the rectangles represent compartments, the identities of compartments are written within ER = endoplasmic reticulum, ERGIC = ER-Golgi intermediate compartment, RE = recycling endosome, EE = early endosome, LE=late endosome, LYS = lysosome, PM = plasma membrane. The arrows represent vesicle edges.

Fig. 2.
figure 2

Yeast VTS

Fig. 3.
figure 3

Run-times for synthesis queries. #C stands for minimum changes in the synthesized VTS in comparison with the given partial VTS. Time is reported in seconds. (a) The solver used is DepQBF (b) The solver used is Z3. The sub-mammal is a subgraph of the complete mammal-graph. In the Add/Delete parts column, ‘+’n sign is used to show the addition of n number of the molecules, similarly ‘-’n is used to show the removal of n number of molecules. In the table, N is node labels, AN is active node molecules, E is edges, PE is molecule presence on the edge and AE is active molecules on the edge. The [kC] stands for k graph connectedness which is part of only DepQBF experiments.

1.2 B.2 Yeast VTS

In Fig. 2, we present the yeast VTS. We have borrowed the VTS from [14]. It has been adapted from the paper by separating the v and the t SNAREs. It is clear that it is an incomplete description of the VTS. For example, the inactive molecules were not reported in the reference. We are currently searching for more literature that can help us complete all known information about the VTS.

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gupta, A., Mani, S., Shukla, A. (2018). Synthesis for Vesicle Traffic Systems. In: Češka, M., Šafránek, D. (eds) Computational Methods in Systems Biology. CMSB 2018. Lecture Notes in Computer Science(), vol 11095. Springer, Cham. https://doi.org/10.1007/978-3-319-99429-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99429-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99428-4

  • Online ISBN: 978-3-319-99429-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics