[{"date_published":"2015-10-09T00:00:00Z","doi":"10.1063/1.4932606","date_created":"2018-12-11T11:53:25Z","year":"2015","day":"09","publication":"Journal of Mathematical Physics","quality_controlled":"1","publisher":"American Institute of Physics","oa":1,"author":[{"first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes","last_name":"Alt"}],"publist_id":"5472","title":"The local semicircle law for random matrices with a fourfold symmetry","citation":{"mla":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” Journal of Mathematical Physics, vol. 56, no. 10, 103301, American Institute of Physics, 2015, doi:10.1063/1.4932606.","short":"J. Alt, Journal of Mathematical Physics 56 (2015).","ieee":"J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,” Journal of Mathematical Physics, vol. 56, no. 10. American Institute of Physics, 2015.","apa":"Alt, J. (2015). The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4932606","ama":"Alt J. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 2015;56(10). doi:10.1063/1.4932606","chicago":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” Journal of Mathematical Physics. American Institute of Physics, 2015. https://doi.org/10.1063/1.4932606.","ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"103301","volume":56,"related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"issue":"10","ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1506.04683","open_access":"1"}],"month":"10","intvolume":" 56","abstract":[{"text":"We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"LaEr"}],"date_updated":"2023-09-07T12:38:08Z","type":"journal_article","status":"public","_id":"1677"},{"type":"journal_article","pubrep_id":"837","status":"public","_id":"1678","file_date_updated":"2020-07-14T12:45:12Z","department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"date_updated":"2023-09-07T12:49:09Z","ddc":["571"],"scopus_import":1,"intvolume":" 11","month":"10","abstract":[{"text":"High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes.","lang":"eng"}],"oa_version":"Submitted Version","ec_funded":1,"issue":"12","volume":11,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"418"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":1308364,"date_updated":"2020-07-14T12:45:12Z","creator":"system","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf","date_created":"2018-12-12T10:10:51Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"e9fb251dfcb7cd209b83f17867e61321","file_id":"4842"}],"project":[{"grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"255BFFFA-B435-11E9-9278-68D0E5697425","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","grant_number":"RGY0084/2012"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"publist_id":"5471","author":[{"full_name":"Inglés Prieto, Álvaro","orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro"},{"first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","orcid":"0000-0002-7218-7738"},{"first_name":"Markus","full_name":"Muellner, Markus","last_name":"Muellner"},{"full_name":"Nowak, Matthias","last_name":"Nowak","id":"30845DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias"},{"last_name":"Nijman","full_name":"Nijman, Sebastian","first_name":"Sebastian"},{"full_name":"Grusch, Michael","last_name":"Grusch","first_name":"Michael"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"title":"Light-assisted small-molecule screening against protein kinases","citation":{"mla":"Inglés Prieto, Álvaro, et al. “Light-Assisted Small-Molecule Screening against Protein Kinases.” Nature Chemical Biology, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 952–54, doi:10.1038/nchembio.1933.","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, et al. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 2015;11(12):952-954. doi:10.1038/nchembio.1933","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Muellner, M., Nowak, M., Nijman, S., Grusch, M., & Janovjak, H. L. (2015). Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. Nature Publishing Group. https://doi.org/10.1038/nchembio.1933","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, M. Muellner, M. Nowak, S. Nijman, M. Grusch, H.L. Janovjak, Nature Chemical Biology 11 (2015) 952–954.","ieee":"Á. Inglés Prieto et al., “Light-assisted small-molecule screening against protein kinases,” Nature Chemical Biology, vol. 11, no. 12. Nature Publishing Group, pp. 952–954, 2015.","chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Markus Muellner, Matthias Nowak, Sebastian Nijman, Michael Grusch, and Harald L Janovjak. “Light-Assisted Small-Molecule Screening against Protein Kinases.” Nature Chemical Biology. Nature Publishing Group, 2015. https://doi.org/10.1038/nchembio.1933.","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, Nowak M, Nijman S, Grusch M, Janovjak HL. 2015. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 11(12), 952–954."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","acknowledgement":"This work was supported by grants from the European Union Seventh Framework Programme (CIG-303564 to H.J. and ERC-StG-311166 to S.M.B.N.), the Human Frontier Science Program (RGY0084_2012 to H.J.) and the Herzfelder Foundation (to M.G.). A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W 1232) and a FemTech fellowship (3580812 Austrian Research Promotion Agency).","page":"952 - 954","date_created":"2018-12-11T11:53:25Z","date_published":"2015-10-12T00:00:00Z","doi":"10.1038/nchembio.1933","year":"2015","has_accepted_license":"1","publication":"Nature Chemical Biology","day":"12"},{"quality_controlled":"1","publisher":"American Physical Society","oa":1,"date_published":"2015-12-08T00:00:00Z","doi":"10.1103/PhysRevLett.115.248101","date_created":"2018-12-11T11:52:49Z","day":"08","publication":"Physical Review Letters","year":"2015","project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"article_number":"248101","title":"Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation","publist_id":"5595","author":[{"first_name":"Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","full_name":"Cepeda Humerez, Sarah A","last_name":"Cepeda Humerez"},{"full_name":"Rieckh, Georg","last_name":"Rieckh","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"S.A. Cepeda Humerez, G. Rieckh, G. Tkačik, Physical Review Letters 115 (2015).","ieee":"S. A. Cepeda Humerez, G. Rieckh, and G. Tkačik, “Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation,” Physical Review Letters, vol. 115, no. 24. American Physical Society, 2015.","ama":"Cepeda Humerez SA, Rieckh G, Tkačik G. Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. 2015;115(24). doi:10.1103/PhysRevLett.115.248101","apa":"Cepeda Humerez, S. A., Rieckh, G., & Tkačik, G. (2015). Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.115.248101","mla":"Cepeda Humerez, Sarah A., et al. “Stochastic Proofreading Mechanism Alleviates Crosstalk in Transcriptional Regulation.” Physical Review Letters, vol. 115, no. 24, 248101, American Physical Society, 2015, doi:10.1103/PhysRevLett.115.248101.","ista":"Cepeda Humerez SA, Rieckh G, Tkačik G. 2015. Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation. Physical Review Letters. 115(24), 248101.","chicago":"Cepeda Humerez, Sarah A, Georg Rieckh, and Gašper Tkačik. “Stochastic Proofreading Mechanism Alleviates Crosstalk in Transcriptional Regulation.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.115.248101."},"month":"12","intvolume":" 115","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1504.05716","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"Gene expression is controlled primarily by interactions between transcription factor proteins (TFs) and the regulatory DNA sequence, a process that can be captured well by thermodynamic models of regulation. These models, however, neglect regulatory crosstalk: the possibility that noncognate TFs could initiate transcription, with potentially disastrous effects for the cell. Here, we estimate the importance of crosstalk, suggest that its avoidance strongly constrains equilibrium models of TF binding, and propose an alternative nonequilibrium scheme that implements kinetic proofreading to suppress erroneous initiation. This proposal is consistent with the observed covalent modifications of the transcriptional apparatus and predicts increased noise in gene expression as a trade-off for improved specificity. Using information theory, we quantify this trade-off to find when optimal proofreading architectures are favored over their equilibrium counterparts. Such architectures exhibit significant super-Poisson noise at low expression in steady state.","lang":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"6473"}]},"volume":115,"issue":"24","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"1576","department":[{"_id":"GaTk"}],"date_updated":"2023-09-07T12:55:21Z"},{"abstract":[{"lang":"eng","text":"We study conditions under which a finite simplicial complex $K$ can be mapped to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint simplices of $K$ do not have a common point. We show that if $r$ is not a prime power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex in $\\mathbb R^d$. This improves on previous constructions of counterexamples (for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P. Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors. The counterexamples are obtained by proving the following algebraic criterion in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero. This result can be restated in terms of cohomological obstructions or equivariant maps, and extends an analogous codimension 3 criterion by the second and fourth authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample."}],"acknowledgement":"We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful discussions.","oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1511.03501","open_access":"1"}],"month":"11","publication_status":"submitted","year":"2015","publication":"arXiv","language":[{"iso":"eng"}],"day":"15","date_created":"2020-07-30T10:45:19Z","date_published":"2015-11-15T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"9308"},{"relation":"later_version","status":"public","id":"10220"},{"status":"public","id":"8156","relation":"dissertation_contains"}]},"_id":"8183","article_number":"1511.03501","type":"preprint","status":"public","citation":{"chicago":"Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.","ista":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, 1511.03501.","ama":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.","apa":"Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.","short":"S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).","ieee":"S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” arXiv. ."},"date_updated":"2023-09-07T13:12:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1511.03501"]},"article_processing_charge":"No","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"},{"last_name":"Mabillard","full_name":"Mabillard, Isaac","first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"A.","last_name":"Skopenkov","full_name":"Skopenkov, A."},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"title":"Eliminating higher-multiplicity intersections, III. Codimension 2","department":[{"_id":"UlWa"}]},{"type":"technical_report","pubrep_id":"340","status":"public","_id":"5441","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"file_date_updated":"2020-07-14T12:46:56Z","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","department":[{"_id":"KrCh"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1."},"date_updated":"2023-09-19T14:36:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"oa":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"07","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.","lang":"eng"}],"oa_version":"Published Version","page":"24","date_created":"2018-12-12T11:39:21Z","doi":"10.15479/AT:IST-2015-340-v1-1","related_material":{"record":[{"relation":"later_version","status":"public","id":"1437"},{"id":"5442","status":"public","relation":"earlier_version"},{"relation":"later_version","id":"6009","status":"public"}]},"date_published":"2015-07-11T00:00:00Z","publication_status":"published","year":"2015","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"11","file":[{"creator":"system","date_updated":"2020-07-14T12:46:56Z","file_size":861396,"date_created":"2018-12-12T11:54:09Z","file_name":"IST-2015-340-v1+1_main.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"df383dc62c94d7b2ea639aba088a76c6","file_id":"5531"}]},{"citation":{"ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria; 2015.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","mla":"Anonymous, 1, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015."},"date_updated":"2023-09-19T14:36:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"last_name":"Anonymous","full_name":"Anonymous, 2","first_name":"2"},{"full_name":"Anonymous, 3","last_name":"Anonymous","first_name":"3"},{"full_name":"Anonymous, 4","last_name":"Anonymous","first_name":"4"}],"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","file_date_updated":"2020-07-14T12:46:57Z","_id":"5442","type":"technical_report","pubrep_id":"344","status":"public","publication_status":"published","year":"2015","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"day":"14","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5498","checksum":"98fd936102f3e057fc321ef6d316001d","file_size":658747,"date_updated":"2020-07-14T12:46:57Z","creator":"system","file_name":"IST-2015-343-v2+1_main.pdf","date_created":"2018-12-12T11:53:37Z"},{"content_type":"text/plain","relation":"main_file","access_level":"closed","checksum":"b31d09b1241b59c75e1f42dadf09d258","file_id":"6316","file_size":139,"date_updated":"2020-07-14T12:46:57Z","creator":"dernst","file_name":"IST-2015-343-v2+2_anonymous.txt","date_created":"2019-04-16T12:36:08Z"}],"page":"22","date_created":"2018-12-12T11:39:21Z","related_material":{"record":[{"status":"public","id":"1437","relation":"later_version"},{"relation":"later_version","status":"public","id":"5441"},{"relation":"later_version","id":"6009","status":"public"}]},"date_published":"2015-07-14T00:00:00Z","abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis.\r\nWe consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\n\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, \r\neach subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving \r\nthe worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"scopus_import":1,"month":"07"},{"day":"14","language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","year":"2015","publication_status":"published","related_material":{"record":[{"relation":"later_version","status":"public","id":"1407"}]},"doi":"10.1145/2728606.2728608","date_published":"2015-04-14T00:00:00Z","date_created":"2018-12-11T11:53:29Z","ec_funded":1,"page":"259 - 268","oa_version":"Preprint","abstract":[{"text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study.","lang":"eng"}],"month":"04","publisher":"ACM","scopus_import":1,"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015. https://doi.org/10.1145/2728606.2728608.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728608","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:259-268. doi:10.1145/2728606.2728608","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608."},"date_updated":"2023-09-20T09:43:09Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","author":[{"first_name":"Mária","full_name":"Svoreňová, Mária","last_name":"Svoreňová"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Ivana","last_name":"Cěrná","full_name":"Cěrná, Ivana"},{"first_name":"Cǎlin","last_name":"Belta","full_name":"Belta, Cǎlin"}],"publist_id":"5456","_id":"1689","status":"public","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"type":"conference","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","location":"Seattle, WA, United States","end_date":"2015-04-16"}},{"volume":9207,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1130"},{"id":"1338","status":"public","relation":"later_version"}]},"ec_funded":1,"publication_status":"published","file":[{"date_created":"2018-12-12T10:08:53Z","file_name":"IST-2015-336-v1+1_long_version.pdf","date_updated":"2020-07-14T12:45:13Z","file_size":481922,"creator":"system","file_id":"4715","checksum":"6ff58ac220e2f20cb001ba35d4924495","content_type":"application/pdf","access_level":"local","relation":"main_file"}],"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":1,"month":"07","intvolume":" 9207","abstract":[{"lang":"eng","text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions."}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:13Z","date_updated":"2023-09-20T11:13:50Z","ddc":["000"],"type":"conference","conference":{"name":"CAV: Computer Aided Verification","location":"San Francisco, CA, United States","end_date":"2015-07-24","start_date":"2015-07-18"},"status":"public","pubrep_id":"336","series_title":"Lecture Notes in Computer Science","_id":"1729","page":"180 - 197","date_published":"2015-07-01T00:00:00Z","doi":"10.1007/978-3-319-21668-3_11","date_created":"2018-12-11T11:53:42Z","has_accepted_license":"1","year":"2015","day":"01","quality_controlled":"1","publisher":"Springer","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"first_name":"Leonid","full_name":"Ryzhyk, Leonid","last_name":"Ryzhyk"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta","full_name":"Samanta, Roopsha"},{"first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten","last_name":"Tarrach"}],"publist_id":"5398","title":"From non-preemptive to preemptive scheduling using synchronization synthesis","citation":{"mla":"Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.","short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.","ieee":"P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"author":[{"last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Paixao","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana"}],"publist_id":"5267","title":"Model checking gene regulatory networks","citation":{"chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_47.","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483.","mla":"Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol. 9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking gene regulatory networks. 2015;9035:469-483. doi:10.1007/978-3-662-46681-0_47","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_47"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"page":"469 - 483","date_created":"2018-12-11T11:54:16Z","doi":"10.1007/978-3-662-46681-0_47","date_published":"2015-04-01T00:00:00Z","year":"2015","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2 148797.\r\n","department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"date_updated":"2023-09-20T11:06:03Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2015-04-18","location":"London, United Kingdom","start_date":"2015-04-11"},"type":"conference","status":"public","series_title":"Lecture Notes in Computer Science","_id":"1835","ec_funded":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"1351"}]},"volume":9035,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.7704"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 9035","month":"04","abstract":[{"text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.","lang":"eng"}],"oa_version":"Preprint"},{"ddc":["570"],"date_updated":"2023-10-10T14:10:24Z","department":[{"_id":"JiFr"},{"_id":"ToBo"}],"file_date_updated":"2020-07-14T12:44:59Z","_id":"1509","status":"public","pubrep_id":"497","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)"},"file":[{"file_id":"5198","checksum":"8beae5cbe988e1060265ae7de2ee8306","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:16:12Z","file_name":"IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf","date_updated":"2020-07-14T12:44:59Z","file_size":4414248,"creator":"system"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":4,"ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"The Auxin Binding Protein1 (ABP1) has been identified based on its ability to bind auxin with high affinity and studied for a long time as a prime candidate for the extracellular auxin receptor responsible for mediating in particular the fast non-transcriptional auxin responses. However, the contradiction between the embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the biological importance of ABP1 and relevance of the previous genetic studies. Here we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore, the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the BSM locus by the T-DNA insertions. This clarifies the controversy of different phenotypes among published abp1 knock-out alleles and asks for reflections on the developmental role of ABP1.","lang":"eng"}],"month":"10","intvolume":" 4","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. 2015. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 4.","chicago":"Michalko, Jaroslav, Marta Lukacisinova, Mark Tobias Bollenbach, and Jiří Friml. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research . F1000 Research, 2015. https://doi.org/10.12688/f1000research.7143.1.","apa":"Michalko, J., Lukacisinova, M., Bollenbach, M. T., & Friml, J. (2015). Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . F1000 Research. https://doi.org/10.12688/f1000research.7143.1","ama":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 2015;4. doi:10.12688/f1000research.7143.1","short":"J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research 4 (2015).","ieee":"J. Michalko, M. Lukacisinova, M. T. Bollenbach, and J. Friml, “Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene,” F1000 Research , vol. 4. F1000 Research, 2015.","mla":"Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research , vol. 4, F1000 Research, 2015, doi:10.12688/f1000research.7143.1."},"title":"Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene","publist_id":"5668","author":[{"last_name":"Michalko","full_name":"Michalko, Jaroslav","first_name":"Jaroslav","id":"483727CA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dravecka","orcid":"0000-0002-2519-8004","full_name":"Dravecka, Marta","first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"},{"last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"article_processing_charge":"No","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"day":"01","publication":"F1000 Research ","has_accepted_license":"1","year":"2015","date_published":"2015-10-01T00:00:00Z","doi":"10.12688/f1000research.7143.1","date_created":"2018-12-11T11:52:26Z","acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”.\r\nData associated with the article are available under the terms of the Creative Commons Zero \"No rights reserved\" data waiver (CC0 1.0 Public domain dedication). \r\n\r\nData availability: \r\nF1000Research: Dataset 1. Dataset 1, 10.5256/f1000research.7143.d104552\r\n\r\nF1000Research: Dataset 2. Dataset 2, 10.5256/f1000research.7143.d104553\r\n\r\nF1000Research: Dataset 3. Dataset 3, 10.5256/f1000research.7143.d104554","publisher":"F1000 Research","quality_controlled":"1","oa":1}]