[{"month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.09209"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding ' : G ! M of a graph G into a 2manifold M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to a common node or arc, due to data compression or low resolution. This raises the computational problem of deciding whether a given map ' : G ! M comes from an embedding. A map ' : G ! M is a weak embedding if it can be perturbed into an embedding ψ: G ! M with k' \"k < \" for every " > 0. A polynomial-time algorithm for recognizing weak embeddings was recently found by Fulek and Kyncl [14], which reduces to solving a system of linear equations over Z2. It runs in O(n2!) O(n4:75) time, where 2:373 is the matrix multiplication exponent and n is the number of vertices and edges of G. We improve the running time to O(n log n). Our algorithm is also conceptually simpler than [14]: We perform a sequence of local operations that gradually "untangles" the image '(G) into an embedding (G), or reports that ' is not a weak embedding. It generalizes a recent technique developed for the case that G is a cycle and the embedding is a simple polygon [1], and combines local constraints on the orientation of subgraphs directly, thereby eliminating the need for solving large systems of linear equations.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"6982","relation":"later_version"}]},"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2018-01-10","location":"New Orleans, LA, USA","start_date":"2018-01-07"},"type":"conference","_id":"309","department":[{"_id":"UlWa"}],"date_updated":"2023-09-15T12:19:32Z","oa":1,"publisher":"ACM","quality_controlled":"1","acknowledgement":"∗Research supported in part by the NSF awards CCF-1422311 and CCF-1423615, and the Science Without Borders program. The second author gratefully acknowledges support from Austrian Science Fund (FWF): M2281-N35.","date_created":"2018-12-11T11:45:45Z","doi":"10.1137/1.9781611975031.20","date_published":"2018-01-01T00:00:00Z","page":"274 - 292","day":"01","year":"2018","isi":1,"project":[{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"title":"Recognizing weak embeddings of graphs","article_processing_charge":"No","external_id":{"arxiv":["1709.09209"],"isi":["000483921200021"]},"author":[{"full_name":"Akitaya, Hugo","last_name":"Akitaya","first_name":"Hugo"},{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"},{"last_name":"Tóth","full_name":"Tóth, Csaba","first_name":"Csaba"}],"publist_id":"7556","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms, 274–292.","chicago":"Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs,” 274–92. ACM, 2018. https://doi.org/10.1137/1.9781611975031.20.","ama":"Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM; 2018:274-292. doi:10.1137/1.9781611975031.20","apa":"Akitaya, H., Fulek, R., & Tóth, C. (2018). Recognizing weak embeddings of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA: ACM. https://doi.org/10.1137/1.9781611975031.20","ieee":"H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292.","short":"H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.","mla":"Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018, pp. 274–92, doi:10.1137/1.9781611975031.20."}},{"date_updated":"2023-09-15T12:09:06Z","department":[{"_id":"MiLe"}],"_id":"5794","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00319007"]},"publication_status":"published","issue":"25","volume":121,"ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"We present an approach to interacting quantum many-body systems based on the notion of quantum groups, also known as q-deformed Lie algebras. In particular, we show that, if the symmetry of a free quantum particle corresponds to a Lie group G, in the presence of a many-body environment this particle can be described by a deformed group, Gq. Crucially, the single deformation parameter, q, contains all the information about the many-particle interactions in the system. We exemplify our approach by considering a quantum rotor interacting with a bath of bosons, and demonstrate that extracting the value of q from closed-form solutions in the perturbative regime allows one to predict the behavior of the system for arbitrary values of the impurity-bath coupling strength, in good agreement with nonperturbative calculations. Furthermore, the value of the deformation parameter allows one to predict at which coupling strengths rotor-bath interactions result in a formation of a stable quasiparticle. The approach based on quantum groups does not only allow for a drastic simplification of impurity problems, but also provides valuable insights into hidden symmetries of interacting many-particle systems.","lang":"eng"}],"month":"12","intvolume":" 121","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1809.00222","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Yakaboylu, Enderalp, et al. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters, vol. 121, no. 25, 255302, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.255302.","apa":"Yakaboylu, E., Shkolnikov, M., & Lemeshko, M. (2018). Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.255302","ama":"Yakaboylu E, Shkolnikov M, Lemeshko M. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 2018;121(25). doi:10.1103/PhysRevLett.121.255302","short":"E. Yakaboylu, M. Shkolnikov, M. Lemeshko, Physical Review Letters 121 (2018).","ieee":"E. Yakaboylu, M. Shkolnikov, and M. Lemeshko, “Quantum groups as hidden symmetries of quantum impurities,” Physical Review Letters, vol. 121, no. 25. American Physical Society, 2018.","chicago":"Yakaboylu, Enderalp, Mikhail Shkolnikov, and Mikhail Lemeshko. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.255302.","ista":"Yakaboylu E, Shkolnikov M, Lemeshko M. 2018. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 121(25), 255302."},"title":"Quantum groups as hidden symmetries of quantum impurities","author":[{"orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp"},{"last_name":"Shkolnikov","orcid":"0000-0002-4310-178X","full_name":"Shkolnikov, Mikhail","id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"external_id":{"isi":["000454178600009"],"arxiv":["1809.00222"]},"article_processing_charge":"No","article_number":"255302","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425"}],"day":"17","publication":"Physical Review Letters","isi":1,"year":"2018","doi":"10.1103/PhysRevLett.121.255302","date_published":"2018-12-17T00:00:00Z","date_created":"2019-01-06T22:59:12Z","publisher":"American Physical Society","quality_controlled":"1","oa":1},{"_id":"87","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-09-15T12:10:35Z","department":[{"_id":"HeEd"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics."}],"month":"10","intvolume":" 28","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1705.02870","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"5","related_material":{"record":[{"relation":"dissertation_contains","id":"6287","status":"public"}]},"volume":28,"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability. Institute of Mathematical Statistics, 2018. https://doi.org/10.1214/18-AAP1389.","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:10.1214/18-AAP1389.","short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” Annals of Applied Probability, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018.","apa":"Edelsbrunner, H., & Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/18-AAP1389","ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 2018;28(5):3215-3238. doi:10.1214/18-AAP1389"},"title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics","publist_id":"7967","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201"}],"article_processing_charge":"No","external_id":{"arxiv":["1705.02870"],"isi":["000442893500018"]},"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"day":"01","publication":"Annals of Applied Probability","isi":1,"year":"2018","date_published":"2018-10-01T00:00:00Z","doi":"10.1214/18-AAP1389","date_created":"2018-12-11T11:44:33Z","page":"3215 - 3238"},{"oa":1,"quality_controlled":"1","publisher":"Springer Nature","date_created":"2018-12-11T11:45:07Z","doi":"10.1038/s41477-018-0190-1","date_published":"2018-06-25T00:00:00Z","page":"453 - 459","publication":"Nature Plants","day":"25","year":"2018","isi":1,"title":"Rapid and reversible root growth inhibition by TIR1 auxin signalling","external_id":{"isi":["000443221200017"],"pmid":["29942048"]},"article_processing_charge":"No","author":[{"id":"43905548-F248-11E8-B48F-1D18A9856A87","first_name":"Matyas","orcid":"0000-0002-9767-8699","full_name":"Fendrych, Matyas","last_name":"Fendrych"},{"first_name":"Maria","id":"3425EC26-F248-11E8-B48F-1D18A9856A87","full_name":"Akhmanova, Maria","orcid":"0000-0003-1522-3162","last_name":"Akhmanova"},{"id":"4515C308-F248-11E8-B48F-1D18A9856A87","first_name":"Jack","last_name":"Merrin","full_name":"Merrin, Jack","orcid":"0000-0001-5145-4609"},{"last_name":"Glanc","full_name":"Glanc, Matous","first_name":"Matous"},{"last_name":"Hagihara","full_name":"Hagihara, Shinya","first_name":"Shinya"},{"first_name":"Koji","last_name":"Takahashi","full_name":"Takahashi, Koji"},{"first_name":"Naoyuki","full_name":"Uchida, Naoyuki","last_name":"Uchida"},{"first_name":"Keiko U","last_name":"Torii","full_name":"Torii, Keiko U"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","last_name":"Friml"}],"publist_id":"7728","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"M. Fendrych, M. Akhmanova, J. Merrin, M. Glanc, S. Hagihara, K. Takahashi, N. Uchida, K.U. Torii, J. Friml, Nature Plants 4 (2018) 453–459.","ieee":"M. Fendrych et al., “Rapid and reversible root growth inhibition by TIR1 auxin signalling,” Nature Plants, vol. 4, no. 7. Springer Nature, pp. 453–459, 2018.","ama":"Fendrych M, Akhmanova M, Merrin J, et al. Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. 2018;4(7):453-459. doi:10.1038/s41477-018-0190-1","apa":"Fendrych, M., Akhmanova, M., Merrin, J., Glanc, M., Hagihara, S., Takahashi, K., … Friml, J. (2018). Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. Springer Nature. https://doi.org/10.1038/s41477-018-0190-1","mla":"Fendrych, Matyas, et al. “Rapid and Reversible Root Growth Inhibition by TIR1 Auxin Signalling.” Nature Plants, vol. 4, no. 7, Springer Nature, 2018, pp. 453–59, doi:10.1038/s41477-018-0190-1.","ista":"Fendrych M, Akhmanova M, Merrin J, Glanc M, Hagihara S, Takahashi K, Uchida N, Torii KU, Friml J. 2018. Rapid and reversible root growth inhibition by TIR1 auxin signalling. Nature Plants. 4(7), 453–459.","chicago":"Fendrych, Matyas, Maria Akhmanova, Jack Merrin, Matous Glanc, Shinya Hagihara, Koji Takahashi, Naoyuki Uchida, Keiko U Torii, and Jiří Friml. “Rapid and Reversible Root Growth Inhibition by TIR1 Auxin Signalling.” Nature Plants. Springer Nature, 2018. https://doi.org/10.1038/s41477-018-0190-1."},"intvolume":" 4","month":"06","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/29942048"}],"scopus_import":"1","pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The phytohormone auxin is the information carrier in a plethora of developmental and physiological processes in plants(1). It has been firmly established that canonical, nuclear auxin signalling acts through regulation of gene transcription(2). Here, we combined microfluidics, live imaging, genetic engineering and computational modelling to reanalyse the classical case of root growth inhibition(3) by auxin. We show that Arabidopsis roots react to addition and removal of auxin by extremely rapid adaptation of growth rate. This process requires intracellular auxin perception but not transcriptional reprogramming. The formation of the canonical TIR1/AFB-Aux/IAA co-receptor complex is required for the growth regulation, hinting to a novel, non-transcriptional branch of this signalling pathway. Our results challenge the current understanding of root growth regulation by auxin and suggest another, presumably non-transcriptional, signalling output of the canonical auxin pathway."}],"volume":4,"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/new-mechanism-for-the-plant-hormone-auxin-discovered/","description":"News on IST Homepage"}]},"issue":"7","language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","article_type":"original","_id":"192","department":[{"_id":"JiFr"},{"_id":"DaSi"},{"_id":"NanoFab"}],"date_updated":"2023-09-15T12:11:03Z"},{"department":[{"_id":"DaSi"},{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:44:50Z","date_updated":"2023-09-18T08:09:32Z","ddc":["580"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"14","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"issue":"11","volume":19,"publication_status":"published","publication_identifier":{"eissn":["1422-0067"]},"language":[{"iso":"eng"}],"file":[{"file_size":2200593,"date_updated":"2020-07-14T12:44:50Z","creator":"dernst","file_name":"2018_IJMS_Hille.pdf","date_created":"2018-12-17T16:04:11Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5719","checksum":"e4b59c2599b0ca26ebf5b8434bcde94a"}],"scopus_import":"1","intvolume":" 19","month":"11","abstract":[{"lang":"eng","text":"The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux carriers. PINs are localized at the plasma membrane (PM) and on constitutively recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either by direct translocation across the PM or by pumping auxin into secretory vesicles (SVs), leading to its secretory release upon fusion with the PM. Which of these two mechanisms dominates is a matter of debate. Here, we addressed the issue with a mathematical modeling approach. We demonstrate that the efficiency of secretory transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency and PIN density. 3D structured illumination microscopy (SIM) was used to determine PIN density on the PM. Combining this data with published values of the other parameters, we show that the transport activity of PINs in SVs would have to be at least 1000× greater than on the PM in order to produce a comparable macroscopic auxin transport. If both transport mechanisms operated simultaneously and PINs were equally active on SVs and PM, the contribution of secretion to the total auxin flux would be negligible. In conclusion, while secretory vesicle-mediated transport of auxin is an intriguing and theoretically possible model, it is unlikely to be a major mechanism of auxin transport inplanta."}],"oa_version":"Published Version","article_processing_charge":"No","external_id":{"isi":["000451528500282"]},"author":[{"first_name":"Sander","full_name":"Hille, Sander","last_name":"Hille"},{"first_name":"Maria","id":"3425EC26-F248-11E8-B48F-1D18A9856A87","full_name":"Akhmanova, Maria","orcid":"0000-0003-1522-3162","last_name":"Akhmanova"},{"full_name":"Glanc, Matous","orcid":"0000-0003-0619-7783","last_name":"Glanc","first_name":"Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2"},{"id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander J","last_name":"Johnson","full_name":"Johnson, Alexander J","orcid":"0000-0002-2739-8843"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publist_id":"8042","title":"Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation","citation":{"apa":"Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., & Friml, J. (2018). Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms19113566","ama":"Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. 2018;19(11). doi:10.3390/ijms19113566","short":"S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal of Molecular Sciences 19 (2018).","ieee":"S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation,” International Journal of Molecular Sciences, vol. 19, no. 11. MDPI, 2018.","mla":"Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International Journal of Molecular Sciences, vol. 19, no. 11, MDPI, 2018, doi:10.3390/ijms19113566.","ista":"Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution of PIN-containing secretory vesicles and plasma membrane PINs to the directed auxin transport: Theoretical estimation. International Journal of Molecular Sciences. 19(11).","chicago":"Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International Journal of Molecular Sciences. MDPI, 2018. https://doi.org/10.3390/ijms19113566."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:44:09Z","doi":"10.3390/ijms19113566","date_published":"2018-11-12T00:00:00Z","year":"2018","isi":1,"has_accepted_license":"1","publication":"International Journal of Molecular Sciences","day":"12","oa":1,"publisher":"MDPI","quality_controlled":"1","acknowledgement":"European Research Council (ERC): 742985 to Jiri Friml; M.A. was supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the Austria Science Fund (FWF): I03630 to Jiri Friml."}]