--- _id: '7210' abstract: - lang: eng text: The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization. article_number: '138' article_processing_charge: No article_type: original author: - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2019;2. doi:10.1038/s42003-019-0373-y apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y. ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019. ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138. mla: Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y. short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology 2 (2019). date_created: 2019-12-23T13:36:50Z date_published: 2019-04-23T00:00:00Z date_updated: 2023-09-07T13:19:22Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.1038/s42003-019-0373-y ec_funded: 1 external_id: isi: - '000465425700006' pmid: - '31044163' file: - access_level: open_access checksum: d1a69bfe73767e4246f0a38e4e1554dd content_type: application/pdf creator: dernst date_created: 2019-12-23T13:39:30Z date_updated: 2020-07-14T12:47:53Z file_id: '7211' file_name: 2019_CommBio_Tkadlec.pdf file_size: 1670274 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 2' isi: 1 language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '04' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Communications Biology publication_identifier: issn: - 2399-3642 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7196' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Population structure determines the tradeoff between fixation probability and fixation time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2 year: '2019' ... --- _id: '10190' abstract: - lang: eng text: 'The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.' acknowledgement: "The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n" article_number: '124' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550' apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550' chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550. ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3. ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.' mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550. short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 date_created: 2021-10-27T14:57:06Z date_published: 2019-10-10T00:00:00Z date_updated: 2023-09-07T13:30:27Z day: '10' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3360550 external_id: arxiv: - '1909.00989' file: - access_level: open_access checksum: 2149979c46964c4d117af06ccb6c0834 content_type: application/pdf creator: cchlebak date_created: 2021-11-12T11:41:56Z date_updated: 2021-11-12T11:41:56Z file_id: '10278' file_name: 2019_ACM_Chatterjee.pdf file_size: 570829 relation: main_file success: 1 file_date_updated: 2021-11-12T11:41:56Z has_accepted_license: '1' intvolume: ' 3' keyword: - safety - risk - reliability and quality - software language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/doi/10.1145/3360550 month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public status: public title: Value-centric dynamic partial order reduction tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 3 year: '2019' ... --- _id: '6673' abstract: - lang: eng text: Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to relax this constraint to allow for out-of-order parallel execution. This is the case for parallel implementations of Dijkstra's single-source shortest-paths (SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software frameworks parallelize incremental computation in this way, it is still not well understood whether this relaxed ordering approach can still provide any complexity guarantees. In this paper, we address this problem, and analyze the efficiency guarantees provided by a range of incremental algorithms when parallelized via relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation and sorting by insertion, schedulers with a maximum relaxation factor of k in terms of the maximum priority inversion allowed will introduce a maximum amount of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed. For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax is the maximum distance between two nodes, and wmin is the minimum such distance. In practical settings where n >> k, this suggests that the overheads of relaxation will be outweighed by the improved scalability of the relaxed scheduler. On the negative side, we provide lower bounds showing that certain algorithms will inherently incur a non-trivial amount of wasted work due to scheduler relaxation, even for relatively benign relaxed schedulers. article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Nikita full_name: Koval, Nikita id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87 last_name: Koval citation: ama: 'Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201' apa: 'Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3323165.3323201' chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201. ieee: D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154. ista: 'Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.' mla: Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201. short: D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154. conference: end_date: 2019-06-24 location: Phoenix, AZ, United States name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures' start_date: 2019-06-22 date_created: 2019-07-24T08:59:36Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-09-07T13:31:39Z day: '01' department: - _id: DaAl doi: 10.1145/3323165.3323201 ec_funded: 1 external_id: arxiv: - '2003.09363' isi: - '000507618500018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2003.09363 month: '06' oa: 1 oa_version: Preprint page: 145-154 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 31st ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450361842' publication_status: published publisher: ACM Press quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public scopus_import: '1' status: public title: Efficiency guarantees for parallel incremental algorithms under relaxed schedulers type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2019' ... --- _id: '7398' abstract: - lang: eng text: 'Transporters of the solute carrier 6 (SLC6) family translocate their cognate substrate together with Na+ and Cl−. Detailed kinetic models exist for the transporters of GABA (GAT1/SLC6A1) and the monoamines dopamine (DAT/SLC6A3) and serotonin (SERT/SLC6A4). Here, we posited that the transport cycle of individual SLC6 transporters reflects the physiological requirements they operate under. We tested this hypothesis by analyzing the transport cycle of glycine transporter 1 (GlyT1/SLC6A9) and glycine transporter 2 (GlyT2/SLC6A5). GlyT2 is the only SLC6 family member known to translocate glycine, Na+, and Cl− in a 1:3:1 stoichiometry. We analyzed partial reactions in real time by electrophysiological recordings. Contrary to monoamine transporters, both GlyTs were found to have a high transport capacity driven by rapid return of the empty transporter after release of Cl− on the intracellular side. Rapid cycling of both GlyTs was further supported by highly cooperative binding of cosubstrate ions and substrate such that their forward transport mode was maintained even under conditions of elevated intracellular Na+ or Cl−. The most important differences in the transport cycle of GlyT1 and GlyT2 arose from the kinetics of charge movement and the resulting voltage-dependent rate-limiting reactions: the kinetics of GlyT1 were governed by transition of the substrate-bound transporter from outward- to inward-facing conformations, whereas the kinetics of GlyT2 were governed by Na+ binding (or a related conformational change). Kinetic modeling showed that the kinetics of GlyT1 are ideally suited for supplying the extracellular glycine levels required for NMDA receptor activation.' article_processing_charge: No article_type: original author: - first_name: Fatma Asli full_name: Erdem, Fatma Asli last_name: Erdem - first_name: Marija full_name: Ilic, Marija last_name: Ilic - first_name: Peter full_name: Koppensteiner, Peter id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87 last_name: Koppensteiner orcid: 0000-0002-3509-1948 - first_name: Jakub full_name: Gołacki, Jakub last_name: Gołacki - first_name: Gert full_name: Lubec, Gert last_name: Lubec - first_name: Michael full_name: Freissmuth, Michael last_name: Freissmuth - first_name: Walter full_name: Sandtner, Walter last_name: Sandtner citation: ama: Erdem FA, Ilic M, Koppensteiner P, et al. A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. The Journal of General Physiology. 2019;151(8):1035-1050. doi:10.1085/jgp.201912318 apa: Erdem, F. A., Ilic, M., Koppensteiner, P., Gołacki, J., Lubec, G., Freissmuth, M., & Sandtner, W. (2019). A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. The Journal of General Physiology. Rockefeller University Press. https://doi.org/10.1085/jgp.201912318 chicago: Erdem, Fatma Asli, Marija Ilic, Peter Koppensteiner, Jakub Gołacki, Gert Lubec, Michael Freissmuth, and Walter Sandtner. “A Comparison of the Transport Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” The Journal of General Physiology. Rockefeller University Press, 2019. https://doi.org/10.1085/jgp.201912318. ieee: F. A. Erdem et al., “A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2,” The Journal of General Physiology, vol. 151, no. 8. Rockefeller University Press, pp. 1035–1050, 2019. ista: Erdem FA, Ilic M, Koppensteiner P, Gołacki J, Lubec G, Freissmuth M, Sandtner W. 2019. A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. The Journal of General Physiology. 151(8), 1035–1050. mla: Erdem, Fatma Asli, et al. “A Comparison of the Transport Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” The Journal of General Physiology, vol. 151, no. 8, Rockefeller University Press, 2019, pp. 1035–50, doi:10.1085/jgp.201912318. short: F.A. Erdem, M. Ilic, P. Koppensteiner, J. Gołacki, G. Lubec, M. Freissmuth, W. Sandtner, The Journal of General Physiology 151 (2019) 1035–1050. date_created: 2020-01-29T16:06:29Z date_published: 2019-07-03T00:00:00Z date_updated: 2023-09-07T14:52:23Z day: '03' ddc: - '570' department: - _id: RySh doi: 10.1085/jgp.201912318 external_id: isi: - '000478792500008' pmid: - '31270129' file: - access_level: open_access checksum: 5706b4ccd74ee3e50bf7ecb2a203df71 content_type: application/pdf creator: dernst date_created: 2020-02-05T07:20:32Z date_updated: 2020-07-14T12:47:57Z file_id: '7450' file_name: 2019_JGP_Erdem.pdf file_size: 2641297 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 151' isi: 1 issue: '8' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '07' oa: 1 oa_version: Published Version page: 1035-1050 pmid: 1 publication: The Journal of General Physiology publication_identifier: eissn: - 1540-7748 issn: - 0022-1295 publication_status: published publisher: Rockefeller University Press quality_controlled: '1' scopus_import: '1' status: public title: A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2 tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 151 year: '2019' ... --- _id: '7395' abstract: - lang: eng text: The mitochondrial electron transport chain complexes are organized into supercomplexes (SCs) of defined stoichiometry, which have been proposed to regulate electron flux via substrate channeling. We demonstrate that CoQ trapping in the isolated SC I+III2 limits complex (C)I turnover, arguing against channeling. The SC structure, resolved at up to 3.8 Å in four distinct states, suggests that CoQ oxidation may be rate limiting because of unequal access of CoQ to the active sites of CIII2. CI shows a transition between “closed” and “open” conformations, accompanied by the striking rotation of a key transmembrane helix. Furthermore, the state of CI affects the conformational flexibility within CIII2, demonstrating crosstalk between the enzymes. CoQ was identified at only three of the four binding sites in CIII2, suggesting that interaction with CI disrupts CIII2 symmetry in a functionally relevant manner. Together, these observations indicate a more nuanced functional role for the SCs. article_processing_charge: No article_type: original author: - first_name: James A full_name: Letts, James A id: 322DA418-F248-11E8-B48F-1D18A9856A87 last_name: Letts orcid: 0000-0002-9864-3586 - first_name: Karol full_name: Fiedorczuk, Karol id: 5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0 last_name: Fiedorczuk - first_name: Gianluca full_name: Degliesposti, Gianluca last_name: Degliesposti - first_name: Mark full_name: Skehel, Mark last_name: Skehel - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: ama: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. Structures of respiratory supercomplex I+III2 reveal functional and conformational crosstalk. Molecular Cell. 2019;75(6):1131-1146.e6. doi:10.1016/j.molcel.2019.07.022 apa: Letts, J. A., Fiedorczuk, K., Degliesposti, G., Skehel, M., & Sazanov, L. A. (2019). Structures of respiratory supercomplex I+III2 reveal functional and conformational crosstalk. Molecular Cell. Cell Press. https://doi.org/10.1016/j.molcel.2019.07.022 chicago: Letts, James A, Karol Fiedorczuk, Gianluca Degliesposti, Mark Skehel, and Leonid A Sazanov. “Structures of Respiratory Supercomplex I+III2 Reveal Functional and Conformational Crosstalk.” Molecular Cell. Cell Press, 2019. https://doi.org/10.1016/j.molcel.2019.07.022. ieee: J. A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, and L. A. Sazanov, “Structures of respiratory supercomplex I+III2 reveal functional and conformational crosstalk,” Molecular Cell, vol. 75, no. 6. Cell Press, p. 1131–1146.e6, 2019. ista: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. 2019. Structures of respiratory supercomplex I+III2 reveal functional and conformational crosstalk. Molecular Cell. 75(6), 1131–1146.e6. mla: Letts, James A., et al. “Structures of Respiratory Supercomplex I+III2 Reveal Functional and Conformational Crosstalk.” Molecular Cell, vol. 75, no. 6, Cell Press, 2019, p. 1131–1146.e6, doi:10.1016/j.molcel.2019.07.022. short: J.A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, L.A. Sazanov, Molecular Cell 75 (2019) 1131–1146.e6. date_created: 2020-01-29T16:02:33Z date_published: 2019-09-19T00:00:00Z date_updated: 2023-09-07T14:53:06Z day: '19' ddc: - '570' department: - _id: LeSa doi: 10.1016/j.molcel.2019.07.022 ec_funded: 1 external_id: isi: - '000486614200006' pmid: - '31492636' file: - access_level: open_access checksum: 5202f53a237d6650ece038fbf13bdcea content_type: application/pdf creator: dernst date_created: 2020-02-04T10:37:28Z date_updated: 2020-07-14T12:47:57Z file_id: '7447' file_name: 2019_MolecularCell_Letts.pdf file_size: 9654895 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 75' isi: 1 issue: '6' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 1131-1146.e6 pmid: 1 project: - _id: 2590DB08-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '701309' name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes publication: Molecular Cell publication_identifier: issn: - 1097-2765 publication_status: published publisher: Cell Press quality_controlled: '1' scopus_import: '1' status: public title: Structures of respiratory supercomplex I+III2 reveal functional and conformational crosstalk tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 75 year: '2019' ...