--- _id: '6009' abstract: - lang: eng text: "We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n" article_number: '9' 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: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257 apa: Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257 chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257. ieee: K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018. ista: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9. mla: Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257. short: K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018). date_created: 2019-02-14T14:31:52Z date_published: 2018-08-01T00:00:00Z date_updated: 2024-03-27T23:30:34Z day: '01' department: - _id: KrCh doi: 10.1145/3210257 ec_funded: 1 external_id: arxiv: - '1510.07565' isi: - '000444694800001' intvolume: ' 40' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1510.07565 month: '08' oa: 1 oa_version: Preprint project: - _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 - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: ACM Transactions on Programming Languages and Systems publication_identifier: issn: - 0164-0925 publication_status: published publisher: Association for Computing Machinery (ACM) quality_controlled: '1' related_material: record: - id: '1437' relation: earlier_version status: public - id: '5441' relation: earlier_version status: public - id: '5442' relation: earlier_version status: public - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Algorithms for algebraic path properties in concurrent systems of constant treewidth components type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 40 year: '2018' ... --- _id: '5977' abstract: - lang: eng text: 'We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs. Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature.' 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: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Amir full_name: Goharshady, Amir id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Nastaran full_name: Okati, Nastaran last_name: Okati citation: ama: 'Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653' apa: 'Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653' chicago: Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653. ieee: K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707. ista: 'Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.' mla: Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653. short: K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707. conference: end_date: 2018-07-19 location: Stockholm, Sweden name: 'IJCAI: International Joint Conference on Artificial Intelligence' start_date: 2018-07-13 date_created: 2019-02-13T13:26:27Z date_published: 2018-07-17T00:00:00Z date_updated: 2024-03-27T23:30:34Z day: '17' department: - _id: KrCh doi: 10.24963/ijcai.2018/653 ec_funded: 1 external_id: arxiv: - '1804.08984' isi: - '000764175404118' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.08984 month: '07' oa: 1 oa_version: Preprint page: 4700-4707 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence publication_identifier: isbn: - 978-099924112-7 issn: - '10450823' publication_status: published publisher: IJCAI quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Computational approaches for stochastic shortest path on succinct MDPs type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018 year: '2018' ... --- _id: '422' abstract: - lang: eng text: We show that a rather simple, steady modification of the streamwise velocity profile in a pipe can lead to a complete collapse of turbulence and the flow fully relaminarizes. Two different devices, a stationary obstacle (inset) and a device which injects fluid through an annular gap close to the wall, are used to control the flow. Both devices modify the streamwise velocity profile such that the flow in the center of the pipe is decelerated and the flow in the near wall region is accelerated. We present measurements with stereoscopic particle image velocimetry to investigate and capture the development of the relaminarizing flow downstream these devices and the specific circumstances responsible for relaminarization. We find total relaminarization up to Reynolds numbers of 6000, where the skin friction in the far downstream distance is reduced by a factor of 3.4 due to relaminarization. In a smooth straight pipe the flow remains completely laminar downstream of the control. Furthermore, we show that transient (temporary) relaminarization in a spatially confined region right downstream the devices occurs also at much higher Reynolds numbers, accompanied by a significant local skin friction drag reduction. The underlying physical mechanism of relaminarization is attributed to a weakening of the near-wall turbulence production cycle. article_processing_charge: Yes (via OA deal) author: - first_name: Jakob full_name: Kühnen, Jakob id: 3A47AE32-F248-11E8-B48F-1D18A9856A87 last_name: Kühnen orcid: 0000-0003-4312-0179 - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 - first_name: Markus full_name: Schaner, Markus id: 316CE034-F248-11E8-B48F-1D18A9856A87 last_name: Schaner - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Kühnen J, Scarselli D, Schaner M, Hof B. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 2018;100(4):919-942. doi:10.1007/s10494-018-9896-4 apa: Kühnen, J., Scarselli, D., Schaner, M., & Hof, B. (2018). Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. Springer. https://doi.org/10.1007/s10494-018-9896-4 chicago: Kühnen, Jakob, Davide Scarselli, Markus Schaner, and Björn Hof. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion. Springer, 2018. https://doi.org/10.1007/s10494-018-9896-4. ieee: J. Kühnen, D. Scarselli, M. Schaner, and B. Hof, “Relaminarization by steady modification of the streamwise velocity profile in a pipe,” Flow Turbulence and Combustion, vol. 100, no. 4. Springer, pp. 919–942, 2018. ista: Kühnen J, Scarselli D, Schaner M, Hof B. 2018. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 100(4), 919–942. mla: Kühnen, Jakob, et al. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion, vol. 100, no. 4, Springer, 2018, pp. 919–42, doi:10.1007/s10494-018-9896-4. short: J. Kühnen, D. Scarselli, M. Schaner, B. Hof, Flow Turbulence and Combustion 100 (2018) 919–942. date_created: 2018-12-11T11:46:23Z date_published: 2018-01-01T00:00:00Z date_updated: 2024-03-27T23:30:36Z day: '01' ddc: - '530' department: - _id: BjHo doi: 10.1007/s10494-018-9896-4 ec_funded: 1 external_id: isi: - '000433113900004' file: - access_level: open_access checksum: d7c0bade150faabca150b0a9986e60ca content_type: application/pdf creator: dernst date_created: 2018-12-17T15:52:37Z date_updated: 2020-07-14T12:46:25Z file_id: '5717' file_name: 2018_FlowTurbulenceCombust_Kuehnen.pdf file_size: 2210020 relation: main_file file_date_updated: 2020-07-14T12:46:25Z has_accepted_license: '1' intvolume: ' 100' isi: 1 issue: '4' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '01' oa: 1 oa_version: Published Version page: 919 - 942 project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin publication: Flow Turbulence and Combustion publication_status: published publisher: Springer publist_id: '7401' quality_controlled: '1' related_material: record: - id: '7258' relation: dissertation_contains status: public scopus_import: '1' status: public title: Relaminarization by steady modification of the streamwise velocity profile in a pipe 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: 100 year: '2018' ... --- _id: '461' abstract: - lang: eng text: Turbulence is the major cause of friction losses in transport processes and it is responsible for a drastic drag increase in flows over bounding surfaces. While much effort is invested into developing ways to control and reduce turbulence intensities, so far no methods exist to altogether eliminate turbulence if velocities are sufficiently large. We demonstrate for pipe flow that appropriate distortions to the velocity profile lead to a complete collapse of turbulence and subsequently friction losses are reduced by as much as 90%. Counterintuitively, the return to laminar motion is accomplished by initially increasing turbulence intensities or by transiently amplifying wall shear. Since neither the Reynolds number nor the shear stresses decrease (the latter often increase), these measures are not indicative of turbulence collapse. Instead, an amplification mechanism measuring the interaction between eddies and the mean shear is found to set a threshold below which turbulence is suppressed beyond recovery. acknowledgement: We acknowledge the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589, the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 737549) and the Deutsche Forschungsgemeinschaft (Project No. FOR 1182) for financial support. We thank our technician P. Maier for providing highly valuable ideas and greatly supporting us in all technical aspects. We thank M. Schaner for technical drawings, construction and design. We thank M. Schwegel for a Matlab code to post-process experimental data. article_processing_charge: No author: - first_name: Jakob full_name: Kühnen, Jakob id: 3A47AE32-F248-11E8-B48F-1D18A9856A87 last_name: Kühnen orcid: 0000-0003-4312-0179 - first_name: Baofang full_name: Song, Baofang last_name: Song - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 - first_name: Nazmi B full_name: Budanur, Nazmi B id: 3EA1010E-F248-11E8-B48F-1D18A9856A87 last_name: Budanur orcid: 0000-0003-0423-5010 - first_name: Michael full_name: Riedl, Michael id: 3BE60946-F248-11E8-B48F-1D18A9856A87 last_name: Riedl orcid: 0000-0003-4844-6311 - first_name: Ashley full_name: Willis, Ashley last_name: Willis - first_name: Marc full_name: Avila, Marc last_name: Avila - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Kühnen J, Song B, Scarselli D, et al. Destabilizing turbulence in pipe flow. Nature Physics. 2018;14:386-390. doi:10.1038/s41567-017-0018-3 apa: Kühnen, J., Song, B., Scarselli, D., Budanur, N. B., Riedl, M., Willis, A., … Hof, B. (2018). Destabilizing turbulence in pipe flow. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-017-0018-3 chicago: Kühnen, Jakob, Baofang Song, Davide Scarselli, Nazmi B Budanur, Michael Riedl, Ashley Willis, Marc Avila, and Björn Hof. “Destabilizing Turbulence in Pipe Flow.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-017-0018-3. ieee: J. Kühnen et al., “Destabilizing turbulence in pipe flow,” Nature Physics, vol. 14. Nature Publishing Group, pp. 386–390, 2018. ista: Kühnen J, Song B, Scarselli D, Budanur NB, Riedl M, Willis A, Avila M, Hof B. 2018. Destabilizing turbulence in pipe flow. Nature Physics. 14, 386–390. mla: Kühnen, Jakob, et al. “Destabilizing Turbulence in Pipe Flow.” Nature Physics, vol. 14, Nature Publishing Group, 2018, pp. 386–90, doi:10.1038/s41567-017-0018-3. short: J. Kühnen, B. Song, D. Scarselli, N.B. Budanur, M. Riedl, A. Willis, M. Avila, B. Hof, Nature Physics 14 (2018) 386–390. date_created: 2018-12-11T11:46:36Z date_published: 2018-01-08T00:00:00Z date_updated: 2024-03-27T23:30:36Z day: '08' department: - _id: BjHo doi: 10.1038/s41567-017-0018-3 ec_funded: 1 external_id: isi: - '000429434100020' intvolume: ' 14' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.06543 month: '01' oa: 1 oa_version: Preprint page: 386-390 project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin - _id: 25104D44-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '737549' name: Eliminating turbulence in oil pipelines publication: Nature Physics publication_status: published publisher: Nature Publishing Group publist_id: '7360' quality_controlled: '1' related_material: record: - id: '12726' relation: dissertation_contains status: public - id: '14530' relation: dissertation_contains status: public - id: '7258' relation: dissertation_contains status: public scopus_import: '1' status: public title: Destabilizing turbulence in pipe flow type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 14 year: '2018' ... --- _id: '449' abstract: - lang: eng text: Auxin is unique among plant hormones due to its directional transport that is mediated by the polarly distributed PIN auxin transporters at the plasma membrane. The canalization hypothesis proposes that the auxin feedback on its polar flow is a crucial, plant-specific mechanism mediating multiple self-organizing developmental processes. Here, we used the auxin effect on the PIN polar localization in Arabidopsis thaliana roots as a proxy for the auxin feedback on the PIN polarity during canalization. We performed microarray experiments to find regulators of this process that act downstream of auxin. We identified genes that were transcriptionally regulated by auxin in an AXR3/IAA17- and ARF7/ARF19-dependent manner. Besides the known components of the PIN polarity, such as PID and PIP5K kinases, a number of potential new regulators were detected, among which the WRKY23 transcription factor, which was characterized in more detail. Gain- and loss-of-function mutants confirmed a role for WRKY23 in mediating the auxin effect on the PIN polarity. Accordingly, processes requiring auxin-mediated PIN polarity rearrangements, such as vascular tissue development during leaf venation, showed a higher WRKY23 expression and required the WRKY23 activity. Our results provide initial insights into the auxin transcriptional network acting upstream of PIN polarization and, potentially, canalization-mediated plant development. article_processing_charge: Yes author: - first_name: Tomas full_name: Prat, Tomas id: 3DA3BFEE-F248-11E8-B48F-1D18A9856A87 last_name: Prat - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 - first_name: Wim full_name: Grunewald, Wim last_name: Grunewald - first_name: Mina K full_name: Vasileva, Mina K id: 3407EB18-F248-11E8-B48F-1D18A9856A87 last_name: Vasileva - first_name: Gergely full_name: Molnar, Gergely id: 34F1AF46-F248-11E8-B48F-1D18A9856A87 last_name: Molnar - first_name: Ricardo full_name: Tejos, Ricardo last_name: Tejos - first_name: Markus full_name: Schmid, Markus last_name: Schmid - first_name: Michael full_name: Sauer, Michael last_name: Sauer - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Prat T, Hajny J, Grunewald W, et al. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. 2018;14(1). doi:10.1371/journal.pgen.1007177 apa: Prat, T., Hajny, J., Grunewald, W., Vasileva, M. K., Molnar, G., Tejos, R., … Friml, J. (2018). WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007177 chicago: Prat, Tomas, Jakub Hajny, Wim Grunewald, Mina K Vasileva, Gergely Molnar, Ricardo Tejos, Markus Schmid, Michael Sauer, and Jiří Friml. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” PLoS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007177. ieee: T. Prat et al., “WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity,” PLoS Genetics, vol. 14, no. 1. Public Library of Science, 2018. ista: Prat T, Hajny J, Grunewald W, Vasileva MK, Molnar G, Tejos R, Schmid M, Sauer M, Friml J. 2018. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. 14(1). mla: Prat, Tomas, et al. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” PLoS Genetics, vol. 14, no. 1, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007177. short: T. Prat, J. Hajny, W. Grunewald, M.K. Vasileva, G. Molnar, R. Tejos, M. Schmid, M. Sauer, J. Friml, PLoS Genetics 14 (2018). date_created: 2018-12-11T11:46:32Z date_published: 2018-01-29T00:00:00Z date_updated: 2024-03-27T23:30:37Z day: '29' ddc: - '581' department: - _id: JiFr doi: 10.1371/journal.pgen.1007177 ec_funded: 1 external_id: isi: - '000423718600034' file: - access_level: open_access checksum: 0276d66788ec076f4924164a39e6a712 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:52Z date_updated: 2020-07-14T12:46:30Z file_id: '4843' file_name: IST-2018-967-v1+1_journal.pgen.1007177.pdf file_size: 24709062 relation: main_file file_date_updated: 2020-07-14T12:46:30Z has_accepted_license: '1' intvolume: ' 14' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants publication: PLoS Genetics publication_status: published publisher: Public Library of Science publist_id: '7373' pubrep_id: '967' quality_controlled: '1' related_material: record: - id: '1127' relation: dissertation_contains status: public - id: '7172' relation: dissertation_contains status: public - id: '8822' relation: dissertation_contains status: public scopus_import: '1' status: public title: WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity 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: 14 year: '2018' ...