[{"year":"2015","abstract":[{"lang":"eng","text":"The concept of positional information is central to our understanding of how cells determine their location in a multicellular structure and thereby their developmental fates. Nevertheless, positional information has neither been defined mathematically nor quantified in a principled way. Here we provide an information-theoretic definition in the context of developmental gene expression patterns and examine the features of expression patterns that affect positional information quantitatively. We connect positional information with the concept of positional error and develop tools to directly measure information and error from experimental data. We illustrate our framework for the case of gap gene expression patterns in the early Drosophila embryo and show how information that is distributed among only four genes is sufficient to determine developmental fates with nearly single-cell resolution. Our approach can be generalized to a variety of different model systems; procedures and examples are discussed in detail. "}],"scopus_import":"1","arxiv":1,"date_updated":"2025-09-23T09:53:07Z","month":"01","isi":1,"date_published":"2015-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5599"}],"publisher":"Genetics Society of America","publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","doi":"10.1534/genetics.114.171850","oa":1,"type":"journal_article","citation":{"ama":"Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. 2015;199(1):39-59. doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>","mla":"Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>, vol. 199, no. 1, Genetics Society of America, 2015, pp. 39–59, doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>.","short":"G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59.","apa":"Tkačik, G., Dubuis, J., Petkova, M., &#38; Gregor, T. (2015). Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>","ista":"Tkačik G, Dubuis J, Petkova M, Gregor T. 2015. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 199(1), 39–59.","ieee":"G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information, positional error, and readout precision in morphogenesis: A mathematical framework,” <i>Genetics</i>, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.","chicago":"Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>. Genetics Society of America, 2015. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>."},"department":[{"_id":"GaTk"}],"issue":"1","publication":"Genetics","day":"01","_id":"1885","publist_id":"5210","volume":199,"corr_author":"1","date_created":"2018-12-11T11:54:32Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"       199","status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000347712900004"],"arxiv":["1404.5599"]},"author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper"},{"first_name":"Julien","full_name":"Dubuis, Julien","last_name":"Dubuis"},{"last_name":"Petkova","full_name":"Petkova, Mariela","first_name":"Mariela"},{"first_name":"Thomas","full_name":"Gregor, Thomas","last_name":"Gregor"}],"quality_controlled":"1","title":"Positional information, positional error, and readout precision in morphogenesis: A mathematical framework","page":"39 - 59"},{"volume":379,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","date_created":"2018-12-11T11:54:49Z","author":[{"full_name":"Pausinger, Florian","first_name":"Florian","orcid":"0000-0002-8379-3768","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Steinerberger","first_name":"Stefan","full_name":"Steinerberger, Stefan"}],"external_id":{"isi":["000349586000006"]},"language":[{"iso":"eng"}],"intvolume":"       379","status":"public","page":"535 - 541","title":"On the distribution of local extrema in quantum chaos","quality_controlled":"1","publisher":"Elsevier","date_published":"2015-03-06T00:00:00Z","scopus_import":"1","abstract":[{"text":"We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2.","lang":"eng"}],"year":"2015","month":"03","isi":1,"date_updated":"2025-09-23T09:44:12Z","oa_version":"None","publication_status":"published","article_processing_charge":"No","citation":{"short":"F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>, vol. 379, no. 6, Elsevier, 2015, pp. 535–41, doi:<a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">10.1016/j.physleta.2014.12.010</a>.","ama":"Pausinger F, Steinerberger S. On the distribution of local extrema in quantum chaos. <i>Physics Letters, Section A</i>. 2015;379(6):535-541. doi:<a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">10.1016/j.physleta.2014.12.010</a>","ista":"Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.","apa":"Pausinger, F., &#38; Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. <i>Physics Letters, Section A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">https://doi.org/10.1016/j.physleta.2014.12.010</a>","ieee":"F. Pausinger and S. Steinerberger, “On the distribution of local extrema in quantum chaos,” <i>Physics Letters, Section A</i>, vol. 379, no. 6. Elsevier, pp. 535–541, 2015.","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.physleta.2014.12.010\">https://doi.org/10.1016/j.physleta.2014.12.010</a>."},"type":"journal_article","department":[{"_id":"HeEd"}],"acknowledgement":"F.P. was supported by the Graduate School of IST Austria. S.S. was partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and Michael Kerber for sharing their implementation of the persistence algorithm. ","doi":"10.1016/j.physleta.2014.12.010","_id":"1938","day":"06","publist_id":"5152","issue":"6","publication":"Physics Letters, Section A"},{"title":"Optimizing information flow in small genetic networks. IV. Spatial coupling","quality_controlled":"1","intvolume":"        91","status":"public","external_id":{"arxiv":["1501.04015"],"isi":["000356131600006"]},"author":[{"id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski","orcid":"0000-0002-1287-3779","full_name":"Sokolowski, Thomas R","first_name":"Thomas R"},{"orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"corr_author":"1","date_created":"2018-12-11T11:54:49Z","article_number":"062710","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":91,"issue":"6","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","day":"15","_id":"1940","publist_id":"5145","doi":"10.1103/PhysRevE.91.062710","oa":1,"citation":{"short":"T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","mla":"Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6, 062710, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>.","ama":"Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2015;91(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>","apa":"Sokolowski, T. R., &#38; Tkačik, G. (2015). Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>","ista":"Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(6), 062710.","ieee":"T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic networks. IV. Spatial coupling,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6. American Institute of Physics, 2015.","chicago":"Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>."},"type":"journal_article","department":[{"_id":"GaTk"}],"publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","scopus_import":"1","abstract":[{"text":"We typically think of cells as responding to external signals independently by regulating their gene expression levels, yet they often locally exchange information and coordinate. Can such spatial coupling be of benefit for conveying signals subject to gene regulatory noise? Here we extend our information-theoretic framework for gene regulation to spatially extended systems. As an example, we consider a lattice of nuclei responding to a concentration field of a transcriptional regulator (the &quot;input&quot;) by expressing a single diffusible target gene. When input concentrations are low, diffusive coupling markedly improves information transmission; optimal gene activation functions also systematically change. A qualitatively new regulatory strategy emerges where individual cells respond to the input in a nearly step-like fashion that is subsequently averaged out by strong diffusion. While motivated by early patterning events in the Drosophila embryo, our framework is generically applicable to spatially coupled stochastic gene expression models.","lang":"eng"}],"year":"2015","month":"06","isi":1,"arxiv":1,"date_updated":"2025-09-23T09:46:10Z","publisher":"American Institute of Physics","date_published":"2015-06-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04015"}]},{"quality_controlled":"1","title":"Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants","page":"116 - 123","intvolume":"        23","status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000349880900017"]},"author":[{"last_name":"Rakusová","first_name":"Hana","full_name":"Rakusová, Hana"},{"orcid":"0000-0002-9767-8699","last_name":"Fendrych","first_name":"Matyas","full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí"}],"corr_author":"1","date_created":"2018-12-11T11:54:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":23,"ec_funded":1,"issue":"2","publication":"Current Opinion in Plant Biology","_id":"1944","day":"01","publist_id":"5140","doi":"10.1016/j.pbi.2014.12.002","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP); the Agency for Innovation by Science and Technology (IWT) (predoctoral fellowship to H.R.); and the People Programme (Marie Curie Actions) of the European Union","type":"journal_article","department":[{"_id":"JiFr"}],"citation":{"chicago":"Rakusová, Hana, Matyas Fendrych, and Jiří Friml. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">https://doi.org/10.1016/j.pbi.2014.12.002</a>.","ieee":"H. Rakusová, M. Fendrych, and J. Friml, “Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants,” <i>Current Opinion in Plant Biology</i>, vol. 23, no. 2. Elsevier, pp. 116–123, 2015.","apa":"Rakusová, H., Fendrych, M., &#38; Friml, J. (2015). Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">https://doi.org/10.1016/j.pbi.2014.12.002</a>","ista":"Rakusová H, Fendrych M, Friml J. 2015. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 23(2), 116–123.","short":"H. Rakusová, M. Fendrych, J. Friml, Current Opinion in Plant Biology 23 (2015) 116–123.","mla":"Rakusová, Hana, et al. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” <i>Current Opinion in Plant Biology</i>, vol. 23, no. 2, Elsevier, 2015, pp. 116–23, doi:<a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">10.1016/j.pbi.2014.12.002</a>.","ama":"Rakusová H, Fendrych M, Friml J. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. <i>Current Opinion in Plant Biology</i>. 2015;23(2):116-123. doi:<a href=\"https://doi.org/10.1016/j.pbi.2014.12.002\">10.1016/j.pbi.2014.12.002</a>"},"publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"article_processing_charge":"No","oa_version":"None","year":"2015","scopus_import":"1","date_updated":"2025-09-23T09:23:09Z","isi":1,"month":"02","date_published":"2015-02-01T00:00:00Z","publisher":"Elsevier"},{"_id":"1481","day":"01","publist_id":"5713","publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","oa":1,"department":[{"_id":"KrCh"}],"citation":{"apa":"Ahmed, U., Chatterjee, K., &#38; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i> (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.","mla":"Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, vol. 2, AAAI Press, 2015, pp. 745–52.","ama":"Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>. Vol 2. AAAI Press; 2015:745-752.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, 2:745–52. AAAI Press, 2015.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, Austin, TX, USA, 2015, vol. 2, pp. 745–752."},"type":"conference","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","oa_version":"None","publication_status":"published","article_processing_charge":"No","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_published":"2015-01-01T00:00:00Z","main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300","open_access":"1"}],"publisher":"AAAI Press","scopus_import":"1","year":"2015","abstract":[{"text":"Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased. ","lang":"eng"}],"date_updated":"2025-05-19T11:10:17Z","arxiv":1,"month":"01","page":"745 - 752","quality_controlled":"1","title":"Automatic generation of alternative starting positions for simple traditional board games","language":[{"iso":"eng"}],"author":[{"last_name":"Ahmed","full_name":"Ahmed, Umair","first_name":"Umair"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sumit","full_name":"Gulwani, Sumit","last_name":"Gulwani"}],"external_id":{"arxiv":["1411.4023"]},"intvolume":"         2","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2015-01-30","name":"AAAI: Conference on Artificial Intelligence","start_date":"2015-01-25","location":"Austin, TX, USA"},"date_created":"2018-12-11T11:52:16Z","volume":2,"related_material":{"record":[{"id":"5410","relation":"earlier_version","status":"public"}]},"ec_funded":1},{"page":"4741 - 4748","publist_id":"5709","day":"14","_id":"1483","title":"A stable multi-scale kernel for topological machine learning","type":"conference","citation":{"chicago":"Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">https://doi.org/10.1109/CVPR.2015.7299106</a>.","ieee":"J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel for topological machine learning,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.","ista":"Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel for topological machine learning. CVPR: Computer Vision and Pattern Recognition, 4741–4748.","apa":"Reininghaus, J., Huber, S., Bauer, U., &#38; Kwitt, R. (2015). A stable multi-scale kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">https://doi.org/10.1109/CVPR.2015.7299106</a>","short":"J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.","mla":"Reininghaus, Jan, et al. <i>A Stable Multi-Scale Kernel for Topological Machine Learning</i>. IEEE, 2015, pp. 4741–48, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">10.1109/CVPR.2015.7299106</a>.","ama":"Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for topological machine learning. In: IEEE; 2015:4741-4748. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">10.1109/CVPR.2015.7299106</a>"},"department":[{"_id":"HeEd"}],"external_id":{"arxiv":["1412.6821"]},"author":[{"last_name":"Reininghaus","full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan","full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9683-0724","last_name":"Bauer","full_name":"Bauer, Ulrich","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kwitt","first_name":"Roland","full_name":"Kwitt, Roland"}],"oa":1,"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"eisbn":["978-1-4673-6964-0 "]},"doi":"10.1109/CVPR.2015.7299106","conference":{"start_date":"2015-06-07","name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2015-06-12","location":"Boston, MA, USA"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_created":"2018-12-11T11:52:17Z","article_processing_charge":"No","publication_status":"published","publisher":"IEEE","date_published":"2015-10-14T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1412.6821","open_access":"1"}],"month":"10","date_updated":"2025-06-11T06:37:43Z","arxiv":1,"abstract":[{"text":"Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes.","lang":"eng"}],"scopus_import":"1","year":"2015"},{"publication":"Proceedings of the 27th Canadian Conference on Computational Geometry","day":"01","_id":"1495","publist_id":"5684","oa":1,"type":"conference","department":[{"_id":"HeEd"}],"citation":{"ieee":"H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.","chicago":"Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, 2015–August:128–35. Queen’s University, 2015.","mla":"Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, vol. 2015–August, Queen’s University, 2015, pp. 128–35.","ama":"Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>. Vol 2015-August. Queen’s University; 2015:128-135.","short":"H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.","apa":"Edelsbrunner, H., Iglesias Ham, M., &#38; Kurlin, V. (2015). Relaxed disk packing. In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i> (Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.","ista":"Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135."},"publication_status":"published","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7","grant_number":"318493"}],"article_processing_charge":"No","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the regular hexagonal grid gives the maximum among lattice configurations. "}],"scopus_import":"1","year":"2015","arxiv":1,"date_updated":"2025-06-11T06:38:01Z","month":"08","date_published":"2015-08-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1505.03402"}],"publisher":"Queen's University","quality_controlled":"1","title":"Relaxed disk packing","page":"128-135","status":"public","language":[{"iso":"eng"}],"external_id":{"arxiv":["1505.03402"]},"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vitaliy","full_name":"Kurlin, Vitaliy","last_name":"Kurlin"}],"date_created":"2018-12-11T11:52:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2015-08-10","name":"CCCG: Canadian Conference on Computational Geometry","end_date":"2015-08-12","location":"Ontario, Canada"},"volume":"2015-August","ec_funded":1},{"date_created":"2018-12-11T11:52:22Z","ddc":["570"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"e146","volume":43,"has_accepted_license":"1","quality_controlled":"1","title":"Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"        43","status":"public","language":[{"iso":"eng"}],"author":[{"last_name":"Andergassen","full_name":"Andergassen, Daniel","first_name":"Daniel"},{"last_name":"Dotter","orcid":"0000-0002-9033-9096","first_name":"Christoph","full_name":"Dotter, Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kulinski, Tomasz","first_name":"Tomasz","last_name":"Kulinski"},{"first_name":"Philipp","full_name":"Guenzl, Philipp","last_name":"Guenzl"},{"last_name":"Bammer","full_name":"Bammer, Philipp","first_name":"Philipp"},{"full_name":"Barlow, Denise","first_name":"Denise","last_name":"Barlow"},{"last_name":"Pauler","full_name":"Pauler, Florian","first_name":"Florian"},{"full_name":"Hudson, Quanah","first_name":"Quanah","last_name":"Hudson"}],"external_id":{"isi":["000366410900009"]},"publication_status":"published","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:44:58Z","file_size":6863297,"checksum":"385b83854fd0eb2e4f386867da2823e2","file_name":"2015_NucleicAcidsRes_Andergassen.pdf","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-20T14:18:57Z","creator":"dernst","access_level":"open_access","file_id":"5768"}],"oa_version":"Published Version","year":"2015","abstract":[{"lang":"eng","text":"Detecting allelic biases from high-throughput sequencing data requires an approach that maximises sensitivity while minimizing false positives. Here, we present Allelome.PRO, an automated user-friendly bioinformatics pipeline, which uses high-throughput sequencing data from reciprocal crosses of two genetically distinct mouse strains to detect allele-specific expression and chromatin modifications. Allelome.PRO extends approaches used in previous studies that exclusively analyzed imprinted expression to give a complete picture of the ‘allelome’ by automatically categorising the allelic expression of all genes in a given cell type into imprinted, strain-biased, biallelic or non-informative. Allelome.PRO offers increased sensitivity to analyze lowly expressed transcripts, together with a robust false discovery rate empirically calculated from variation in the sequencing data. We used RNA-seq data from mouse embryonic fibroblasts from F1 reciprocal crosses to determine a biologically relevant allelic ratio cutoff, and define for the first time an entire allelome. Furthermore, we show that Allelome.PRO detects differential enrichment of H3K4me3 over promoters from ChIP-seq data validating the RNA-seq results. This approach can be easily extended to analyze histone marks of active enhancers, or transcription factor binding sites and therefore provides a powerful tool to identify candidate cis regulatory elements genome wide."}],"scopus_import":"1","date_updated":"2025-09-23T07:45:31Z","month":"07","isi":1,"date_published":"2015-07-21T00:00:00Z","publisher":"Oxford University Press","file_date_updated":"2020-07-14T12:44:58Z","issue":"21","publication":"Nucleic Acids Research","day":"21","_id":"1497","publist_id":"5682","doi":"10.1093/nar/gkv727","acknowledgement":"Austrian Science Fund [FWF P25185-B22, FWF F4302- B09, FWFW1207-B09]. Funding for open access charge: Austrian Science Fund.\r\nWe thank Florian Breitwieser for advice during the early stages of this project. High-throughput sequencing was conducted by the Biomedical Sequencing Facility (BSF) at CeMM in Vienna.","oa":1,"department":[{"_id":"GaNo"}],"citation":{"apa":"Andergassen, D., Dotter, C., Kulinski, T., Guenzl, P., Bammer, P., Barlow, D., … Hudson, Q. (2015). Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkv727\">https://doi.org/10.1093/nar/gkv727</a>","ista":"Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. Nucleic Acids Research. 43(21), e146.","short":"D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow, F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).","mla":"Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” <i>Nucleic Acids Research</i>, vol. 43, no. 21, e146, Oxford University Press, 2015, doi:<a href=\"https://doi.org/10.1093/nar/gkv727\">10.1093/nar/gkv727</a>.","ama":"Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. <i>Nucleic Acids Research</i>. 2015;43(21). doi:<a href=\"https://doi.org/10.1093/nar/gkv727\">10.1093/nar/gkv727</a>","chicago":"Andergassen, Daniel, Christoph Dotter, Tomasz Kulinski, Philipp Guenzl, Philipp Bammer, Denise Barlow, Florian Pauler, and Quanah Hudson. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” <i>Nucleic Acids Research</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/nar/gkv727\">https://doi.org/10.1093/nar/gkv727</a>.","ieee":"D. Andergassen <i>et al.</i>, “Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data,” <i>Nucleic Acids Research</i>, vol. 43, no. 21. Oxford University Press, 2015."},"type":"journal_article"},{"alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea."}],"scopus_import":1,"year":"2015","date_updated":"2025-04-15T06:26:02Z","month":"01","date_published":"2015-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"499","publication_status":"published","series_title":"Leibniz International Proceedings in Informatics","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_name":"IST-2016-499-v1+1_9.pdf","checksum":"cf5e94baa89a2dc4c5de01abc676eda8","file_size":489362,"date_updated":"2020-07-14T12:44:58Z","file_id":"5050","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:14:02Z","relation":"main_file"}],"doi":"10.4230/LIPIcs.SNAPL.2015.90","publication_identifier":{"isbn":["978-3-939897-80-4 "]},"oa":1,"type":"conference","department":[{"_id":"ToHe"}],"citation":{"ista":"Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for fault-tolerant distributed systems. 32, 90–102.","apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2015). The need for language support for fault-tolerant distributed systems. Presented at the SNAPL: Summit oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">https://doi.org/10.4230/LIPIcs.SNAPL.2015.90</a>","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.","mla":"Dragoi, Cezara, et al. <i>The Need for Language Support for Fault-Tolerant Distributed Systems</i>. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">10.4230/LIPIcs.SNAPL.2015.90</a>.","ama":"Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant distributed systems. 2015;32:90-102. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">10.4230/LIPIcs.SNAPL.2015.90</a>","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for Language Support for Fault-Tolerant Distributed Systems.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">https://doi.org/10.4230/LIPIcs.SNAPL.2015.90</a>.","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 90–102, 2015."},"file_date_updated":"2020-07-14T12:44:58Z","day":"01","_id":"1498","publist_id":"5681","volume":32,"ec_funded":1,"has_accepted_license":"1","corr_author":"1","date_created":"2018-12-11T11:52:22Z","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Asilomar, CA, United States","end_date":"2015-05-06","name":"SNAPL: Summit oN Advances in Programming Languages","start_date":"2015-05-03"},"intvolume":"        32","status":"public","language":[{"iso":"eng"}],"author":[{"first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","title":"The need for language support for fault-tolerant distributed systems","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"90 - 102"},{"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","file":[{"date_updated":"2020-07-14T12:44:58Z","file_size":623563,"checksum":"49eb5021caafaabe5356c65b9c5f8c9c","file_name":"IST-2016-498-v1+1_32.pdf","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:08:12Z","creator":"system","access_level":"open_access","file_id":"4672"}],"oa_version":"Published Version","date_updated":"2025-04-15T06:26:02Z","month":"01","alternative_title":["LIPIcs"],"year":"2015","abstract":[{"text":"We consider weighted automata with both positive and negative integer weights on edges and\r\nstudy the problem of synchronization using adaptive strategies that may only observe whether\r\nthe current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata.","lang":"eng"}],"scopus_import":1,"pubrep_id":"498","date_published":"2015-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:44:58Z","publist_id":"5680","day":"01","_id":"1499","doi":"10.4230/LIPIcs.CONCUR.2015.142","acknowledgement":"The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement 601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM), the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Czech Science Foundation under grant agreement P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734.","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"conference","citation":{"ieee":"J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.","chicago":"Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,” 42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>.","mla":"Kretinsky, Jan, et al. <i>Polynomial Time Decidability of Weighted Synchronization under Partial Observability</i>. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>.","ama":"Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","ista":"Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154.","apa":"Kretinsky, J., Larsen, K., Laursen, S., &#38; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>"},"oa":1,"date_created":"2018-12-11T11:52:22Z","ddc":["000","003"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Madrid, Spain","start_date":"2015-09-01","end_date":"2015-09-04","name":"CONCUR: Concurrency Theory"},"ec_funded":1,"volume":42,"has_accepted_license":"1","quality_controlled":"1","title":"Polynomial time decidability of weighted synchronization under partial observability","page":"142 - 154","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","intvolume":"        42","language":[{"iso":"eng"}],"author":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"first_name":"Kim","full_name":"Larsen, Kim","last_name":"Larsen"},{"first_name":"Simon","full_name":"Laursen, Simon","last_name":"Laursen"},{"last_name":"Srba","first_name":"Jiří","full_name":"Srba, Jiří"}]},{"oa_version":"Preprint","publication_status":"published","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1307.8414"}],"date_published":"2015-03-14T00:00:00Z","publisher":"Cambridge University Press","extern":"1","abstract":[{"text":"A Herman-Avila-Bochi type formula is obtained for the average sum of the top d Lyapunov exponents over a one-parameter family of double-struck G-cocycles, where double-struck G is the group that leaves a certain, non-degenerate Hermitian form of signature (c, d) invariant. The generic example of such a group is the pseudo-unitary group U(c, d) or, in the case c = d, the Hermitian-symplectic group HSp(2d) which naturally appears for cocycles related to Schrödinger operators. In the case d = 1, the formula for HSp(2d) cocycles reduces to the Herman-Avila-Bochi formula for SL(2, ℝ) cocycles.","lang":"eng"}],"year":"2015","date_updated":"2025-09-22T14:31:00Z","isi":1,"month":"03","day":"14","_id":"1503","publist_id":"5675","issue":"5","publication":"Ergodic Theory and Dynamical Systems","oa":1,"citation":{"ieee":"C. Sadel, “A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles,” <i>Ergodic Theory and Dynamical Systems</i>, vol. 35, no. 5. Cambridge University Press, pp. 1582–1591, 2015.","chicago":"Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, 2015. <a href=\"https://doi.org/10.1017/etds.2013.103\">https://doi.org/10.1017/etds.2013.103</a>.","short":"C. Sadel, Ergodic Theory and Dynamical Systems 35 (2015) 1582–1591.","mla":"Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” <i>Ergodic Theory and Dynamical Systems</i>, vol. 35, no. 5, Cambridge University Press, 2015, pp. 1582–91, doi:<a href=\"https://doi.org/10.1017/etds.2013.103\">10.1017/etds.2013.103</a>.","ama":"Sadel C. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. <i>Ergodic Theory and Dynamical Systems</i>. 2015;35(5):1582-1591. doi:<a href=\"https://doi.org/10.1017/etds.2013.103\">10.1017/etds.2013.103</a>","apa":"Sadel, C. (2015). A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/etds.2013.103\">https://doi.org/10.1017/etds.2013.103</a>","ista":"Sadel C. 2015. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. 35(5), 1582–1591."},"type":"journal_article","doi":"10.1017/etds.2013.103","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:52:24Z","volume":35,"page":"1582 - 1591","quality_controlled":"1","title":"A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles","language":[{"iso":"eng"}],"external_id":{"isi":["000357605900010"]},"author":[{"last_name":"Sadel","orcid":"0000-0001-8255-3968","full_name":"Sadel, Christian","first_name":"Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        35","status":"public"},{"doi":"10.1214/15-AOS1353","type":"journal_article","citation":{"mla":"Bao, Zhigang, et al. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” <i>Annals of Statistics</i>, vol. 43, no. 6, Institute of Mathematical Statistics, 2015, pp. 2588–623, doi:<a href=\"https://doi.org/10.1214/15-AOS1353\">10.1214/15-AOS1353</a>.","ama":"Bao Z, Lin L, Pan G, Zhou W. Spectral statistics of large dimensional spearman s rank correlation matrix and its application. <i>Annals of Statistics</i>. 2015;43(6):2588-2623. doi:<a href=\"https://doi.org/10.1214/15-AOS1353\">10.1214/15-AOS1353</a>","short":"Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623.","apa":"Bao, Z., Lin, L., Pan, G., &#38; Zhou, W. (2015). Spectral statistics of large dimensional spearman s rank correlation matrix and its application. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AOS1353\">https://doi.org/10.1214/15-AOS1353</a>","ista":"Bao Z, Lin L, Pan G, Zhou W. 2015. Spectral statistics of large dimensional spearman s rank correlation matrix and its application. Annals of Statistics. 43(6), 2588–2623.","ieee":"Z. Bao, L. Lin, G. Pan, and W. Zhou, “Spectral statistics of large dimensional spearman s rank correlation matrix and its application,” <i>Annals of Statistics</i>, vol. 43, no. 6. Institute of Mathematical Statistics, pp. 2588–2623, 2015.","chicago":"Bao, Zhigang, Liang Lin, Guangming Pan, and Wang Zhou. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2015. <a href=\"https://doi.org/10.1214/15-AOS1353\">https://doi.org/10.1214/15-AOS1353</a>."},"oa":1,"publication":"Annals of Statistics","issue":"6","publist_id":"5674","day":"01","_id":"1504","month":"12","isi":1,"date_updated":"2025-09-23T10:47:55Z","abstract":[{"text":"Let Q = (Q1, . . . , Qn) be a random vector drawn from the uniform distribution on the set of all n! permutations of {1, 2, . . . , n}. Let Z = (Z1, . . . , Zn), where Zj is the mean zero variance one random variable obtained by centralizing and normalizing Qj , j = 1, . . . , n. Assume that Xi , i = 1, . . . ,p are i.i.d. copies of 1/√ p Z and X = Xp,n is the p × n random matrix with Xi as its ith row. Then Sn = XX is called the p × n Spearman's rank correlation matrix which can be regarded as a high dimensional extension of the classical nonparametric statistic Spearman's rank correlation coefficient between two independent random variables. In this paper, we establish a CLT for the linear spectral statistics of this nonparametric random matrix model in the scenario of high dimension, namely, p = p(n) and p/n→c ∈ (0,∞) as n→∞.We propose a novel evaluation scheme to estimate the core quantity in Anderson and Zeitouni's cumulant method in [Ann. Statist. 36 (2008) 2553-2576] to bypass the so-called joint cumulant summability. In addition, we raise a two-step comparison approach to obtain the explicit formulae for the mean and covariance functions in the CLT. Relying on this CLT, we then construct a distribution-free statistic to test complete independence for components of random vectors. Owing to the nonparametric property, we can use this test on generally distributed random variables including the heavy-tailed ones.","lang":"eng"}],"year":"2015","extern":"1","publisher":"Institute of Mathematical Statistics","date_published":"2015-12-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.5119"}],"article_processing_charge":"No","publication_status":"published","oa_version":"Published Version","status":"public","intvolume":"        43","external_id":{"isi":["000363437900010"]},"author":[{"orcid":"0000-0003-3036-1475","last_name":"Bao","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lin, Liang","first_name":"Liang","last_name":"Lin"},{"first_name":"Guangming","full_name":"Pan, Guangming","last_name":"Pan"},{"last_name":"Zhou","first_name":"Wang","full_name":"Zhou, Wang"}],"language":[{"iso":"eng"}],"title":"Spectral statistics of large dimensional spearman s rank correlation matrix and its application","quality_controlled":"1","page":"2588 - 2623","volume":43,"date_created":"2018-12-11T11:52:24Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"publisher":"Institute of Mathematical Statistics","date_published":"2015-02-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/1304.5690","open_access":"1"}],"year":"2015","abstract":[{"lang":"eng","text":"This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form W N =Σ 1/2XX∗Σ 1/2 . Here, X = (xij )M,N is an M× N random matrix with independent entries xij , 1 ≤ i M,≤ 1 ≤ j ≤ N such that Exij = 0, E|xij |2 = 1/N . On dimensionality, we assume that M = M(N) and N/M → d ε (0, ∞) as N ∞→. For a class of general deterministic positive-definite M × M matrices Σ , under some additional assumptions on the distribution of xij 's, we show that the limiting behavior of the largest eigenvalue of W N is universal, via pursuing a Green function comparison strategy raised in [Probab. Theory Related Fields 154 (2012) 341-407, Adv. Math. 229 (2012) 1435-1515] by Erd″os, Yau and Yin for Wigner matrices and extended by Pillai and Yin [Ann. Appl. Probab. 24 (2014) 935-1001] to sample covariance matrices in the null case (&amp;Epsi = I ). Consequently, in the standard complex case (Ex2 ij = 0), combing this universality property and the results known for Gaussian matrices obtained by El Karoui in [Ann. Probab. 35 (2007) 663-714] (nonsingular case) and Onatski in [Ann. Appl. Probab. 18 (2008) 470-490] (singular case), we show that after an appropriate normalization the largest eigenvalue of W N converges weakly to the type 2 Tracy-Widom distribution TW2 . Moreover, in the real case, we show that whenΣ is spiked with a fixed number of subcritical spikes, the type 1 Tracy-Widom limit TW1 holds for the normalized largest eigenvalue of W N , which extends a result of Féral and Péché in [J. Math. Phys. 50 (2009) 073302] to the scenario of nondiagonal Σ and more generally distributed X . In summary, we establish the Tracy-Widom type universality for the largest eigenvalue of generally distributed sample covariance matrices under quite light assumptions on &amp;Sigma . Applications of these limiting results to statistical signal detection and structure recognition of separable covariance matrices are also discussed."}],"isi":1,"month":"02","date_updated":"2025-09-29T11:02:34Z","arxiv":1,"oa_version":"Preprint","publication_status":"published","article_processing_charge":"No","oa":1,"type":"journal_article","department":[{"_id":"LaEr"}],"citation":{"ista":"Bao Z, Pan G, Zhou W. 2015. Universality for the largest eigenvalue of sample covariance matrices with general population. Annals of Statistics. 43(1), 382–421.","apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). Universality for the largest eigenvalue of sample covariance matrices with general population. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/14-AOS1281\">https://doi.org/10.1214/14-AOS1281</a>","ama":"Bao Z, Pan G, Zhou W. Universality for the largest eigenvalue of sample covariance matrices with general population. <i>Annals of Statistics</i>. 2015;43(1):382-421. doi:<a href=\"https://doi.org/10.1214/14-AOS1281\">10.1214/14-AOS1281</a>","mla":"Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance Matrices with General Population.” <i>Annals of Statistics</i>, vol. 43, no. 1, Institute of Mathematical Statistics, 2015, pp. 382–421, doi:<a href=\"https://doi.org/10.1214/14-AOS1281\">10.1214/14-AOS1281</a>.","short":"Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “Universality for the Largest Eigenvalue of Sample Covariance Matrices with General Population.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2015. <a href=\"https://doi.org/10.1214/14-AOS1281\">https://doi.org/10.1214/14-AOS1281</a>.","ieee":"Z. Bao, G. Pan, and W. Zhou, “Universality for the largest eigenvalue of sample covariance matrices with general population,” <i>Annals of Statistics</i>, vol. 43, no. 1. Institute of Mathematical Statistics, pp. 382–421, 2015."},"acknowledgement":"B.Z. was supported  in  part  by  NSFC  Grant  11071213,  ZJNSF  Grant  R6090034  and  SRFDP  Grant 20100101110001. P.G. was supported in part by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported  in  part  by  the  Ministry  of  Education,  Singapore,  under  Grant  ARC  14/11,  and  by a Grant R-155-000-131-112 at the National University of Singapore\r\n","doi":"10.1214/14-AOS1281","_id":"1505","day":"01","publist_id":"5672","issue":"1","publication":"Annals of Statistics","volume":43,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:52:25Z","external_id":{"arxiv":["1304.5690"],"isi":["000349738500014"]},"author":[{"last_name":"Bao","orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pan","first_name":"Guangming","full_name":"Pan, Guangming"},{"first_name":"Wang","full_name":"Zhou, Wang","last_name":"Zhou"}],"language":[{"iso":"eng"}],"intvolume":"        43","status":"public","page":"382 - 421","title":"Universality for the largest eigenvalue of sample covariance matrices with general population","quality_controlled":"1"},{"intvolume":"        21","status":"public","external_id":{"arxiv":["1208.5823"],"isi":["000356993100012"]},"author":[{"last_name":"Bao","orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pan","first_name":"Guangming","full_name":"Pan, Guangming"},{"full_name":"Zhou, Wang","first_name":"Wang","last_name":"Zhou"}],"language":[{"iso":"eng"}],"title":"The logarithmic law of random determinant","quality_controlled":"1","page":"1600 - 1628","volume":21,"date_created":"2018-12-11T11:52:25Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.3150/14-BEJ615","oa":1,"citation":{"apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). The logarithmic law of random determinant. <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability. <a href=\"https://doi.org/10.3150/14-BEJ615\">https://doi.org/10.3150/14-BEJ615</a>","ista":"Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli. 21(3), 1600–1628.","ama":"Bao Z, Pan G, Zhou W. The logarithmic law of random determinant. <i>Bernoulli</i>. 2015;21(3):1600-1628. doi:<a href=\"https://doi.org/10.3150/14-BEJ615\">10.3150/14-BEJ615</a>","mla":"Bao, Zhigang, et al. “The Logarithmic Law of Random Determinant.” <i>Bernoulli</i>, vol. 21, no. 3, Bernoulli Society for Mathematical Statistics and Probability, 2015, pp. 1600–28, doi:<a href=\"https://doi.org/10.3150/14-BEJ615\">10.3150/14-BEJ615</a>.","short":"Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “The Logarithmic Law of Random Determinant.” <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability, 2015. <a href=\"https://doi.org/10.3150/14-BEJ615\">https://doi.org/10.3150/14-BEJ615</a>.","ieee":"Z. Bao, G. Pan, and W. Zhou, “The logarithmic law of random determinant,” <i>Bernoulli</i>, vol. 21, no. 3. Bernoulli Society for Mathematical Statistics and Probability, pp. 1600–1628, 2015."},"department":[{"_id":"LaEr"}],"type":"journal_article","issue":"3","publication":"Bernoulli","day":"01","_id":"1506","publist_id":"5671","year":"2015","abstract":[{"lang":"eng","text":"Consider the square random matrix An = (aij)n,n, where {aij:= a(n)ij , i, j = 1, . . . , n} is a collection of independent real random variables with means zero and variances one. Under the additional moment condition supn max1≤i,j ≤n Ea4ij &lt;∞, we prove Girko's logarithmic law of det An in the sense that as n→∞ log | detAn| ? (1/2) log(n-1)! d/→√(1/2) log n N(0, 1)."}],"isi":1,"month":"08","date_updated":"2025-09-23T13:59:56Z","arxiv":1,"publisher":"Bernoulli Society for Mathematical Statistics and Probability","main_file_link":[{"url":"http://arxiv.org/abs/1208.5823","open_access":"1"}],"date_published":"2015-08-01T00:00:00Z","publication_status":"published","article_processing_charge":"No","oa_version":"Preprint"},{"doi":"10.4171/JEMS/548","oa":1,"type":"journal_article","department":[{"_id":"LaEr"}],"citation":{"chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>.","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. European Mathematical Society, pp. 1927–2036, 2015.","apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036.","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>","mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, European Mathematical Society, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>."},"issue":"8","publication":"Journal of the European Mathematical Society","_id":"1508","day":"01","publist_id":"5669","abstract":[{"lang":"eng","text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential."}],"year":"2015","scopus_import":"1","date_updated":"2025-09-23T09:08:38Z","arxiv":1,"isi":1,"month":"08","date_published":"2015-08-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1211.3786","open_access":"1"}],"publisher":"European Mathematical Society","publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","intvolume":"        17","status":"public","language":[{"iso":"eng"}],"external_id":{"arxiv":["1211.3786"],"isi":["000360822900003"]},"author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László","full_name":"Erdös, László"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"}],"quality_controlled":"1","title":"Gap universality of generalized Wigner and β ensembles","page":"1927 - 2036","volume":17,"date_created":"2018-12-11T11:52:26Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"volume":4,"ec_funded":1,"has_accepted_license":"1","corr_author":"1","date_created":"2018-12-11T11:52:26Z","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         4","status":"public","language":[{"iso":"eng"}],"author":[{"last_name":"Michalko","full_name":"Michalko, Jaroslav","first_name":"Jaroslav","id":"483727CA-F248-11E8-B48F-1D18A9856A87"},{"id":"4342E402-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-8004","last_name":"Dravecka","first_name":"Marta","full_name":"Dravecka, Marta"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias","first_name":"Tobias"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"quality_controlled":"1","title":"Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":"1","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"}],"year":"2015","date_updated":"2025-04-15T07:48:03Z","month":"10","date_published":"2015-10-01T00:00:00Z","publisher":"F1000 Research","pubrep_id":"497","publication_status":"published","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7"}],"article_processing_charge":"No","file":[{"checksum":"8beae5cbe988e1060265ae7de2ee8306","file_name":"IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","file_size":4414248,"file_id":"5198","relation":"main_file","date_created":"2018-12-12T10:16:12Z","creator":"system","access_level":"open_access"}],"oa_version":"Published Version","doi":"10.12688/f1000research.7143.1","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","oa":1,"citation":{"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,” <i>F1000 Research </i>, vol. 4. F1000 Research, 2015.","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.” <i>F1000 Research </i>. F1000 Research, 2015. <a href=\"https://doi.org/10.12688/f1000research.7143.1\">https://doi.org/10.12688/f1000research.7143.1</a>.","short":"J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research  4 (2015).","mla":"Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” <i>F1000 Research </i>, vol. 4, F1000 Research, 2015, doi:<a href=\"https://doi.org/10.12688/f1000research.7143.1\">10.12688/f1000research.7143.1</a>.","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. <i>F1000 Research </i>. 2015;4. doi:<a href=\"https://doi.org/10.12688/f1000research.7143.1\">10.12688/f1000research.7143.1</a>","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.","apa":"Michalko, J., Lukacisinova, M., Bollenbach, M. T., &#38; Friml, J. (2015). Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. <i>F1000 Research </i>. F1000 Research. <a href=\"https://doi.org/10.12688/f1000research.7143.1\">https://doi.org/10.12688/f1000research.7143.1</a>"},"type":"journal_article","department":[{"_id":"JiFr"},{"_id":"ToBo"}],"file_date_updated":"2020-07-14T12:44:59Z","publication":"F1000 Research ","day":"01","_id":"1509","publist_id":"5668"},{"language":[{"iso":"eng"}],"author":[{"last_name":"Franek","orcid":"0000-0001-8878-8397","first_name":"Peter","full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Krcál, Marek","last_name":"Krcál"}],"status":"public","intvolume":"        34","page":"842 - 856","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","title":"On computability and triviality of well groups","has_accepted_license":"1","ec_funded":1,"volume":34,"related_material":{"record":[{"status":"public","relation":"later_version","id":"1408"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Eindhoven, Netherlands","end_date":"2015-06-25","name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22"},"date_created":"2018-12-11T11:52:26Z","ddc":["510"],"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"citation":{"ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 842–856.","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups,” 34:842–56. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">https://doi.org/10.4230/LIPIcs.SOCG.2015.842</a>.","short":"P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856.","ama":"Franek P, Krcál M. On computability and triviality of well groups. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:842-856. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">10.4230/LIPIcs.SOCG.2015.842</a>","mla":"Franek, Peter, and Marek Krcál. <i>On Computability and Triviality of Well Groups</i>. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–56, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">10.4230/LIPIcs.SOCG.2015.842</a>.","apa":"Franek, P., &#38; Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">https://doi.org/10.4230/LIPIcs.SOCG.2015.842</a>","ista":"Franek P, Krcál M. 2015. On computability and triviality of well groups. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856."},"type":"conference","oa":1,"doi":"10.4230/LIPIcs.SOCG.2015.842","publist_id":"5667","_id":"1510","day":"11","file_date_updated":"2020-07-14T12:44:59Z","pubrep_id":"503","date_published":"2015-06-11T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-09-18T14:30:52Z","month":"06","alternative_title":["LIPIcs"],"year":"2015","scopus_import":1,"abstract":[{"lang":"eng","text":"The concept of well group in a special but important case captures homological properties of the zero set of a continuous map f from K to R^n on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within L_infty distance r from f for a given r &gt; 0. The main drawback of the approach is that the computability of well groups was shown only when dim K = n or n = 1. Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of R^n by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and dim K &lt; 2n-2, our approximation of the (dim K-n)th well group is exact. For the second part, we find examples of maps f, f' from K to R^n with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status. "}],"file":[{"date_updated":"2020-07-14T12:44:59Z","file_size":623563,"file_name":"IST-2016-503-v1+1_32.pdf","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","content_type":"application/pdf","date_created":"2018-12-12T10:13:19Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5001"}],"oa_version":"Published Version","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"publication_status":"published"},{"status":"public","language":[{"iso":"eng"}],"author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","full_name":"Mabillard, Isaac","first_name":"Isaac"},{"last_name":"Paták","first_name":"Pavel","full_name":"Paták, Pavel"},{"full_name":"Patakova, Zuzana","first_name":"Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","last_name":"Tancer","full_name":"Tancer, Martin","first_name":"Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli"}],"quality_controlled":"1","title":"On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"476 - 490","volume":"34 ","related_material":{"record":[{"status":"public","relation":"later_version","id":"610"}]},"ec_funded":1,"has_accepted_license":"1","date_created":"2018-12-11T11:52:27Z","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2015-06-25","name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22","location":"Eindhoven, Netherlands"},"doi":"10.4230/LIPIcs.SOCG.2015.476","acknowledgement":"The work by Z. P. was partially supported by the Charles University Grant SVV-2014-260103. The\r\nwork by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of\r\nthe Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research\r\nwork of M. T. was conducted at IST Austria, supported by an IST Fellowship. The work by U.W.\r\nwas partially supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and\r\nSNSF-PP00P2-138948).","oa":1,"department":[{"_id":"UlWa"}],"type":"conference","citation":{"ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 476–490.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result,” 34:476–90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.476\">https://doi.org/10.4230/LIPIcs.SOCG.2015.476</a>.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.476\">10.4230/LIPIcs.SOCG.2015.476</a>","mla":"Goaoc, Xavier, et al. <i>On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type Nonembeddability Result</i>. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–90, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.476\">10.4230/LIPIcs.SOCG.2015.476</a>.","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2015. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2015). On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.476\">https://doi.org/10.4230/LIPIcs.SOCG.2015.476</a>"},"file_date_updated":"2020-07-14T12:44:59Z","_id":"1511","day":"11","publist_id":"5666","alternative_title":["LIPIcs"],"abstract":[{"text":"The fact that the complete graph K_5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph K_n embeds in a closed surface M if and only if (n-3)(n-4) is at most 6b_1(M), where b_1(M) is the first Z_2-Betti number of M. On the other hand, Van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of K_{n+1}) embeds in R^{2k} if and only if n is less or equal to 2k+2. Two decades ago, Kuhnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k-1)-connected 2k-manifold with kth Z_2-Betti number b_k only if the following generalized Heawood inequality holds: binom{n-k-1}{k+1} is at most binom{2k+1}{k+1} b_k. This is a common generalization of the case of graphs on surfaces as well as the Van Kampen--Flores theorem. In the spirit of Kuhnel's conjecture, we prove that if the k-skeleton of the n-simplex embeds in a 2k-manifold with kth Z_2-Betti number b_k, then n is at most 2b_k binom{2k+2}{k} + 2k + 5. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k-1)-connected. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.","lang":"eng"}],"scopus_import":1,"year":"2015","date_updated":"2025-09-11T07:35:35Z","month":"06","date_published":"2015-06-11T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"502","publication_status":"published","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"oa_version":"Published Version","file":[{"file_id":"4871","date_created":"2018-12-12T10:11:18Z","relation":"main_file","access_level":"open_access","creator":"system","file_name":"IST-2016-502-v1+1_42.pdf","checksum":"0945811875351796324189312ca29e9e","content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","file_size":636735}]},{"status":"public","intvolume":"        34","language":[{"iso":"eng"}],"author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"full_name":"Paták, Pavel","first_name":"Pavel","last_name":"Paták"},{"first_name":"Zuzana","full_name":"Patakova, Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683"},{"orcid":"0000-0002-1191-6714","last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","title":"Bounding Helly numbers via Betti numbers","page":"507 - 521","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":34,"related_material":{"record":[{"relation":"later_version","status":"public","id":"424"}]},"has_accepted_license":"1","date_created":"2018-12-11T11:52:27Z","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Eindhoven, Netherlands","end_date":"2015-06-25","name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22"},"doi":"10.4230/LIPIcs.SOCG.2015.507","acknowledgement":"PP, ZP and MT were partially supported by the Charles University Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen för matematik, Kungliga Tekniska Högskolan, then IST Austria.","type":"conference","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">https://doi.org/10.4230/LIPIcs.SOCG.2015.507</a>","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">10.4230/LIPIcs.SOCG.2015.507</a>","mla":"Goaoc, Xavier, et al. <i>Bounding Helly Numbers via Betti Numbers</i>. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">10.4230/LIPIcs.SOCG.2015.507</a>.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">https://doi.org/10.4230/LIPIcs.SOCG.2015.507</a>.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521."},"department":[{"_id":"UlWa"}],"oa":1,"file_date_updated":"2020-07-14T12:45:00Z","publist_id":"5665","day":"01","_id":"1512","date_updated":"2025-06-04T08:47:27Z","month":"01","alternative_title":["LIPIcs"],"scopus_import":"1","abstract":[{"text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest.","lang":"eng"}],"year":"2015","pubrep_id":"501","date_published":"2015-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","publication_status":"published","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_name":"IST-2016-501-v1+1_46.pdf","checksum":"e6881df44d87fe0c2529c9f7b2724614","file_size":633712,"date_updated":"2020-07-14T12:45:00Z","file_id":"4794","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:10:09Z","relation":"main_file"}]},{"ec_funded":1,"volume":7,"has_accepted_license":"1","date_created":"2018-12-11T11:52:27Z","ddc":["570"],"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","intvolume":"         7","language":[{"iso":"eng"}],"author":[{"id":"6AAB2240-CA9A-11E9-9C1A-D9D1E5697425","last_name":"Pal","orcid":"0000-0002-4530-8469","first_name":"Arka","full_name":"Pal, Arka"},{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000366498700008"]},"quality_controlled":"1","title":"The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression","page":"3259 - 3268","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-09-23T14:18:15Z","month":"12","isi":1,"year":"2015","scopus_import":"1","abstract":[{"lang":"eng","text":"Insects of the order Hemiptera (true bugs) use a wide range of mechanisms of sex determination, including genetic sex determination, paternal genome elimination, and haplodiploidy. Genetic sex determination, the prevalent mode, is generally controlled by a pair of XY sex chromosomes or by an XX/X0 system, but different configurations that include additional sex chromosomes are also present. Although this diversity of sex determining systems has been extensively studied at the cytogenetic level, only the X chromosome of the model pea aphid Acyrthosiphon pisum has been analyzed at the genomic level, and little is known about X chromosome biology in the rest of the order.\r\n\r\nIn this study, we take advantage of published DNA- and RNA-seq data from three additional Hemiptera species to perform a comparative analysis of the gene content and expression of the X chromosome throughout this clade. We find that, despite showing evidence of dosage compensation, the X chromosomes of these species show female-biased expression, and a deficit of male-biased genes, in direct contrast to the pea aphid X. We further detect an excess of shared gene content between these very distant species, suggesting that despite the diversity of sex determining systems, the same chromosomal element is used as the X throughout a large portion of the order. "}],"pubrep_id":"496","date_published":"2015-12-01T00:00:00Z","publisher":"Oxford University Press","article_processing_charge":"No","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"publication_status":"published","oa_version":"Published Version","file":[{"file_id":"5284","relation":"main_file","date_created":"2018-12-12T10:17:29Z","creator":"system","access_level":"open_access","checksum":"2b56b8c2e2a1d4cc3c9cb8daba26dd9b","file_name":"IST-2016-496-v1+1_Genome_Biol_Evol-2015-Pal-3259-68.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:00Z","file_size":858027}],"doi":"10.1093/gbe/evv215","citation":{"apa":"Pal, A., &#38; Vicoso, B. (2015). The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evv215\">https://doi.org/10.1093/gbe/evv215</a>","ista":"Pal A, Vicoso B. 2015. The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. Genome Biology and Evolution. 7(12), 3259–3268.","mla":"Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects: Conservation, Dosage Compensation and Sex-Biased Expression.” <i>Genome Biology and Evolution</i>, vol. 7, no. 12, Oxford University Press, 2015, pp. 3259–68, doi:<a href=\"https://doi.org/10.1093/gbe/evv215\">10.1093/gbe/evv215</a>.","ama":"Pal A, Vicoso B. The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. <i>Genome Biology and Evolution</i>. 2015;7(12):3259-3268. doi:<a href=\"https://doi.org/10.1093/gbe/evv215\">10.1093/gbe/evv215</a>","short":"A. Pal, B. Vicoso, Genome Biology and Evolution 7 (2015) 3259–3268.","chicago":"Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects: Conservation, Dosage Compensation and Sex-Biased Expression.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/gbe/evv215\">https://doi.org/10.1093/gbe/evv215</a>.","ieee":"A. Pal and B. Vicoso, “The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression,” <i>Genome Biology and Evolution</i>, vol. 7, no. 12. Oxford University Press, pp. 3259–3268, 2015."},"department":[{"_id":"BeVi"}],"type":"journal_article","oa":1,"publication":"Genome Biology and Evolution","file_date_updated":"2020-07-14T12:45:00Z","issue":"12","publist_id":"5664","day":"01","_id":"1513"}]