[{"oa_version":"Published Version","abstract":[{"text":"Branching morphogenesis remains a subject of abiding interest. Although much is \r\nknown about the gene regulatory programs and signaling pathways that operate at \r\nthe cellular scale, it has remained unclear how the macroscopic features of branched \r\norgans, including their size, network topology and spatial patterning, are encoded. \r\nLately, it has been proposed that, these features can be explained quantitatively in \r\nseveral organs within a single unifying framework. Based on large-\r\nscale organ recon\r\n-\r\nstructions and cell lineage tracing, it has been argued that morphogenesis follows \r\nfrom the collective dynamics of sublineage- \r\nrestricted self- \r\nrenewing progenitor cells, \r\nlocalized at ductal tips, that act cooperatively to drive a serial process of ductal elon\r\n-\r\ngation and stochastic tip bifurcation. By correlating differentiation or cell cycle exit \r\nwith proximity to maturing ducts, this dynamic results in the specification of a com-\r\nplex network of defined density and statistical organization. These results suggest \r\nthat, for several mammalian tissues, branched epithelial structures develop as a self- \r\norganized process, reliant upon a strikingly simple, but generic, set of local rules, \r\nwithout recourse to a rigid and deterministic sequence of genetically programmed \r\nevents. Here, we review the basis of these findings and discuss their implications.","lang":"eng"}],"intvolume":" 60","month":"12","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"checksum":"a6d30b0785db902c734a84fecb2eadd9","file_id":"5933","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-02-06T10:40:46Z","file_name":"2018_DevGrowh_Hannezo.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:11Z","file_size":1313606}],"publication_identifier":{"issn":["00121592"]},"volume":60,"issue":"9","_id":"5787","status":"public","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)"},"type":"journal_article","ddc":["570"],"date_updated":"2023-09-19T09:32:49Z","file_date_updated":"2020-07-14T12:47:11Z","department":[{"_id":"EdHa"}],"oa":1,"publisher":"Wiley","quality_controlled":"1","publication":"Development Growth and Differentiation","day":"09","year":"2018","has_accepted_license":"1","isi":1,"date_created":"2018-12-30T22:59:14Z","doi":"10.1111/dgd.12570","date_published":"2018-12-09T00:00:00Z","page":"512-521","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Hannezo, Edouard B, and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation. Wiley, 2018. https://doi.org/10.1111/dgd.12570.","ista":"Hannezo EB, Simons BD. 2018. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 60(9), 512–521.","mla":"Hannezo, Edouard B., and Benjamin D. Simons. “Statistical Theory of Branching Morphogenesis.” Development Growth and Differentiation, vol. 60, no. 9, Wiley, 2018, pp. 512–21, doi:10.1111/dgd.12570.","ama":"Hannezo EB, Simons BD. Statistical theory of branching morphogenesis. Development Growth and Differentiation. 2018;60(9):512-521. doi:10.1111/dgd.12570","apa":"Hannezo, E. B., & Simons, B. D. (2018). Statistical theory of branching morphogenesis. Development Growth and Differentiation. Wiley. https://doi.org/10.1111/dgd.12570","ieee":"E. B. Hannezo and B. D. Simons, “Statistical theory of branching morphogenesis,” Development Growth and Differentiation, vol. 60, no. 9. Wiley, pp. 512–521, 2018.","short":"E.B. Hannezo, B.D. Simons, Development Growth and Differentiation 60 (2018) 512–521."},"title":"Statistical theory of branching morphogenesis","article_processing_charge":"No","external_id":{"isi":["000453555100002"]},"author":[{"first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B"},{"first_name":"Benjamin D.","last_name":"Simons","full_name":"Simons, Benjamin D."}]},{"page":"385 - 407","date_created":"2018-12-11T11:45:41Z","date_published":"2018-04-12T00:00:00Z","doi":"10.1007/978-3-319-89960-2_21","year":"2018","has_accepted_license":"1","isi":1,"day":"12","oa":1,"publisher":"Springer","quality_controlled":"1","article_processing_charge":"No","external_id":{"isi":["000546326300021"]},"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"last_name":"Toman","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7584","title":"Strategy representation by decision trees in reactive synthesis","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.","ista":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.","mla":"Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.","ama":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21","apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21","ieee":"T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.","short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"volume":10805,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"2018_LNCS_Brazdil.pdf","date_created":"2018-12-17T16:29:08Z","creator":"dernst","file_size":1829940,"date_updated":"2020-07-14T12:45:57Z","file_id":"5723","checksum":"b13874ffb114932ad9cc2586b7469db4","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 10805","month":"04","abstract":[{"lang":"eng","text":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:57Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-09-19T09:57:08Z","ddc":["000"],"conference":{"end_date":"2018-04-20","location":"Thessaloniki, Greece","start_date":"2018-04-14","name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems"},"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)"},"type":"conference","status":"public","_id":"297"},{"status":"public","conference":{"start_date":"2018-07-14","end_date":"2018-07-17","location":"Oxford, United Kingdom","name":"CAV: Computer Aided Verification"},"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)"},"type":"conference","_id":"141","file_date_updated":"2020-07-14T12:44:53Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2023-09-19T09:59:55Z","intvolume":" 10982","month":"07","alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"volume":10982,"language":[{"iso":"eng"}],"file":[{"checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","file_id":"5737","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-18T08:52:38Z","file_name":"2018_LNCS_Chatterjee.pdf","date_updated":"2020-07-14T12:44:53Z","file_size":675606,"creator":"dernst"}],"publication_status":"published","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","external_id":{"isi":["000491469700013"]},"article_processing_charge":"No","publist_id":"7782","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"},{"first_name":"Simin","last_name":"Oraee","full_name":"Oraee, Simin"},{"orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","last_name":"Toman","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13","apa":"Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13","mla":"Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13."},"oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","date_created":"2018-12-11T11:44:51Z","date_published":"2018-07-18T00:00:00Z","doi":"10.1007/978-3-319-96142-2_13","page":"178-197","day":"18","year":"2018","isi":1,"has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware (like x86 CPUs). MHFs have interesting cryptographic applications, most notably to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. They advocate that a good MHF must have high cmc. Unlike previous notions, cmc takes into account that dedicated hardware might exploit amortization and parallelism. Still, cmc has been critizised as insufficient, as it fails to capture possible time-memory trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc could still have very different actual hardware cost.\r\n\r\nIn this work we address this problem, and introduce the notion of sustained-memory complexity, which requires that any algorithm evaluating the function must use a large amount of memory for many steps. We construct functions (in the parallel random oracle model) whose sustained-memory complexity is almost optimal: our function can be evaluated using n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input length) random oracle, while any algorithm that can make arbitrary many parallel queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs has been done for various notions (including cmc) before, we reduce the task of constructing an MHFs with high sustained-memory complexity to proving pebbling lower bounds on DAGs. Our main technical contribution is the construction is a family of DAGs on n nodes with constant indegree with high “sustained-space complexity”, meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally “depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1705.05313","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 10821","month":"03","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":10821,"_id":"298","conference":{"name":"Eurocrypt 2018: Advances in Cryptology","start_date":"2018-04-29","end_date":"2018-05-03","location":"Tel Aviv, Israel"},"type":"conference","status":"public","date_updated":"2023-09-19T09:59:30Z","department":[{"_id":"KrPi"}],"oa":1,"quality_controlled":"1","publisher":"Springer","year":"2018","isi":1,"day":"31","page":"99 - 130","date_created":"2018-12-11T11:45:41Z","doi":"10.1007/978-3-319-78375-8_4","date_published":"2018-03-31T00:00:00Z","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"ista":"Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4.","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.","ama":"Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821. Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4","mla":"Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000517098700004"],"arxiv":["1705.05313"]},"article_processing_charge":"No","publist_id":"7583","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"last_name":"Blocki","full_name":"Blocki, Jeremiah","first_name":"Jeremiah"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"title":"Sustained space complexity"},{"citation":{"apa":"Vu, L., Zhu, T., Verstraeten, I., Van De Cotte, B., Gevaert, K., & De Smet, I. (2018). Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery204","ama":"Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 2018;69(19):4609-4624. doi:10.1093/jxb/ery204","short":"L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, I. De Smet, Journal of Experimental Botany 69 (2018) 4609–4624.","ieee":"L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, and I. De Smet, “Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms,” Journal of Experimental Botany, vol. 69, no. 19. Oxford University Press, pp. 4609–4624, 2018.","mla":"Vu, Lam, et al. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany, vol. 69, no. 19, Oxford University Press, 2018, pp. 4609–24, doi:10.1093/jxb/ery204.","ista":"Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. 2018. Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms. Journal of Experimental Botany. 69(19), 4609–4624.","chicago":"Vu, Lam, Tingting Zhu, Inge Verstraeten, Brigitte Van De Cotte, Kris Gevaert, and Ive De Smet. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery204."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Vu, Lam","last_name":"Vu","first_name":"Lam"},{"first_name":"Tingting","last_name":"Zhu","full_name":"Zhu, Tingting"},{"first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"},{"last_name":"Van De Cotte","full_name":"Van De Cotte, Brigitte","first_name":"Brigitte"},{"full_name":"Gevaert, Kris","last_name":"Gevaert","first_name":"Kris"},{"last_name":"De Smet","full_name":"De Smet, Ive","first_name":"Ive"}],"publist_id":"8019","external_id":{"isi":["000443568700010"]},"article_processing_charge":"No","title":"Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated interconversion of phosphoforms","acknowledgement":"TZ is supported by a grant from the Chinese Scholarship Council.","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"isi":1,"has_accepted_license":"1","year":"2018","day":"31","publication":"Journal of Experimental Botany","page":"4609 - 4624","date_published":"2018-08-31T00:00:00Z","doi":"10.1093/jxb/ery204","date_created":"2018-12-11T11:44:17Z","_id":"36","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","date_updated":"2023-09-19T10:00:46Z","ddc":["581"],"department":[{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:46:13Z","abstract":[{"lang":"eng","text":"Wheat (Triticum ssp.) is one of the most important human food sources. However, this crop is very sensitive to temperature changes. Specifically, processes during wheat leaf, flower, and seed development and photosynthesis, which all contribute to the yield of this crop, are affected by high temperature. While this has to some extent been investigated on physiological, developmental, and molecular levels, very little is known about early signalling events associated with an increase in temperature. Phosphorylation-mediated signalling mechanisms, which are quick and dynamic, are associated with plant growth and development, also under abiotic stress conditions. Therefore, we probed the impact of a short-term and mild increase in temperature on the wheat leaf and spikelet phosphoproteome. In total, 3822 (containing 5178 phosphosites) and 5581 phosphopeptides (containing 7023 phosphosites) were identified in leaf and spikelet samples, respectively. Following statistical analysis, the resulting data set provides the scientific community with a first large-scale plant phosphoproteome under the control of higher ambient temperature. This community resource on the high temperature-mediated wheat phosphoproteome will be valuable for future studies. Our analyses also revealed a core set of common proteins between leaf and spikelet, suggesting some level of conserved regulatory mechanisms. Furthermore, we observed temperature-regulated interconversion of phosphoforms, which probably impacts protein activity."}],"oa_version":"Published Version","scopus_import":"1","month":"08","intvolume":" 69","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5741","checksum":"34cb0a1611588b75bd6f4913fb4e30f1","date_updated":"2020-07-14T12:46:13Z","file_size":3359316,"creator":"dernst","date_created":"2018-12-18T09:47:51Z","file_name":"2018_JournalExperimBotany_Vu.pdf"}],"language":[{"iso":"eng"}],"issue":"19","volume":69}]