[{"file":[{"date_created":"2019-11-26T14:24:26Z","title":"X-CAD Supplemental Material","file_name":"xcad_sup_mat_siga19.pdf","creator":"bbickel","date_updated":"2020-07-14T12:47:49Z","file_size":1673176,"checksum":"56a2fb019adcb556d2b022f5e5acb68c","file_id":"7119","access_level":"open_access","relation":"supplementary_material","content_type":"application/pdf"},{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","description":"This is the author's version of the work.","checksum":"5f29d76aceb5102e766cbab9b17d776e","file_id":"7120","creator":"bbickel","date_updated":"2020-07-14T12:47:49Z","file_size":14563618,"date_created":"2019-11-26T14:24:27Z","title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","file_name":"XCAD_authors_version.pdf"},{"date_updated":"2020-07-14T12:47:49Z","file_size":259979129,"creator":"bbickel","date_created":"2019-11-26T14:27:37Z","file_name":"XCAD_video.mp4","content_type":"video/mp4","access_level":"open_access","relation":"main_file","checksum":"0d31e123286cbec9e28b2001c2bb0d55","file_id":"7121"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0730-0301"]},"publication_status":"published","issue":"6","volume":38,"related_material":{"record":[{"relation":"dissertation_contains","id":"12897","status":"public"}]},"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"text":"We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models.","lang":"eng"}],"month":"11","intvolume":" 38","scopus_import":"1","ddc":["000"],"date_updated":"2024-03-27T23:30:46Z","file_date_updated":"2020-07-14T12:47:49Z","department":[{"_id":"BeBi"}],"_id":"7117","status":"public","article_type":"original","type":"journal_article","day":"06","publication":"ACM Transactions on Graphics","isi":1,"has_accepted_license":"1","year":"2019","date_published":"2019-11-06T00:00:00Z","doi":"10.1145/3355089.3356576","date_created":"2019-11-26T14:22:09Z","quality_controlled":"1","publisher":"ACM","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019, doi:10.1145/3355089.3356576.","ama":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 2019;38(6). doi:10.1145/3355089.3356576","apa":"Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer, M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576","ieee":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer, “X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions on Graphics, vol. 38, no. 6. ACM, 2019.","short":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM Transactions on Graphics 38 (2019).","chicago":"Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger, Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576.","ista":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 38(6), 157."},"title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","author":[{"id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Hafner, Christian","last_name":"Hafner"},{"first_name":"Christian","full_name":"Schumacher, Christian","last_name":"Schumacher"},{"first_name":"Espen","full_name":"Knoop, Espen","last_name":"Knoop"},{"full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"full_name":"Bächer, Moritz","last_name":"Bächer","first_name":"Moritz"}],"article_processing_charge":"No","external_id":{"isi":["000498397300007"]},"article_number":"157","project":[{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}]},{"department":[{"_id":"BjHo"}],"date_updated":"2024-03-27T23:30:47Z","type":"journal_article","status":"public","_id":"6189","issue":"11","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9728"}]},"volume":122,"publication_status":"published","publication_identifier":{"eissn":["10797114"],"issn":["00319007"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.06358"}],"scopus_import":"1","intvolume":" 122","month":"03","abstract":[{"lang":"eng","text":"Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations."}],"oa_version":"Preprint","external_id":{"isi":["000461922000006"],"arxiv":["1809.06358"]},"article_processing_charge":"No","author":[{"first_name":"Nishchal","id":"469E6004-F248-11E8-B48F-1D18A9856A87","last_name":"Agrawal","full_name":"Agrawal, Nishchal"},{"full_name":"Choueiri, George H","last_name":"Choueiri","first_name":"George H","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hof","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"title":"Transition to turbulence in particle laden flows","citation":{"apa":"Agrawal, N., Choueiri, G. H., & Hof, B. (2019). Transition to turbulence in particle laden flows. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.122.114502","ama":"Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows. Physical Review Letters. 2019;122(11). doi:10.1103/PhysRevLett.122.114502","short":"N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019).","ieee":"N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle laden flows,” Physical Review Letters, vol. 122, no. 11. American Physical Society, 2019.","mla":"Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters, vol. 122, no. 11, 114502, American Physical Society, 2019, doi:10.1103/PhysRevLett.122.114502.","ista":"Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle laden flows. Physical Review Letters. 122(11), 114502.","chicago":"Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters. American Physical Society, 2019. https://doi.org/10.1103/PhysRevLett.122.114502."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"114502","date_created":"2019-03-31T21:59:12Z","date_published":"2019-03-22T00:00:00Z","doi":"10.1103/PhysRevLett.122.114502","year":"2019","isi":1,"publication":"Physical Review Letters","day":"22","oa":1,"quality_controlled":"1","publisher":"American Physical Society"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Decades of studies have revealed the mechanisms of gene regulation in molecular detail. We make use of such well-described regulatory systems to explore how the molecular mechanisms of protein-protein and protein-DNA interactions shape the dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics of protein-DNA binding determines the potential of regulatory networks to evolve and adapt, which can be captured using a simple mathematical model. \r\nii) The evolution of regulatory connections can lead to a significant amount of crosstalk between binding proteins. We explore the effect of crosstalk on gene expression from a target promoter, which seems to be modulated through binding competition at non-specific DNA sites. \r\niii) We investigate how the very same biophysical characteristics as in i) can generate significant fitness costs for cells through global crosstalk, meaning non-specific DNA binding across the genomic background. \r\niv) Binding competition between proteins at a target promoter is a prevailing regulatory feature due to the prevalence of co-regulation at bacterial promoters. However, the dynamics of these systems are not always straightforward to determine even if the molecular mechanisms of regulation are known. A detailed model of the biophysical interactions reveals that interference between the regulatory proteins can constitute a new, generic form of system memory that records the history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics of protein-DNA binding can be harnessed to investigate the principles that shape and ultimately limit cellular gene regulation. These results provide a basis for studies of higher-level functionality, which arises from the underlying regulation. \r\n"}],"month":"05","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"file":[{"file_size":12597663,"date_updated":"2021-02-11T11:17:13Z","creator":"cigler","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf","date_created":"2019-05-03T11:54:52Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2020-05-02","checksum":"c0085d47c58c9cbcab1b0a783480f6da","file_id":"6373"},{"checksum":"2eac954de1c8bbf7e6fb35ed0221ae8c","file_id":"6374","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","date_created":"2019-05-03T11:54:54Z","file_name":"IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx","creator":"cigler","date_updated":"2020-07-14T12:47:28Z","file_size":34644426}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"id":"67","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"5585","relation":"popular_science"}]},"_id":"6371","keyword":["gene regulation","biophysics","transcription factor binding","bacteria"],"status":"public","type":"dissertation","ddc":["576","579"],"date_updated":"2024-02-21T13:45:52Z","supervisor":[{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2021-02-11T11:17:13Z","department":[{"_id":"CaGu"}],"oa":1,"publisher":"Institute of Science and Technology Austria","day":"03","year":"2019","has_accepted_license":"1","date_created":"2019-05-03T11:55:51Z","doi":"10.15479/AT:ISTA:6371","date_published":"2019-05-03T00:00:00Z","page":"152","project":[{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Igler C. 2019. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria.","chicago":"Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6371.","apa":"Igler, C. (2019). On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6371","ama":"Igler C. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. 2019. doi:10.15479/AT:ISTA:6371","ieee":"C. Igler, “On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation,” Institute of Science and Technology Austria, 2019.","short":"C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria, 2019.","mla":"Igler, Claudia. On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6371."},"title":"On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation","article_processing_charge":"No","author":[{"id":"46613666-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia","full_name":"Igler, Claudia","last_name":"Igler"}]},{"author":[{"full_name":"Allini, Elie Noumon","last_name":"Allini","first_name":"Elie Noumon"},{"first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","full_name":"Skórski, Maciej"},{"full_name":"Petura, Oto","last_name":"Petura","first_name":"Oto"},{"full_name":"Bernard, Florent","last_name":"Bernard","first_name":"Florent"},{"first_name":"Marek","last_name":"Laban","full_name":"Laban, Marek"},{"first_name":"Viktor","last_name":"Fischer","full_name":"Fischer, Viktor"}],"article_processing_charge":"No","title":"Evaluation and monitoring of free running oscillators serving as source of randomness","citation":{"chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research, 2018. https://doi.org/10.13154/tches.v2018.i3.214-242.","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242. doi:10.13154/tches.v2018.i3.214-242","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"214-242","date_published":"2018-01-01T00:00:00Z","doi":"10.13154/tches.v2018.i3.214-242","date_created":"2021-11-14T23:01:25Z","has_accepted_license":"1","year":"2018","day":"01","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","publisher":"International Association for Cryptologic Research","quality_controlled":"1","oa":1,"department":[{"_id":"KrPi"}],"file_date_updated":"2021-11-15T10:27:29Z","date_updated":"2021-11-15T10:48:49Z","ddc":["000"],"article_type":"original","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","_id":"10286","issue":"3","volume":2018,"publication_identifier":{"eissn":["2569-2925"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b816b848f046c48a8357700d9305dce5","file_id":"10289","success":1,"date_updated":"2021-11-15T10:27:29Z","file_size":955755,"creator":"cchlebak","date_created":"2021-11-15T10:27:29Z","file_name":"2018_IACR_Allini.pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"01","intvolume":" 2018","abstract":[{"text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.","lang":"eng"}],"oa_version":"Published Version"},{"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Dvořák","full_name":"Dvořák, Wolfgang","first_name":"Wolfgang"},{"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":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"external_id":{"arxiv":["1909.04983"]},"article_processing_charge":"No","title":"Quasipolynomial set-based symbolic algorithms for parity games","citation":{"ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"page":"233-253","date_published":"2018-10-23T00:00:00Z","doi":"10.29007/5z5k","date_created":"2022-03-18T12:46:32Z","has_accepted_license":"1","year":"2018","day":"23","publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","publisher":"EasyChair","quality_controlled":"1","oa":1,"acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","file_date_updated":"2022-05-17T07:51:08Z","department":[{"_id":"KrCh"}],"date_updated":"2022-07-29T09:24:31Z","ddc":["000"],"type":"conference","conference":{"name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","start_date":"2018-11-17","location":"Awassa, Ethiopia","end_date":"2018-11-21"},"status":"public","_id":"10883","volume":57,"ec_funded":1,"publication_identifier":{"issn":["2398-7340"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"11392","checksum":"1229aa8640bd6db610c85decf2265480","file_size":720893,"date_updated":"2022-05-17T07:51:08Z","creator":"dernst","file_name":"2018_EPiCs_Chatterjee.pdf","date_created":"2022-05-17T07:51:08Z"}],"language":[{"iso":"eng"}],"alternative_title":["EPiC Series in Computing"],"scopus_import":"1","month":"10","intvolume":" 57","abstract":[{"lang":"eng","text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space."}],"oa_version":"Published Version"},{"oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:44:08Z","date_published":"2018-10-27T00:00:00Z","doi":"10.1007/978-3-030-01602-9_9","page":"185 - 214","day":"27","year":"2018","project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"title":"Mean-field limits of particles in interaction with quantised radiation fields","external_id":{"arxiv":["1806.10843"]},"publist_id":"8045","author":[{"id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K","last_name":"Leopold","orcid":"0000-0002-0495-6822","full_name":"Leopold, Nikolai K"},{"first_name":"Peter","last_name":"Pickl","full_name":"Pickl, Peter"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. https://doi.org/10.1007/978-3-030-01602-9_9","ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp. 185–214, doi:10.1007/978-3-030-01602-9_9.","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9."},"intvolume":" 270","month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1806.10843","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm.","lang":"eng"}],"ec_funded":1,"volume":270,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"start_date":"2017-03-30","end_date":"2017-04-01","location":"Munich, Germany","name":"MaLiQS: Macroscopic Limits of Quantum Systems"},"type":"conference","_id":"11","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:48:16Z"},{"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2","apa":"Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826."},"title":"Infinite-dimensional calculus under weak spatial regularity of the processes","article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Franco","last_name":"Flandoli","full_name":"Flandoli, Franco"},{"full_name":"Russo, Francesco","last_name":"Russo","first_name":"Francesco"},{"id":"47491882-F248-11E8-B48F-1D18A9856A87","first_name":"Giovanni A","last_name":"Zanco","full_name":"Zanco, Giovanni A"}],"publist_id":"6119","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","oa":1,"publisher":"Springer","quality_controlled":"1","publication":"Journal of Theoretical Probability","day":"01","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:50:45Z","doi":"10.1007/s10959-016-0724-2","date_published":"2018-06-01T00:00:00Z","page":"789-826","_id":"1215","pubrep_id":"712","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":["519"],"date_updated":"2021-01-12T06:49:09Z","file_date_updated":"2020-07-14T12:44:39Z","department":[{"_id":"JaMa"}],"oa_version":"Published Version","abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"intvolume":" 31","month":"06","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"47686d58ec21c164540f1a980ff2163f","file_id":"5266","creator":"system","date_updated":"2020-07-14T12:44:39Z","file_size":671125,"date_created":"2018-12-12T10:17:13Z","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf"}],"publication_status":"published","issue":"2","volume":31},{"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)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"type":"conference","_id":"185","file_date_updated":"2020-07-14T12:45:19Z","department":[{"_id":"UlWa"}],"ddc":["510"],"date_updated":"2021-01-12T06:53:36Z","intvolume":" 99","month":"01","scopus_import":1,"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once."}],"volume":99,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","file_id":"5701","creator":"dernst","file_size":718857,"date_updated":"2020-07-14T12:45:19Z","file_name":"2018_LIPIcs_Fulek.pdf","date_created":"2018-12-17T12:33:52Z"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-066-8"]},"project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"article_number":"39","title":"Hanani-Tutte for approximating maps of graphs","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"publist_id":"7735","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","apa":"Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39","mla":"Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39."},"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2018-12-11T11:45:04Z","date_published":"2018-01-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.39","day":"01","year":"2018","has_accepted_license":"1"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex."}],"intvolume":" 99","month":"06","scopus_import":1,"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"language":[{"iso":"eng"}],"file":[{"checksum":"7509403803b3ac1aee94bbc2ad293d21","file_id":"5724","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_LIPIcs_Edelsbrunner.pdf","date_created":"2018-12-17T16:31:31Z","file_size":489080,"date_updated":"2020-07-14T12:45:20Z","creator":"dernst"}],"publication_status":"published","volume":99,"_id":"188","status":"public","conference":{"start_date":"2018-06-11","end_date":"2018-06-14","location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry"},"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","ddc":["000"],"date_updated":"2021-01-12T06:53:48Z","file_date_updated":"2020-07-14T12:45:20Z","department":[{"_id":"HeEd"}],"acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"11","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:45:05Z","doi":"10.4230/LIPIcs.SoCG.2018.35","date_published":"2018-06-11T00:00:00Z","page":"35:1 - 35:13","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","mla":"Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35."},"title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7733"},{"doi":"10.1016/j.heliyon.2018.e00596","date_published":"2018-04-01T00:00:00Z","date_created":"2018-12-11T11:45:44Z","day":"01","publication":"Heliyon","has_accepted_license":"1","year":"2018","publisher":"Elsevier","quality_controlled":"1","oa":1,"title":"An introduction to the maximum entropy approach and its application to inference problems in biology","author":[{"last_name":"De Martino","full_name":"De Martino, Andrea","first_name":"Andrea"},{"last_name":"De Martino","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018.","short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596","apa":"De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596","mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.","ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596.","chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596."},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"article_number":"e00596","issue":"4","volume":4,"ec_funded":1,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"67010cf5e3b3e0637c659371714a715a","file_id":"5929","date_updated":"2020-07-14T12:45:59Z","file_size":994490,"creator":"dernst","date_created":"2019-02-06T07:36:24Z","file_name":"2018_Heliyon_DeMartino.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"04","intvolume":" 4","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:59Z","department":[{"_id":"GaTk"}],"ddc":["530"],"date_updated":"2021-01-12T07:40:46Z","status":"public","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)"},"_id":"306"}]