[{"intvolume":" 9206","month":"07","main_file_link":[{"url":"http://arxiv.org/abs/1504.07384","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m=O(n)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of ϵ in time O(n⋅log(n/ϵ)) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O(n⋅log(|a⋅b|))=O(n⋅log(n⋅W)), when the output is ab, as compared to the previously best known algorithm with running time O(n2⋅log(n⋅W)). Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O(n2⋅m) time and the associated decision problem can be solved in O(n⋅m) time, improving the previous known O(n3⋅m⋅log(n⋅W)) and O(n2⋅m) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O(n⋅logn) time, improving the previous known O(n4⋅log(n⋅W)) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5430"},{"id":"5437","status":"public","relation":"earlier_version"},{"id":"821","status":"public","relation":"dissertation_contains"}]},"volume":9206,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"name":"CAV: Computer Aided Verification","start_date":"2015-07-18","location":"San Francisco, CA, USA","end_date":"2015-07-24"},"type":"conference","_id":"1607","department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T12:01:59Z","oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","date_created":"2018-12-11T11:52:59Z","doi":"10.1007/978-3-319-21690-4_9","date_published":"2015-07-16T00:00:00Z","page":"140 - 157","day":"16","year":"2015","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Faster algorithms for quantitative verification in constant treewidth graphs","publist_id":"5560","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in constant treewidth graphs. In: Vol 9206. Springer; 2015:140-157. doi:10.1007/978-3-319-21690-4_9","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-21690-4_9"}},{"publist_id":"5417","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"first_name":"Alexander","full_name":"Kößler, Alexander","last_name":"Kößler"},{"last_name":"Schmid","full_name":"Schmid, Ulrich","first_name":"Ulrich"}],"article_processing_charge":"No","title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","citation":{"ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015. https://doi.org/10.1109/RTSS.2014.9.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In: Real-Time Systems Symposium. Vol 2015. IEEE; 2015:118-127. doi:10.1109/RTSS.2014.9","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.","mla":"Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” Real-Time Systems Symposium, vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:10.1109/RTSS.2014.9."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","quality_controlled":"1","page":"118 - 127","date_published":"2015-01-15T00:00:00Z","doi":"10.1109/RTSS.2014.9","date_created":"2018-12-11T11:53:37Z","year":"2015","day":"15","publication":"Real-Time Systems Symposium","type":"conference","conference":{"location":"Rome, Italy","end_date":"2014-12-05","start_date":"2014-12-02","name":"RTSS: Real-Time Systems Symposium"},"status":"public","_id":"1714","department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T12:01:59Z","scopus_import":1,"month":"01","intvolume":" 2015","abstract":[{"lang":"eng","text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a task set and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including Dover, that have been proposed in the past, for various task sets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are task sets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application."}],"oa_version":"None","related_material":{"record":[{"relation":"earlier_version","id":"5423","status":"public"},{"relation":"dissertation_contains","id":"821","status":"public"}]},"issue":"January","volume":2015,"publication_status":"published","language":[{"iso":"eng"}]},{"publication_status":"published","file":[{"checksum":"955aee971983f6b6152bcc1c9b4a7c20","file_id":"5131","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:15:13Z","file_name":"IST-2016-609-v1+1_FractureBEM.pdf","date_updated":"2020-07-14T12:45:07Z","file_size":20154270,"creator":"system"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"839","status":"public","relation":"dissertation_contains"}]},"volume":34,"issue":"4","ec_funded":1,"abstract":[{"lang":"eng","text":"We present a method for simulating brittle fracture under the assumptions of quasi-static linear elastic fracture mechanics (LEFM). Using the boundary element method (BEM) and Lagrangian crack-fronts, we produce highly detailed fracture surfaces. The computational cost of the BEM is alleviated by using a low-resolution mesh and interpolating the resulting stress intensity factors when propagating the high-resolution crack-front.\r\n\r\nOur system produces physics-based fracture surfaces with high spatial and temporal resolution, taking spatial variation of material toughness and/or strength into account. It also allows for crack initiation to be handled separately from crack propagation, which is not only more reasonable from a physics perspective, but can also be used to control the simulation.\r\n\r\nSeparating the resolution of the crack-front from the resolution of the computational mesh increases the efficiency and therefore the amount of visual detail on the resulting fracture surfaces. The BEM also allows us to re-use previously computed blocks of the system matrix."}],"oa_version":"Submitted Version","scopus_import":1,"month":"07","intvolume":" 34","date_updated":"2023-09-07T12:02:56Z","ddc":["000"],"department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:45:07Z","_id":"1633","type":"conference","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","end_date":"2015-08-13","start_date":"2015-08-09"},"status":"public","pubrep_id":"609","has_accepted_license":"1","year":"2015","day":"27","doi":"10.1145/2766896","date_published":"2015-07-27T00:00:00Z","date_created":"2018-12-11T11:53:09Z","publisher":"ACM","quality_controlled":"1","oa":1,"citation":{"ista":"Hahn D, Wojtan C. 2015. High-resolution brittle fracture simulation with boundary elements. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 151.","chicago":"Hahn, David, and Chris Wojtan. “High-Resolution Brittle Fracture Simulation with Boundary Elements,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766896.","ama":"Hahn D, Wojtan C. High-resolution brittle fracture simulation with boundary elements. In: Vol 34. ACM; 2015. doi:10.1145/2766896","apa":"Hahn, D., & Wojtan, C. (2015). High-resolution brittle fracture simulation with boundary elements (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766896","short":"D. Hahn, C. Wojtan, in:, ACM, 2015.","ieee":"D. Hahn and C. Wojtan, “High-resolution brittle fracture simulation with boundary elements,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","mla":"Hahn, David, and Chris Wojtan. High-Resolution Brittle Fracture Simulation with Boundary Elements. Vol. 34, no. 4, 151, ACM, 2015, doi:10.1145/2766896."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5522","author":[{"first_name":"David","id":"357A6A66-F248-11E8-B48F-1D18A9856A87","full_name":"Hahn, David","last_name":"Hahn"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"title":"High-resolution brittle fracture simulation with boundary elements","article_number":"151","project":[{"grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"}]},{"department":[{"_id":"CaHe"},{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:45:01Z","date_updated":"2023-09-07T12:05:08Z","ddc":["570"],"type":"journal_article","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)"},"status":"public","pubrep_id":"484","_id":"1537","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"961"}]},"volume":160,"issue":"4","publication_status":"published","file":[{"checksum":"228d3edf40627d897b3875088a0ac51f","file_id":"5003","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:13:21Z","file_name":"IST-2016-484-v1+1_1-s2.0-S0092867415000094-main.pdf","creator":"system","date_updated":"2020-07-14T12:45:01Z","file_size":4362653}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"02","intvolume":" 160","acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"text":"3D amoeboid cell migration is central to many developmental and disease-related processes such as cancer metastasis. Here, we identify a unique prototypic amoeboid cell migration mode in early zebrafish embryos, termed stable-bleb migration. Stable-bleb cells display an invariant polarized balloon-like shape with exceptional migration speed and persistence. Progenitor cells can be reversibly transformed into stable-bleb cells irrespective of their primary fate and motile characteristics by increasing myosin II activity through biochemical or mechanical stimuli. Using a combination of theory and experiments, we show that, in stable-bleb cells, cortical contractility fluctuations trigger a stochastic switch into amoeboid motility, and a positive feedback between cortical flows and gradients in contractility maintains stable-bleb cell polarization. We further show that rearward cortical flows drive stable-bleb cell migration in various adhesive and non-adhesive environments, unraveling a highly versatile amoeboid migration phenotype.","lang":"eng"}],"oa_version":"Published Version","publist_id":"5634","author":[{"first_name":"Verena","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","full_name":"Ruprecht, Verena","orcid":"0000-0003-4088-8633","last_name":"Ruprecht"},{"last_name":"Wieser","full_name":"Wieser, Stefan","orcid":"0000-0002-2670-2217","first_name":"Stefan","id":"355AA5A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andrew","full_name":"Callan Jones, Andrew","last_name":"Callan Jones"},{"first_name":"Michael","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","last_name":"Smutny","full_name":"Smutny, Michael","orcid":"0000-0002-5920-9090"},{"full_name":"Morita, Hitoshi","last_name":"Morita","id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87","first_name":"Hitoshi"},{"last_name":"Sako","full_name":"Sako, Keisuke","orcid":"0000-0002-6453-8075","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","first_name":"Keisuke"},{"orcid":"0000-0003-2676-3367","full_name":"Barone, Vanessa","last_name":"Barone","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","first_name":"Vanessa"},{"first_name":"Monika","full_name":"Ritsch Marte, Monika","last_name":"Ritsch Marte"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"full_name":"Voituriez, Raphaël","last_name":"Voituriez","first_name":"Raphaël"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"title":"Cortical contractility triggers a stochastic switch to fast amoeboid cell motility","citation":{"mla":"Ruprecht, Verena, et al. “Cortical Contractility Triggers a Stochastic Switch to Fast Amoeboid Cell Motility.” Cell, vol. 160, no. 4, Cell Press, 2015, pp. 673–85, doi:10.1016/j.cell.2015.01.008.","ieee":"V. Ruprecht et al., “Cortical contractility triggers a stochastic switch to fast amoeboid cell motility,” Cell, vol. 160, no. 4. Cell Press, pp. 673–685, 2015.","short":"V. Ruprecht, S. Wieser, A. Callan Jones, M. Smutny, H. Morita, K. Sako, V. Barone, M. Ritsch Marte, M.K. Sixt, R. Voituriez, C.-P.J. Heisenberg, Cell 160 (2015) 673–685.","apa":"Ruprecht, V., Wieser, S., Callan Jones, A., Smutny, M., Morita, H., Sako, K., … Heisenberg, C.-P. J. (2015). Cortical contractility triggers a stochastic switch to fast amoeboid cell motility. Cell. Cell Press. https://doi.org/10.1016/j.cell.2015.01.008","ama":"Ruprecht V, Wieser S, Callan Jones A, et al. Cortical contractility triggers a stochastic switch to fast amoeboid cell motility. Cell. 2015;160(4):673-685. doi:10.1016/j.cell.2015.01.008","chicago":"Ruprecht, Verena, Stefan Wieser, Andrew Callan Jones, Michael Smutny, Hitoshi Morita, Keisuke Sako, Vanessa Barone, et al. “Cortical Contractility Triggers a Stochastic Switch to Fast Amoeboid Cell Motility.” Cell. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.01.008.","ista":"Ruprecht V, Wieser S, Callan Jones A, Smutny M, Morita H, Sako K, Barone V, Ritsch Marte M, Sixt MK, Voituriez R, Heisenberg C-PJ. 2015. Cortical contractility triggers a stochastic switch to fast amoeboid cell motility. Cell. 160(4), 673–685."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"2529486C-B435-11E9-9278-68D0E5697425","grant_number":"T 560-B17","name":"Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation"},{"grant_number":"I 812-B12","name":"Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation","call_identifier":"FWF","_id":"2527D5CC-B435-11E9-9278-68D0E5697425"}],"page":"673 - 685","doi":"10.1016/j.cell.2015.01.008","date_published":"2015-02-12T00:00:00Z","date_created":"2018-12-11T11:52:35Z","has_accepted_license":"1","year":"2015","day":"12","publication":"Cell","publisher":"Cell Press","quality_controlled":"1","oa":1,"acknowledgement":"We would like to thank R. Hausschild and E. Papusheva for technical assistance and the service facilities at the IST Austria for continuous support. The caRhoA plasmid was a kind gift of T. Kudoh and A. Takesono. We thank M. Piel and E. Paluch for exchanging unpublished data. "},{"oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"Auxin participates in a multitude of developmental processes, as well as responses to environmental cues. Compared with other plant hormones, auxin exhibits a unique property, as it undergoes directional, cell-to-cell transport facilitated by plasma membrane-localized transport proteins. Among them, a prominent role has been ascribed to the PIN family of auxin efflux facilitators. PIN proteins direct polar auxin transport on account of their asymmetric subcellular localizations. In this review, we provide an overview of the multiple developmental roles of PIN proteins, including the atypical endoplasmic reticulum-localized members of the family, and look at the family from an evolutionary perspective. Next, we cover the cell biological and molecular aspects of PIN function, in particular the establishment of their polar subcellular localization. Hormonal and environmental inputs into the regulation of PIN action are summarized as well."}],"intvolume":" 27","month":"01","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4330589/","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"id":"938","status":"public","relation":"dissertation_contains"}]},"issue":"1","volume":27,"_id":"1591","status":"public","type":"journal_article","date_updated":"2023-09-07T12:06:09Z","department":[{"_id":"JiFr"}],"oa":1,"quality_controlled":"1","publisher":"American Society of Plant Biologists","publication":"Plant Cell","day":"20","year":"2015","date_created":"2018-12-11T11:52:54Z","doi":"10.1105/tpc.114.134874","date_published":"2015-01-20T00:00:00Z","page":"20 - 32","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Adamowski, Maciek, and Jiří Friml. “PIN-Dependent Auxin Transport: Action, Regulation, and Evolution.” Plant Cell. American Society of Plant Biologists, 2015. https://doi.org/10.1105/tpc.114.134874.","ista":"Adamowski M, Friml J. 2015. PIN-dependent auxin transport: Action, regulation, and evolution. Plant Cell. 27(1), 20–32.","mla":"Adamowski, Maciek, and Jiří Friml. “PIN-Dependent Auxin Transport: Action, Regulation, and Evolution.” Plant Cell, vol. 27, no. 1, American Society of Plant Biologists, 2015, pp. 20–32, doi:10.1105/tpc.114.134874.","ama":"Adamowski M, Friml J. PIN-dependent auxin transport: Action, regulation, and evolution. Plant Cell. 2015;27(1):20-32. doi:10.1105/tpc.114.134874","apa":"Adamowski, M., & Friml, J. (2015). PIN-dependent auxin transport: Action, regulation, and evolution. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.114.134874","ieee":"M. Adamowski and J. Friml, “PIN-dependent auxin transport: Action, regulation, and evolution,” Plant Cell, vol. 27, no. 1. American Society of Plant Biologists, pp. 20–32, 2015.","short":"M. Adamowski, J. Friml, Plant Cell 27 (2015) 20–32."},"title":"PIN-dependent auxin transport: Action, regulation, and evolution","external_id":{"pmid":["25604445"]},"publist_id":"5580","author":[{"id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek","orcid":"0000-0001-6463-5257","full_name":"Adamowski, Maciek","last_name":"Adamowski"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"}]}]