[{"page":"479 - 491","date_created":"2018-12-11T11:48:28Z","date_published":"2015-01-01T00:00:00Z","volume":9135,"doi":"10.1007/978-3-662-47666-6_38","publication_status":"published","year":"2015","language":[{"iso":"eng"}],"day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1502.05745","open_access":"1"}],"oa":1,"publisher":"Springer","intvolume":" 9135","month":"01","abstract":[{"text":"Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computational constructions. Yet, the fastest currently known population protocol for electing a leader only has linear convergence time, and it has recently been shown that no population protocol using a constant number of states per node may overcome this linear bound. In this paper, we give the first population protocol for leader election with polylogarithmic convergence time, using polylogarithmic memory states per node. The protocol structure is quite simple: each node has an associated value, and is either a leader (still in contention) or a minion (following some leader). A leader keeps incrementing its value and “defeats” other leaders in one-to-one interactions, and will drop from contention and become a minion if it meets a leader with higher value. Importantly, a leader also drops out if it meets a minion with higher absolute value. While these rules are quite simple, the proof that this algorithm achieves polylogarithmic convergence time is non-trivial. In particular, the argument combines careful use of concentration inequalities with anti-concentration bounds, showing that the leaders’ values become spread apart as the execution progresses, which in turn implies that straggling leaders get quickly eliminated. We complement our analysis with empirical results, showing that our protocol converges extremely fast, even for large network sizes.","lang":"eng"}],"acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”","oa_version":"Preprint","external_id":{"arxiv":["1502.05745"]},"publist_id":"6877","author":[{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"}],"title":"Polylogarithmic-time leader election in population protocols","date_updated":"2023-02-23T13:18:11Z","citation":{"ama":"Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38","apa":"Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38","ieee":"D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.","short":"D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.","mla":"Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.","ista":"Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in population protocols. ICALP: International Colloquium on Automota, Languages and Programming vol. 9135, 479–491.","chicago":"Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"type":"conference","status":"public","_id":"780"},{"page":"47 - 56","volume":"2015-July","doi":"10.1145/2767386.2767429","date_published":"2015-07-21T00:00:00Z","date_created":"2018-12-11T11:48:28Z","publication_status":"published","year":"2015","day":"21","language":[{"iso":"eng"}],"publisher":"ACM","month":"07","abstract":[{"text":"Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority. Despite considerable research effort, known protocols for this problem are either exact but slow (taking linear parallel time to converge), or fast but approximate (with non-zero probability of error). In this paper, we show that this trade-off between preciasion and speed is not inherent. We present a new protocol called Average and Conquer (AVC) that solves majority ex-actly in expected parallel convergence time O(log n/(sε) + log n log s), where n is the number of nodes, εn is the initial node advantage of the majority state, and s = Ω(log n log log n) is the number of states the protocol employs. This shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = Ω(1/ε + lognlog1/ε). On the negative side, we establish a lower bound of Ω(1/ε) on the expected paraallel convergence time for the case of four memory states per node, and a lower bound of Ω(logn) parallel time for protocols using any number of memory states per node.per node, and a lower bound of (log n) parallel time for protocols using any number of memory states per node.","lang":"eng"}],"oa_version":"None","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"first_name":"Milan","full_name":"Vojnović, Milan","last_name":"Vojnović"}],"publist_id":"6873","article_processing_charge":"No","title":"Fast and exact majority in population protocols","date_updated":"2023-02-23T13:18:35Z","citation":{"chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.","ista":"Alistarh D-A, Gelashvili R, Vojnović M. 2015. Fast and exact majority in population protocols. PODC: Principles of Distributed Computing vol. 2015–July, 47–56.","mla":"Alistarh, Dan-Adrian, et al. Fast and Exact Majority in Population Protocols. Vol. 2015–July, ACM, 2015, pp. 47–56, doi:10.1145/2767386.2767429.","ieee":"D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.","short":"D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56.","ama":"Alistarh D-A, Gelashvili R, Vojnović M. Fast and exact majority in population protocols. In: Vol 2015-July. ACM; 2015:47-56. doi:10.1145/2767386.2767429","apa":"Alistarh, D.-A., Gelashvili, R., & Vojnović, M. (2015). Fast and exact majority in population protocols (Vol. 2015–July, pp. 47–56). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767429"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"name":"PODC: Principles of Distributed Computing"},"status":"public","_id":"781"},{"page":"251 - 260","date_published":"2015-07-21T00:00:00Z","volume":"2015-July","doi":"10.1145/2767386.2767430","date_created":"2018-12-11T11:48:28Z","publication_status":"published","year":"2015","day":"21","language":[{"iso":"eng"}],"publisher":"ACM","month":"07","abstract":[{"text":"In this work, we consider the following random process, mo- Tivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of n threads, according to a distribution p = (p1; p2; : : : ; pn), where thread i is scheduled with probability pi. When some thread first reaches a set threshold of executed steps, it registers a win, completing its current operation, and resets its step count to 1. At the same time, threads whose step count was close to the threshold also get reset because of the win, but to 0 steps, being penalized for almost winning. We are interested in two questions: how often does some thread complete an operation (system latency), and how often does a specific thread complete an operation (individual latency)? We provide asymptotically tight bounds for the system and individual latency of this general concurrency pattern, for arbitrary scheduling distributions p. Surprisingly, a sim- ple characterization exists: in expectation, the system will complete a new operation every Θ(1/p 2) steps, while thread i will complete a new operation every Θ(1/2=p i ) steps. The proof is interesting in its own right, as it requires a careful analysis of how the higher norms of the vector p inuence the thread step counts and latencies in this random process. Our result offers a simple connection between the scheduling distribution and the average performance of concurrent algorithms, which has several applications.","lang":"eng"}],"oa_version":"None","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"first_name":"Milan","full_name":"Vojnović, Milan","last_name":"Vojnović"}],"publist_id":"6874","article_processing_charge":"No","title":"Lock-Free algorithms under stochastic schedulers","citation":{"ista":"Alistarh D-A, Sauerwald T, Vojnović M. 2015. Lock-Free algorithms under stochastic schedulers. PODC: Principles of Distributed Computing vol. 2015–July, 251–260.","chicago":"Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.","short":"D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 251–260.","ieee":"D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.","apa":"Alistarh, D.-A., Sauerwald, T., & Vojnović, M. (2015). Lock-Free algorithms under stochastic schedulers (Vol. 2015–July, pp. 251–260). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767430","ama":"Alistarh D-A, Sauerwald T, Vojnović M. Lock-Free algorithms under stochastic schedulers. In: Vol 2015-July. ACM; 2015:251-260. doi:10.1145/2767386.2767430","mla":"Alistarh, Dan-Adrian, et al. Lock-Free Algorithms under Stochastic Schedulers. Vol. 2015–July, ACM, 2015, pp. 251–60, doi:10.1145/2767386.2767430."},"date_updated":"2023-02-23T13:18:50Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"name":"PODC: Principles of Distributed Computing"},"status":"public","_id":"782"},{"citation":{"ista":"Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.","ieee":"D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.","apa":"Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420","ama":"Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420","mla":"Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420."},"date_updated":"2023-02-23T13:18:55Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6875","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"}],"article_processing_charge":"No","title":"How to elect a leader faster than a tournament","_id":"783","type":"conference","conference":{"name":"PODC: Principles of Distributed Computing"},"status":"public","year":"2015","publication_status":"published","day":"21","language":[{"iso":"eng"}],"page":"365 - 374","date_published":"2015-07-21T00:00:00Z","doi":"10.1145/2767386.2767420","volume":"2015-July","date_created":"2018-12-11T11:48:28Z","abstract":[{"lang":"eng","text":"The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity."}],"oa_version":"None","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement during this work, and the anonymous reviewers for their very useful suggestions.","publisher":"ACM","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.1001"}],"month":"07"},{"oa_version":"None","abstract":[{"text":"We demonstrate an optical switch design that can scale up to a thousand ports with high per-port bandwidth (25 Gbps+) and low switching latency (40 ns). Our design uses a broadcast and select architecture, based on a passive star coupler and fast tunable transceivers. In addition we employ time division multiplexing to achieve very low switching latency. Our demo shows the feasibility of the switch data plane using a small testbed, comprising two transmitters and a receiver, connected through a star coupler.","lang":"eng"}],"month":"01","publisher":"ACM","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2015","publication_identifier":{"isbn":["978-1-4503-3542-3"]},"date_created":"2018-12-11T11:48:29Z","doi":"10.1145/2785956.2790035","date_published":"2015-01-01T00:00:00Z","page":"367 - 368","_id":"784","status":"public","conference":{"name":"SIGCOMM: Special Interest Group on Data Communication","start_date":"2015-08-17","location":"London, United Kindgdom","end_date":"2015-08-21"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-02-23T13:18:57Z","citation":{"ista":"Alistarh D-A, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen B. 2015. A high-radix, low-latency optical switch for data centers. SIGCOMM: Special Interest Group on Data Communication, 367–368.","chicago":"Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.","apa":"Alistarh, D.-A., Ballani, H., Costa, P., Funnell, A., Benjamin, J., Watts, P., & Thomsen, B. (2015). A high-radix, low-latency optical switch for data centers (pp. 367–368). Presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom: ACM. https://doi.org/10.1145/2785956.2790035","ama":"Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035","ieee":"D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.","short":"D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368.","mla":"Alistarh, Dan-Adrian, et al. A High-Radix, Low-Latency Optical Switch for Data Centers. ACM, 2015, pp. 367–68, doi:10.1145/2785956.2790035."},"title":"A high-radix, low-latency optical switch for data centers","author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hitesh","last_name":"Ballani","full_name":"Ballani, Hitesh"},{"last_name":"Costa","full_name":"Costa, Paolo","first_name":"Paolo"},{"full_name":"Funnell, Adam","last_name":"Funnell","first_name":"Adam"},{"first_name":"Joshua","last_name":"Benjamin","full_name":"Benjamin, Joshua"},{"full_name":"Watts, Philip","last_name":"Watts","first_name":"Philip"},{"full_name":"Thomsen, Benn","last_name":"Thomsen","first_name":"Benn"}],"publist_id":"6872"},{"abstract":[{"lang":"eng","text":"Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis."}],"pmid":1,"oa_version":"None","quality_controlled":"1","scopus_import":1,"publisher":"Oxford University Press","month":"12","intvolume":" 25","publication_status":"published","year":"2015","day":"01","publication":"Glycobiology","language":[{"iso":"eng"}],"page":"1423 - 1430","issue":"12","doi":"10.1093/glycob/cwv059","date_published":"2015-12-01T00:00:00Z","volume":25,"date_created":"2018-12-11T11:48:35Z","_id":"802","type":"journal_article","status":"public","citation":{"ista":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 25(12), 1423–1430.","chicago":"Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","ieee":"J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier, “Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology, vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.","apa":"Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., & Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059","ama":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430. doi:10.1093/glycob/cwv059","mla":"Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30, doi:10.1093/glycob/cwv059."},"date_updated":"2021-01-12T08:16:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jakob","last_name":"Engel","full_name":"Engel, Jakob"},{"id":"309D50DA-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp S","last_name":"Schmalhorst","orcid":"0000-0002-5795-0133","full_name":"Schmalhorst, Philipp S"},{"last_name":"Kruger","full_name":"Kruger, Anke","first_name":"Anke"},{"first_name":"Christina","full_name":"Muller, Christina","last_name":"Muller"},{"full_name":"Buettner, Falk","last_name":"Buettner","first_name":"Falk"},{"full_name":"Routier, Françoise","last_name":"Routier","first_name":"Françoise"}],"publist_id":"6851","external_id":{"pmid":["26306635"]},"department":[{"_id":"CaHe"}],"title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis"},{"month":"09","intvolume":" 89","quality_controlled":"1","publisher":"ASM","pmid":1,"oa_version":"None","abstract":[{"text":"The polyprotein Gag is the primary structural component of retroviruses. Gag consists of independently folded domains connected by flexible linkers. Interactions between the conserved capsid (CA) domains of Gag mediate formation of hexameric protein lattices that drive assembly of immature virus particles. Proteolytic cleavage of Gag by the viral protease (PR) is required for maturation of retroviruses from an immature form into an infectious form. Within the assembled Gag lattices of HIV-1 and Mason- Pfizer monkey virus (M-PMV), the C-terminal domain of CA adopts similar quaternary arrangements, while the N-terminal domain of CA is packed in very different manners. Here, we have used cryo-electron tomography and subtomogram averaging to study in vitro-assembled, immature virus-like Rous sarcoma virus (RSV) Gag particles and have determined the structure of CA and the surrounding regions to a resolution of ~8 Å. We found that the C-terminal domain of RSV CA is arranged similarly to HIV-1 and M-PMV, whereas the N-terminal domain of CA adopts a novel arrangement in which the upstream p10 domain folds back into the CA lattice. In this position the cleavage site between CA and p10 appears to be inaccessible to PR. Below CA, an extended density is consistent with the presence of a six-helix bundle formed by the spacer-peptide region. We have also assessed the affect of lattice assembly on proteolytic processing by exogenous PR. The cleavage between p10 and CA is indeed inhibited in the assembled lattice, a finding consistent with structural regulation of proteolytic maturation.\r\n","lang":"eng"}],"issue":"20","date_published":"2015-09-22T00:00:00Z","volume":89,"doi":"10.1128/JVI.01502-15","date_created":"2018-12-11T11:48:39Z","page":"10294 - 10302","day":"22","publication":"Journal of Virology","language":[{"iso":"eng"}],"year":"2015","publication_status":"published","status":"public","type":"journal_article","_id":"815","title":"The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly","publist_id":"6837","author":[{"first_name":"Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","full_name":"Schur, Florian","orcid":"0000-0003-4790-8078"},{"last_name":"Dick","full_name":"Dick, Robert","first_name":"Robert"},{"full_name":"Hagen, Wim","last_name":"Hagen","first_name":"Wim"},{"full_name":"Vogt, Volker","last_name":"Vogt","first_name":"Volker"},{"first_name":"John","last_name":"Briggs","full_name":"Briggs, John"}],"external_id":{"pmid":["26223638"]},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. 2015. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 89(20), 10294–10302.","chicago":"Schur, Florian KM, Robert Dick, Wim Hagen, Volker Vogt, and John Briggs. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology. ASM, 2015. https://doi.org/10.1128/JVI.01502-15.","ama":"Schur FK, Dick R, Hagen W, Vogt V, Briggs J. The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. 2015;89(20):10294-10302. doi:10.1128/JVI.01502-15","apa":"Schur, F. K., Dick, R., Hagen, W., Vogt, V., & Briggs, J. (2015). The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly. Journal of Virology. ASM. https://doi.org/10.1128/JVI.01502-15","ieee":"F. K. Schur, R. Dick, W. Hagen, V. Vogt, and J. Briggs, “The structure of immature virus like Rous sarcoma virus gag particles reveals a structural role for the p10 domain in assembly,” Journal of Virology, vol. 89, no. 20. ASM, pp. 10294–10302, 2015.","short":"F.K. Schur, R. Dick, W. Hagen, V. Vogt, J. Briggs, Journal of Virology 89 (2015) 10294–10302.","mla":"Schur, Florian KM, et al. “The Structure of Immature Virus like Rous Sarcoma Virus Gag Particles Reveals a Structural Role for the P10 Domain in Assembly.” Journal of Virology, vol. 89, no. 20, ASM, 2015, pp. 10294–302, doi:10.1128/JVI.01502-15."},"date_updated":"2021-01-12T08:17:09Z"},{"_id":"814","type":"journal_article","status":"public","citation":{"mla":"Schur, Florian KM, et al. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature, vol. 517, no. 7535, Nature Publishing Group, 2015, pp. 505–08, doi:10.1038/nature13838.","ama":"Schur FK, Hagen W, Rumlová M, et al. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 2015;517(7535):505-508. doi:10.1038/nature13838","apa":"Schur, F. K., Hagen, W., Rumlová, M., Ruml, T., Müller, B., Kraüsslich, H., & Briggs, J. (2015). Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. Nature Publishing Group. https://doi.org/10.1038/nature13838","ieee":"F. K. Schur et al., “Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution,” Nature, vol. 517, no. 7535. Nature Publishing Group, pp. 505–508, 2015.","short":"F.K. Schur, W. Hagen, M. Rumlová, T. Ruml, B. Müller, H. Kraüsslich, J. Briggs, Nature 517 (2015) 505–508.","chicago":"Schur, Florian KM, Wim Hagen, Michaela Rumlová, Tomáš Ruml, B Müller, Hans Kraüsslich, and John Briggs. “Structure of the Immature HIV-1 Capsid in Intact Virus Particles at 8.8 Å Resolution.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature13838.","ista":"Schur FK, Hagen W, Rumlová M, Ruml T, Müller B, Kraüsslich H, Briggs J. 2015. Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution. Nature. 517(7535), 505–508."},"date_updated":"2021-01-12T08:17:08Z","extern":1,"publist_id":"6836","author":[{"first_name":"Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","full_name":"Florian Schur","last_name":"Schur"},{"first_name":"Wim","last_name":"Hagen","full_name":"Hagen, Wim J"},{"first_name":"Michaela","last_name":"Rumlová","full_name":"Rumlová, Michaela"},{"last_name":"Ruml","full_name":"Ruml, Tomáš","first_name":"Tomáš"},{"full_name":"Müller B","last_name":"Müller","first_name":"B"},{"first_name":"Hans","full_name":"Kraüsslich, Hans Georg","last_name":"Kraüsslich"},{"first_name":"John","last_name":"Briggs","full_name":"Briggs, John A"}],"title":"Structure of the immature HIV-1 capsid in intact virus particles at 8.8 Å resolution","abstract":[{"lang":"eng","text":"Human immunodeficiency virus type 1 (HIV-1) assembly proceeds in two stages. First, the 55 kilodalton viral Gag polyprotein assembles into a hexameric protein lattice at the plasma membrane of the infected cell, inducing budding and release of an immature particle. Second, Gag is cleaved by the viral protease, leading to internal rearrangement of the virus into the mature, infectious form. Immature and mature HIV-1 particles are heterogeneous in size and morphology, preventing high-resolution analysis of their protein arrangement in situ by conventional structural biology methods. Here we apply cryo-electron tomography and sub-tomogram averaging methods to resolve the structure of the capsid lattice within intact immature HIV-1 particles at subnanometre resolution, allowing unambiguous positioning of all α-helices. The resulting model reveals tertiary and quaternary structural interactions that mediate HIV-1 assembly. Strikingly, these interactions differ from those predicted by the current model based on in vitro-assembled arrays of Gag-derived proteins from Mason-Pfizer monkey virus. To validate this difference, we solve the structure of the capsid lattice within intact immature Mason-Pfizer monkey virus particles. Comparison with the immature HIV-1 structure reveals that retroviral capsid proteins, while having conserved tertiary structures, adopt different quaternary arrangements during virus assembly. The approach demonstrated here should be applicable to determine structures of other proteins at subnanometre resolution within heterogeneous environments."}],"acknowledgement":"This study was supported by Deutsche Forschungsgemeinschaft grants BR 3635/2-1 to J.A.G.B., KR 906/7-1 to H.-G.K. and by Grant Agency of the Czech Republic 14-15326S to M.R. The Briggs laboratory acknowledges financial support from the European Molecular Biology Laboratory and from the Chica und Heinz Schaller Stiftung. We thank B. Glass, M. Anders and S. Mattei for preparation of samples, and R. Hadravova, K. H. Bui, F. Thommen, M. Schorb, S. Dodonova, S. Glatt, P. Ulbrich and T. Bharat for technical support and/or discussion. This study was technically supported by the European Molecular Biology Laboratory IT services unit.","publisher":"Nature Publishing Group","quality_controlled":0,"month":"01","intvolume":" 517","publication_status":"published","year":"2015","day":"22","publication":"Nature","page":"505 - 508","date_published":"2015-01-22T00:00:00Z","volume":517,"doi":"10.1038/nature13838","issue":"7535","date_created":"2018-12-11T11:48:39Z"},{"_id":"8242","article_number":"AB101","article_type":"original","type":"journal_article","status":"public","date_updated":"2021-01-12T08:17:42Z","citation":{"mla":"Einhorn, Lukas, et al. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology, vol. 135, no. 2, AB101, Elsevier, 2015, doi:10.1016/j.jaci.2014.12.1263.","short":"L. Einhorn, J. Singer, M. Muhr, A. Schoos, K. Oida, J. Singer, L. Panakova, K. Manzano-Szalai, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 135 (2015).","ieee":"L. Einhorn et al., “Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients,” Journal of Allergy and Clinical Immunology, vol. 135, no. 2. Elsevier, 2015.","apa":"Einhorn, L., Singer, J., Muhr, M., Schoos, A., Oida, K., Singer, J., … Jensen-Jarolim, E. (2015). Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2014.12.1263","ama":"Einhorn L, Singer J, Muhr M, et al. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 2015;135(2). doi:10.1016/j.jaci.2014.12.1263","chicago":"Einhorn, Lukas, Judit Singer, Martina Muhr, Alexandra Schoos, Kumiko Oida, Josef Singer, Lucia Panakova, Krisztina Manzano-Szalai, and Erika Jensen-Jarolim. “Generation of Recombinant FcεRIα of Dog, Cat and Horse for Component-Resolved Allergy Diagnosis in Veterinary Patients.” Journal of Allergy and Clinical Immunology. Elsevier, 2015. https://doi.org/10.1016/j.jaci.2014.12.1263.","ista":"Einhorn L, Singer J, Muhr M, Schoos A, Oida K, Singer J, Panakova L, Manzano-Szalai K, Jensen-Jarolim E. 2015. Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients. Journal of Allergy and Clinical Immunology. 135(2), AB101."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"first_name":"Lukas","full_name":"Einhorn, Lukas","last_name":"Einhorn"},{"last_name":"Fazekas","full_name":"Fazekas, Judit","orcid":"0000-0002-8777-3502","first_name":"Judit","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martina","last_name":"Muhr","full_name":"Muhr, Martina"},{"full_name":"Schoos, Alexandra","last_name":"Schoos","first_name":"Alexandra"},{"first_name":"Kumiko","last_name":"Oida","full_name":"Oida, Kumiko"},{"last_name":"Singer","full_name":"Singer, Josef","first_name":"Josef"},{"first_name":"Lucia","full_name":"Panakova, Lucia","last_name":"Panakova"},{"last_name":"Manzano-Szalai","full_name":"Manzano-Szalai, Krisztina","first_name":"Krisztina"},{"first_name":"Erika","full_name":"Jensen-Jarolim, Erika","last_name":"Jensen-Jarolim"}],"title":"Generation of recombinant FcεRIα of dog, cat and horse for component-resolved allergy diagnosis in veterinary patients","oa_version":"None","quality_controlled":"1","publisher":"Elsevier","intvolume":" 135","month":"02","year":"2015","publication_status":"published","publication_identifier":{"issn":["0091-6749"]},"publication":"Journal of Allergy and Clinical Immunology","language":[{"iso":"eng"}],"day":"01","date_created":"2020-08-10T11:54:09Z","volume":135,"issue":"2","doi":"10.1016/j.jaci.2014.12.1263","date_published":"2015-02-01T00:00:00Z"},{"intvolume":" 5","month":"04","publisher":"Bio-protocol LLC","quality_controlled":0,"acknowledgement":"European Research Council with a Starting Independent Research grant: ERC-2007-Stg-207362-HCPO, Czech Science Foundation: GA13-39982S\nWe thank Matyas Fendrych for critical reading and comments. The protocol was developed based on previously published work of De Rybel et al. (2010) and Laskowski et al. (2008). ","abstract":[{"text":"Plants maintain capacity to form new organs such as leaves, flowers, lateral shoots and roots throughout their postembryonic lifetime. Lateral roots (LRs) originate from a few pericycle cells that acquire attributes of founder cells (FCs), undergo series of anticlinal divisions, and give rise to a few short initial cells. After initiation, coordinated cell division and differentiation occur, giving rise to lateral root primordia (LRP). Primordia continue to grow, emerge through the cortex and epidermal layers of the primary root, and finally a new apical meristem is established taking over the responsibility for growth of mature lateral roots [for detailed description of the individual stages of lateral root organogenesis see Malamy and Benfey (1997)]. To examine this highly dynamic developmental process and to investigate a role of various hormonal, genetic and environmental factors in the regulation of lateral root organogenesis, the real time imaging based analyses represent extremely powerful tools (Laskowski et al., 2008; De Smet et al., 2012; Marhavy et al., 2013 and 2014). Herein, we describe a protocol for real time lateral root primordia (LRP) analysis, which enables the monitoring of an onset of the specific gene expression and subcellular protein localization during primordia organogenesis, as well as the evaluation of the impact of genetic and environmental perturbations on LRP organogenesis.","lang":"eng"}],"date_created":"2018-12-11T11:48:44Z","date_published":"2015-04-20T00:00:00Z","issue":"8","volume":5,"doi":"10.21769/BioProtoc.1446","publication":"Bio-protocol","day":"20","publication_status":"published","year":"2015","status":"public","type":"journal_article","_id":"832","title":"Real time analysis of lateral root organogenesis in arabidopsis","publist_id":"6816","author":[{"last_name":"Marhavy","full_name":"Peter Marhavy","orcid":"0000-0001-5227-5741","first_name":"Peter","id":"3F45B078-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8510-9739","full_name":"Eva Benková","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"extern":1,"date_updated":"2021-01-12T08:18:07Z","citation":{"ista":"Marhavý P, Benková E. 2015. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 5(8).","chicago":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol. Bio-protocol LLC, 2015. https://doi.org/10.21769/BioProtoc.1446.","ieee":"P. Marhavý and E. Benková, “Real time analysis of lateral root organogenesis in arabidopsis,” Bio-protocol, vol. 5, no. 8. Bio-protocol LLC, 2015.","short":"P. Marhavý, E. Benková, Bio-Protocol 5 (2015).","apa":"Marhavý, P., & Benková, E. (2015). Real time analysis of lateral root organogenesis in arabidopsis. Bio-Protocol. Bio-protocol LLC. https://doi.org/10.21769/BioProtoc.1446","ama":"Marhavý P, Benková E. Real time analysis of lateral root organogenesis in arabidopsis. Bio-protocol. 2015;5(8). doi:10.21769/BioProtoc.1446","mla":"Marhavý, Peter, and Eva Benková. “Real Time Analysis of Lateral Root Organogenesis in Arabidopsis.” Bio-Protocol, vol. 5, no. 8, Bio-protocol LLC, 2015, doi:10.21769/BioProtoc.1446."}}]