[{"pmid":1,"intvolume":"        23","oa":1,"_id":"2469","publication_status":"published","title":"Three functions of cadherins in cell adhesion","oa_version":"Published Version","year":"2013","abstract":[{"text":"Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals. By regulating contact formation and stability, cadherins play a crucial role in tissue morphogenesis and homeostasis. Here, we review the three major  unctions of cadherins in cell–cell contact formation and stability. Two of those functions lead to a decrease in interfacial ension at the forming cell–cell contact, thereby promoting contact expansion — first, by providing adhesion tension that lowers interfacial tension at the cell–cell contact, and second, by signaling to the actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial tension at the contact. The third function of cadherins in cell–cell contact formation is to stabilize the contact by resisting mechanical forces that pull on the contact.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by/4.0/","external_id":{"pmid":["23885883"],"isi":["000322414200018"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Cell Press","status":"public","page":"R626 - R633","ddc":["570"],"date_published":"2013-07-22T00:00:00Z","month":"07","publication":"Current Biology","date_updated":"2025-09-29T14:12:25Z","type":"journal_article","issue":"14","department":[{"_id":"CaHe"}],"has_accepted_license":"1","corr_author":"1","day":"22","date_created":"2018-12-11T11:57:51Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:41Z","author":[{"first_name":"Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","last_name":"Maître","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"isi":1,"file":[{"access_level":"open_access","date_created":"2019-01-24T15:40:22Z","relation":"main_file","file_name":"2013_CurrentBiology_Maitre.pdf","date_updated":"2020-07-14T12:45:41Z","creator":"dernst","checksum":"6a424b2f007b41d4955a9135793b2162","content_type":"application/pdf","file_size":247320,"file_id":"5881"}],"article_processing_charge":"No","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1016/j.cub.2013.06.019","publist_id":"4433","quality_controlled":"1","citation":{"mla":"Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” <i>Current Biology</i>, vol. 23, no. 14, Cell Press, 2013, pp. R626–33, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">10.1016/j.cub.2013.06.019</a>.","apa":"Maître, J.-L., &#38; Heisenberg, C.-P. J. (2013). Three functions of cadherins in cell adhesion. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">https://doi.org/10.1016/j.cub.2013.06.019</a>","ama":"Maître J-L, Heisenberg C-PJ. Three functions of cadherins in cell adhesion. <i>Current Biology</i>. 2013;23(14):R626-R633. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">10.1016/j.cub.2013.06.019</a>","chicago":"Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.06.019\">https://doi.org/10.1016/j.cub.2013.06.019</a>.","ista":"Maître J-L, Heisenberg C-PJ. 2013. Three functions of cadherins in cell adhesion. Current Biology. 23(14), R626–R633.","short":"J.-L. Maître, C.-P.J. Heisenberg, Current Biology 23 (2013) R626–R633.","ieee":"J.-L. Maître and C.-P. J. Heisenberg, “Three functions of cadherins in cell adhesion,” <i>Current Biology</i>, vol. 23, no. 14. Cell Press, pp. R626–R633, 2013."},"volume":23},{"citation":{"ieee":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, and E. Zažímalová, “Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013.","short":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, E. Zažímalová, PLoS One 8 (2013).","ista":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. 2013. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 8(7), e70050.","chicago":"Čovanová, Milada, Michael Sauer, Jan Rychtář, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070050\">https://doi.org/10.1371/journal.pone.0070050</a>.","mla":"Čovanová, Milada, et al. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” <i>PLoS One</i>, vol. 8, no. 7, e70050, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070050\">10.1371/journal.pone.0070050</a>.","ama":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070050\">10.1371/journal.pone.0070050</a>","apa":"Čovanová, M., Sauer, M., Rychtář, J., Friml, J., Petrášek, J., &#38; Zažímalová, E. (2013). Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070050\">https://doi.org/10.1371/journal.pone.0070050</a>"},"quality_controlled":"1","volume":8,"publist_id":"4432","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1371/journal.pone.0070050","scopus_import":"1","file":[{"file_name":"IST-2016-413-v1+1_journal.pone.0070050.pdf","relation":"main_file","date_created":"2018-12-12T10:08:21Z","access_level":"open_access","file_size":2294955,"content_type":"application/pdf","file_id":"4681","date_updated":"2020-07-14T12:45:41Z","checksum":"2d47ef47616ef4de1d517d146548184e","creator":"system"}],"article_processing_charge":"No","isi":1,"author":[{"last_name":"Čovanová","first_name":"Milada","full_name":"Čovanová, Milada"},{"first_name":"Michael","last_name":"Sauer","full_name":"Sauer, Michael"},{"full_name":"Rychtář, Jan","first_name":"Jan","last_name":"Rychtář"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"full_name":"Zažímalová, Eva","last_name":"Zažímalová","first_name":"Eva"}],"date_created":"2018-12-11T11:57:51Z","day":"23","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:41Z","issue":"7","type":"journal_article","has_accepted_license":"1","department":[{"_id":"JiFr"}],"date_updated":"2025-09-29T14:11:54Z","month":"07","date_published":"2013-07-23T00:00:00Z","ddc":["570"],"publication":"PLoS One","status":"public","article_number":"e70050","publisher":"Public Library of Science","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000325211000181"]},"pubrep_id":"413","year":"2013","abstract":[{"lang":"eng","text":"Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and its function is indispensable for plant growth and development. ABP1 has been shown to be involved in auxin-dependent regulation of cell division and expansion, in plasma-membrane-related processes such as changes in transmembrane potential, and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated downstream pathway remains elusive.Methodology/Principal Findings:Using auxin transport assays and quantitative analysis of cellular morphology we show that ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can counterbalance increased auxin efflux and auxin starvation phenotypes caused by the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the ABP1-controlled vesicle trafficking processes, including positive regulation of endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The findings indicate the involvement of ABP1 in control of rate of auxin transport across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity at the plasma membrane, and highlighting the relevance of ABP1 for the formation of developmentally important, PIN-dependent auxin gradients."}],"oa_version":"Published Version","_id":"2470","publication_status":"published","title":"Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells","intvolume":"         8","oa":1},{"oa":1,"intvolume":"         8","title":"Mechanism of protein kinetic stabilization by engineered disulfide crosslinks","publication_status":"published","_id":"2471","oa_version":"Published Version","abstract":[{"text":"The impact of disulfide bonds on protein stability goes beyond simple equilibrium thermodynamics effects associated with the conformational entropy of the unfolded state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional association and strongly affect the rates of irreversible enzyme inactivation, highly relevant in biotechnological applications. While these kinetic-stability effects remain poorly understood, by analogy with proposed mechanisms for processes of protein aggregation and fibrillogenesis, we propose that they may be determined by the properties of sparsely-populated, partially-unfolded intermediates. Here we report the successful design, on the basis of high temperature molecular-dynamics simulations, of six thermodynamically and kinetically stabilized variants of phytase from Citrobacter braakii (a biotechnologically important enzyme) with one, two or three engineered disulfides. Activity measurements and 3D crystal structure determination demonstrate that the engineered crosslinks do not cause dramatic alterations in the native structure. The inactivation kinetics for all the variants displays a strongly non-Arrhenius temperature dependence, with the time-scale for the irreversible denaturation process reaching a minimum at a given temperature within the range of the denaturation transition. We show this striking feature to be a signature of a key role played by a partially unfolded, intermediate state/ensemble. Energetic and mutational analyses confirm that the intermediate is highly unfolded (akin to a proposed critical intermediate in the misfolding of the prion protein), a result that explains the observed kinetic stabilization. Our results provide a rationale for the kinetic-stability consequences of disulfide-crosslink engineering and an experimental methodology to arrive at energetic/structural descriptions of the sparsely populated and elusive intermediates that play key roles in irreversible protein denaturation.","lang":"eng"}],"year":"2013","pubrep_id":"414","external_id":{"isi":["000323114200054"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Public Library of Science","article_number":"e70013","status":"public","publication":"PLoS One","ddc":["570"],"month":"07","date_published":"2013-07-30T00:00:00Z","date_updated":"2025-09-29T14:10:56Z","department":[{"_id":"HaJa"}],"has_accepted_license":"1","type":"journal_article","issue":"7","file_date_updated":"2020-07-14T12:45:41Z","date_created":"2018-12-11T11:57:51Z","language":[{"iso":"eng"}],"day":"30","author":[{"first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","last_name":"Sanchez Romero","full_name":"Sanchez Romero, Inmaculada"},{"full_name":"Ariza, Antonio","first_name":"Antonio","last_name":"Ariza"},{"first_name":"Keith","last_name":"Wilson","full_name":"Wilson, Keith"},{"full_name":"Skjøt, Michael","last_name":"Skjøt","first_name":"Michael"},{"first_name":"Jesper","last_name":"Vind","full_name":"Vind, Jesper"},{"first_name":"Leonardo","last_name":"De Maria","full_name":"De Maria, Leonardo"},{"full_name":"Skov, Lars","first_name":"Lars","last_name":"Skov"},{"full_name":"Sánchez Ruiz, Jose","last_name":"Sánchez Ruiz","first_name":"Jose"}],"isi":1,"article_processing_charge":"No","file":[{"file_size":1323666,"content_type":"application/pdf","file_id":"5124","date_updated":"2020-07-14T12:45:41Z","creator":"system","checksum":"c0c96cc76ed7ef0d036a31a7e33c9a37","file_name":"IST-2016-414-v1+1_journal.pone.0070013.pdf","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:15:07Z"}],"scopus_import":"1","doi":"10.1371/journal.pone.0070013","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4430","volume":8,"citation":{"short":"I. Sanchez-Romero, A. Ariza, K. Wilson, M. Skjøt, J. Vind, L. De Maria, L. Skov, J. Sánchez Ruiz, PLoS One 8 (2013).","ista":"Sanchez-Romero I, Ariza A, Wilson K, Skjøt M, Vind J, De Maria L, Skov L, Sánchez Ruiz J. 2013. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 8(7), e70013.","ieee":"I. Sanchez-Romero <i>et al.</i>, “Mechanism of protein kinetic stabilization by engineered disulfide crosslinks,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013.","ama":"Sanchez-Romero I, Ariza A, Wilson K, et al. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070013\">10.1371/journal.pone.0070013</a>","apa":"Sanchez-Romero, I., Ariza, A., Wilson, K., Skjøt, M., Vind, J., De Maria, L., … Sánchez Ruiz, J. (2013). Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070013\">https://doi.org/10.1371/journal.pone.0070013</a>","mla":"Sanchez-Romero, Inmaculada, et al. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” <i>PLoS One</i>, vol. 8, no. 7, e70013, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070013\">10.1371/journal.pone.0070013</a>.","chicago":"Sanchez-Romero, Inmaculada, Antonio Ariza, Keith Wilson, Michael Skjøt, Jesper Vind, Leonardo De Maria, Lars Skov, and Jose Sánchez Ruiz. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070013\">https://doi.org/10.1371/journal.pone.0070013</a>."},"quality_controlled":"1"},{"department":[{"_id":"JiFr"},{"_id":"EvBe"}],"has_accepted_license":"1","issue":"7","type":"journal_article","date_updated":"2025-09-29T14:11:25Z","publication":"PLoS One","ddc":["580","570"],"month":"07","date_published":"2013-07-29T00:00:00Z","status":"public","author":[{"last_name":"Cazzonelli","first_name":"Christopher","full_name":"Cazzonelli, Christopher"},{"first_name":"Marleen","last_name":"Vanstraelen","full_name":"Vanstraelen, Marleen"},{"full_name":"Simon, Sibu","orcid":"0000-0002-1998-6741","last_name":"Simon","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","first_name":"Sibu"},{"full_name":"Yin, Kuide","first_name":"Kuide","last_name":"Yin"},{"first_name":"Ashley","last_name":"Carron Arthur","full_name":"Carron Arthur, Ashley"},{"last_name":"Nisar","first_name":"Nazia","full_name":"Nisar, Nazia"},{"last_name":"Tarle","first_name":"Gauri","full_name":"Tarle, Gauri"},{"full_name":"Cuttriss, Abby","last_name":"Cuttriss","first_name":"Abby"},{"full_name":"Searle, Iain","last_name":"Searle","first_name":"Iain"},{"first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"},{"full_name":"Mathesius, Ulrike","first_name":"Ulrike","last_name":"Mathesius"},{"full_name":"Masle, Josette","last_name":"Masle","first_name":"Josette"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"Pogson, Barry","first_name":"Barry","last_name":"Pogson"}],"file_date_updated":"2020-07-14T12:45:41Z","day":"29","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:52Z","scopus_import":"1","article_processing_charge":"No","file":[{"creator":"system","checksum":"3be71828b6c2ba9c90eb7056e3f7f57a","date_updated":"2020-07-14T12:45:41Z","file_id":"5222","content_type":"application/pdf","file_size":9003465,"relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:16:34Z","file_name":"IST-2015-393-v1+1_journal.pone.0070069.pdf"}],"isi":1,"volume":8,"quality_controlled":"1","citation":{"mla":"Cazzonelli, Christopher, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS One</i>, vol. 8, no. 7, e70069, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0070069\">10.1371/journal.pone.0070069</a>.","ama":"Cazzonelli C, Vanstraelen M, Simon S, et al. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. <i>PLoS One</i>. 2013;8(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0070069\">10.1371/journal.pone.0070069</a>","apa":"Cazzonelli, C., Vanstraelen, M., Simon, S., Yin, K., Carron Arthur, A., Nisar, N., … Pogson, B. (2013). Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0070069\">https://doi.org/10.1371/journal.pone.0070069</a>","chicago":"Cazzonelli, Christopher, Marleen Vanstraelen, Sibu Simon, Kuide Yin, Ashley Carron Arthur, Nazia Nisar, Gauri Tarle, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0070069\">https://doi.org/10.1371/journal.pone.0070069</a>.","ista":"Cazzonelli C, Vanstraelen M, Simon S, Yin K, Carron Arthur A, Nisar N, Tarle G, Cuttriss A, Searle I, Benková E, Mathesius U, Masle J, Friml J, Pogson B. 2013. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 8(7), e70069.","short":"C. Cazzonelli, M. Vanstraelen, S. Simon, K. Yin, A. Carron Arthur, N. Nisar, G. Tarle, A. Cuttriss, I. Searle, E. Benková, U. Mathesius, J. Masle, J. Friml, B. Pogson, PLoS One 8 (2013).","ieee":"C. Cazzonelli <i>et al.</i>, “Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science, 2013."},"publist_id":"4431","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1371/journal.pone.0070069","oa_version":"Published Version","title":"Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development","_id":"2472","publication_status":"published","ec_funded":1,"oa":1,"intvolume":"         8","pubrep_id":"393","abstract":[{"text":"Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone auxin are required for tissue-specific directional auxin transport and cellular auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important roles in developmental processes such as embryogenesis, organogenesis, vascular tissue differentiation, root meristem patterning and tropic growth. Here we analyzed roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible and is expressed during multiple auxin-regulated developmental processes. Loss of pin6 function interfered with primary root growth and lateral root development. Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis in other growth processes such as shoot apical dominance, lateral root primordia development, adventitious root formation, root hair outgrowth and root waving. These changes in auxin-regulated growth correlated with a reduction in total auxin transport as well as with an altered activity of DR5-GUS auxin response reporter. Overall, the data indicate that PIN6 regulates auxin homeostasis during plant development.","lang":"eng"}],"year":"2013","project":[{"call_identifier":"FP7","grant_number":"207362","name":"Hormonal cross-talk in plant organogenesis","_id":"253FCA6A-B435-11E9-9278-68D0E5697425"},{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000323369700128"]},"article_number":"e70069","publisher":"Public Library of Science"},{"quality_controlled":"1","citation":{"ieee":"N. H. Barton, A. Etheridge, J. Kelleher, and A. Véber, “Genetic hitch-hiking in spatially extended populations,” <i>Theoretical Population Biology</i>, vol. 87, no. 8. Elsevier, pp. 75–89, 2013.","short":"N.H. Barton, A. Etheridge, J. Kelleher, A. Véber, Theoretical Population Biology 87 (2013) 75–89.","ista":"Barton NH, Etheridge A, Kelleher J, Véber A. 2013. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 87(8), 75–89.","chicago":"Barton, Nicholas H, Alison Etheridge, Jerome Kelleher, and Amandine Véber. “Genetic Hitch-Hiking in Spatially Extended Populations.” <i>Theoretical Population Biology</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">https://doi.org/10.1016/j.tpb.2012.12.001</a>.","ama":"Barton NH, Etheridge A, Kelleher J, Véber A. Genetic hitch-hiking in spatially extended populations. <i>Theoretical Population Biology</i>. 2013;87(8):75-89. doi:<a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">10.1016/j.tpb.2012.12.001</a>","apa":"Barton, N. H., Etheridge, A., Kelleher, J., &#38; Véber, A. (2013). Genetic hitch-hiking in spatially extended populations. <i>Theoretical Population Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">https://doi.org/10.1016/j.tpb.2012.12.001</a>","mla":"Barton, Nicholas H., et al. “Genetic Hitch-Hiking in Spatially Extended Populations.” <i>Theoretical Population Biology</i>, vol. 87, no. 8, Elsevier, 2013, pp. 75–89, doi:<a href=\"https://doi.org/10.1016/j.tpb.2012.12.001\">10.1016/j.tpb.2012.12.001</a>."},"volume":87,"doi":"10.1016/j.tpb.2012.12.001","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4428","scopus_import":"1","isi":1,"file":[{"access_level":"open_access","date_created":"2018-12-12T10:18:54Z","relation":"main_file","file_name":"IST-2013-118-v1+1_bartonetalRevision.pdf","checksum":"4274ec1f433b838a7d5b941cc9684ca7","creator":"system","date_updated":"2020-07-14T12:45:41Z","file_id":"5376","content_type":"application/pdf","file_size":1706282}],"article_processing_charge":"No","day":"03","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:52Z","file_date_updated":"2020-07-14T12:45:41Z","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Etheridge, Alison","first_name":"Alison","last_name":"Etheridge"},{"last_name":"Kelleher","first_name":"Jerome","full_name":"Kelleher, Jerome"},{"last_name":"Véber","first_name":"Amandine","full_name":"Véber, Amandine"}],"corr_author":"1","date_updated":"2025-09-29T14:10:28Z","type":"journal_article","issue":"8","has_accepted_license":"1","department":[{"_id":"NiBa"}],"status":"public","page":"75 - 89","date_published":"2013-01-03T00:00:00Z","month":"01","ddc":["570"],"publication":"Theoretical Population Biology","publisher":"Elsevier","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"external_id":{"isi":["000322688800008"]},"year":"2013","abstract":[{"text":"When a mutation with selective advantage s spreads through a panmictic population, it may cause two lineages at a linked locus to coalesce; the probability of coalescence is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid individuals, and r is the recombination rate. Population structure delays fixation, and so weakens the effect of a selective sweep. However, favourable alleles spread through a spatially continuous population behind a narrow wavefront; ancestral lineages are confined at the tip of this front, and so coalesce rapidly. In extremely dense populations, coalescence is dominated by rare fluctuations ahead of the front. However, we show that for moderate densities, a simple quasi-deterministic approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ), where ρ is the population density and  is the characteristic scale of the wavefront; g(η) depends only on the strength of random drift,  . The net effect of a sweep on coalescence also depends crucially on whether two lineages are ever both within the wavefront at the same time: even in the extreme case when coalescence within the front is instantaneous, the net rate of coalescence may be lower than in a single panmictic population. Sweeps can also have a substantial impact on the rate of gene flow. A single lineage will jump to a new location when it is hit by a sweep, with mean square displacement  ; this can be substantial if the species’ range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R, is small. This effect is half as strong in two dimensions. In contrast, the rate of coalescence between lineages, at random locations in space and on the genetic map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average, one-dimensional structure is likely to reduce coalescence due to sweeps, relative to panmixis. In two dimensions, genes must move along the front before they can coalesce; this process is rapid, being dominated by rare fluctuations. This leads to a dramatically higher rate of coalescence within the wavefront than if lineages simply diffused along the front. Nevertheless, the net rate of coalescence due to a sweep through a two-dimensional population is likely to be lower than it would be with panmixis.","lang":"eng"}],"pubrep_id":"118","publication_status":"published","_id":"2473","title":"Genetic hitch-hiking in spatially extended populations","oa_version":"Submitted Version","intvolume":"        87","ec_funded":1,"oa":1},{"volume":36,"citation":{"apa":"Lampert, C., Nickisch, H., &#38; Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>","ama":"Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2013;36(3):453-465. doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>","mla":"Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>.","chicago":"Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>.","ista":"Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465.","short":"C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465.","ieee":"C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3. IEEE, pp. 453–465, 2013."},"quality_controlled":"1","publist_id":"4385","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1109/TPAMI.2013.140","scopus_import":"1","article_processing_charge":"No","isi":1,"author":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"full_name":"Nickisch, Hannes","last_name":"Nickisch","first_name":"Hannes"},{"full_name":"Harmeling, Stefan","last_name":"Harmeling","first_name":"Stefan"}],"day":"30","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:58:08Z","department":[{"_id":"ChLa"}],"issue":"3","type":"journal_article","date_updated":"2025-09-29T14:09:57Z","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","month":"07","date_published":"2013-07-30T00:00:00Z","page":"453 - 465","status":"public","publisher":"IEEE","external_id":{"isi":["000331450100005"]},"abstract":[{"lang":"eng","text":"We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes."}],"year":"2013","oa_version":"None","title":"Attribute-based classification for zero-shot learning of object categories","_id":"2516","publication_status":"published","intvolume":"        36"},{"corr_author":"1","related_material":{"record":[{"status":"public","id":"2271","relation":"later_version"}]},"day":"01","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:58:08Z","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","page":"625 - 636","date_published":"2013-07-01T00:00:00Z","month":"07","date_updated":"2025-09-23T14:14:56Z","issue":"1","type":"conference","department":[{"_id":"VlKo"}],"doi":"10.1007/978-3-642-39206-1_53","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"4383","citation":{"mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization</i>. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">10.1007/978-3-642-39206-1_53</a>.","ama":"Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive characterization. In: Vol 7965. Springer; 2013:625-636. doi:<a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">10.1007/978-3-642-39206-1_53</a>","apa":"Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">https://doi.org/10.1007/978-3-642-39206-1_53</a>","chicago":"Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39206-1_53\">https://doi.org/10.1007/978-3-642-39206-1_53</a>.","ista":"Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.","short":"V. Kolmogorov, in:, Springer, 2013, pp. 625–636.","ieee":"V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636."},"quality_controlled":"1","volume":7965,"scopus_import":1,"year":"2013","abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard."}],"main_file_link":[{"url":"http://arxiv.org/abs/1207.7213","open_access":"1"}],"conference":{"start_date":"2013-07-08","end_date":"2013-07-12","name":"ICALP: Automata, Languages and Programming","location":"Riga, Latvia"},"arxiv":1,"intvolume":"      7965","oa":1,"_id":"2518","publication_status":"published","title":"The power of linear programming for finite-valued CSPs: A constructive characterization","oa_version":"Preprint","publisher":"Springer","external_id":{"arxiv":["1207.7213"]},"alternative_title":["LNCS"]},{"publisher":"AUAI Press","publication_identifier":{"isbn":["9780974903996"]},"abstract":[{"text":"We propose a probabilistic model to infer supervised latent variables in\r\nthe Hamming space from observed data. Our model allows simultaneous\r\ninference of the number of binary latent variables, and their values. The\r\nlatent variables preserve neighbourhood structure of the data in a sense\r\nthat objects in the same semantic concept have similar latent values, and\r\nobjects in different concepts have dissimilar latent values. We formulate\r\nthe supervised infinite latent variable problem based on an intuitive\r\nprinciple of pulling objects together if they are of the same type, and\r\npushing them apart if they are not. We then combine this principle with a\r\nflexible Indian Buffet Process prior on the latent variables. We show that\r\nthe inferred supervised latent variables can be directly used to perform a\r\nnearest neighbour search for the purpose of retrieval.  We introduce a new\r\napplication of dynamically extending hash codes, and show how to\r\neffectively couple the structure of the hash codes with continuously\r\ngrowing structure of the neighbourhood preserving infinite latent feature\r\nspace.","lang":"eng"}],"year":"2013","pubrep_id":"137","conference":{"start_date":"2013-07-11","end_date":"2013-07-15","name":"UAI: Uncertainty in Artificial Intelligence","location":"Bellevue, WA, United States"},"oa":1,"title":"The supervised IBP: Neighbourhood preserving infinite latent feature models","publication_status":"published","_id":"2520","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4381","citation":{"ieee":"N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised IBP: Neighbourhood preserving infinite latent feature models,” in <i>Proceedings of the 29th conference uncertainty in Artificial Intelligence</i>, Bellevue, WA, United States, 2013, pp. 527–536.","short":"N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–536.","ista":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the 29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, 527–536.","chicago":"Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” In <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>, 527–36. AUAI Press, 2013.","mla":"Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>, AUAI Press, 2013, pp. 527–36.","apa":"Quadrianto, N., Sharmanska, V., Knowles, D., &#38; Ghahramani, Z. (2013). The supervised IBP: Neighbourhood preserving infinite latent feature models. In <i>Proceedings of the 29th conference uncertainty in Artificial Intelligence</i> (pp. 527–536). Bellevue, WA, United States: AUAI Press.","ama":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood preserving infinite latent feature models. In: <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>. AUAI Press; 2013:527-536."},"quality_controlled":"1","file":[{"date_created":"2018-12-12T10:15:16Z","access_level":"open_access","relation":"main_file","file_name":"IST-2013-137-v1+1_QuaShaKnoGha13.pdf","date_updated":"2020-07-14T12:45:42Z","creator":"system","checksum":"325f20c4b926bd74d39006b97df572bd","file_size":1117100,"content_type":"application/pdf","file_id":"5134"}],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:42Z","date_created":"2018-12-11T11:58:09Z","language":[{"iso":"eng"}],"day":"11","author":[{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","first_name":"Viktoriia","full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308"},{"last_name":"Knowles","first_name":"David","full_name":"Knowles, David"},{"first_name":"Zoubin","last_name":"Ghahramani","full_name":"Ghahramani, Zoubin"}],"page":"527 - 536","status":"public","publication":"Proceedings of the 29th conference uncertainty in Artificial Intelligence","month":"07","ddc":["000"],"date_published":"2013-07-11T00:00:00Z","date_updated":"2023-02-23T10:46:36Z","department":[{"_id":"ChLa"}],"has_accepted_license":"1","type":"conference"},{"doi":"10.1145/2463372.2463568","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4174","quality_controlled":"1","citation":{"ieee":"N. H. Barton and T. Paixao, “Can quantitative and population genetics help us understand evolutionary computation?,” in <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i>, Amsterdam, Netherlands, 2013, pp. 1573–1580.","ista":"Barton NH, Paixao T. 2013. Can quantitative and population genetics help us understand evolutionary computation? Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 1573–1580.","short":"N.H. Barton, T. Paixao, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–1580.","chicago":"Barton, Nicholas H, and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” In <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, 1573–80. ACM, 2013. <a href=\"https://doi.org/10.1145/2463372.2463568\">https://doi.org/10.1145/2463372.2463568</a>.","mla":"Barton, Nicholas H., and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, ACM, 2013, pp. 1573–80, doi:<a href=\"https://doi.org/10.1145/2463372.2463568\">10.1145/2463372.2463568</a>.","ama":"Barton NH, Paixao T. Can quantitative and population genetics help us understand evolutionary computation? In: <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2013:1573-1580. doi:<a href=\"https://doi.org/10.1145/2463372.2463568\">10.1145/2463372.2463568</a>","apa":"Barton, N. H., &#38; Paixao, T. (2013). Can quantitative and population genetics help us understand evolutionary computation? In <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i> (pp. 1573–1580). Amsterdam, Netherlands: ACM. <a href=\"https://doi.org/10.1145/2463372.2463568\">https://doi.org/10.1145/2463372.2463568</a>"},"file":[{"checksum":"9d9be9090ce5c20766e0eb076ace5b98","creator":"system","date_updated":"2020-07-14T12:45:45Z","file_id":"5159","content_type":"application/pdf","file_size":475844,"date_created":"2018-12-12T10:15:38Z","access_level":"open_access","relation":"main_file","file_name":"IST-2016-564-v1+1_NickGECCO_2013_1_-1.pdf"}],"scopus_import":1,"corr_author":"1","day":"01","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:14Z","file_date_updated":"2020-07-14T12:45:45Z","author":[{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago"}],"status":"public","page":"1573 - 1580","date_published":"2013-07-01T00:00:00Z","ddc":["570"],"month":"07","publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","date_updated":"2024-10-09T20:55:12Z","type":"conference","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"has_accepted_license":"1","publisher":"ACM","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"year":"2013","abstract":[{"lang":"eng","text":"Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C."}],"pubrep_id":"564","conference":{"start_date":"2013-07-06","location":"Amsterdam, Netherlands","name":"GECCO: Genetic and evolutionary computation conference","end_date":"2013-07-10"},"ec_funded":1,"oa":1,"publication_status":"published","_id":"2718","title":"Can quantitative and population genetics help us understand evolutionary computation?","oa_version":"Submitted Version"},{"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"}],"scopus_import":1,"quality_controlled":"1","citation":{"ama":"Paixao T, Barton NH. A variance decomposition approach to the analysis of genetic algorithms. In: <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2013:845-852. doi:<a href=\"https://doi.org/10.1145/2463372.2463470\">10.1145/2463372.2463470</a>","apa":"Paixao, T., &#38; Barton, N. H. (2013). A variance decomposition approach to the analysis of genetic algorithms. In <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i> (pp. 845–852). Amsterdam, Netherlands: ACM. <a href=\"https://doi.org/10.1145/2463372.2463470\">https://doi.org/10.1145/2463372.2463470</a>","mla":"Paixao, Tiago, and Nicholas H. Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, ACM, 2013, pp. 845–52, doi:<a href=\"https://doi.org/10.1145/2463372.2463470\">10.1145/2463372.2463470</a>.","chicago":"Paixao, Tiago, and Nicholas H Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” In <i>Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation</i>, 845–52. ACM, 2013. <a href=\"https://doi.org/10.1145/2463372.2463470\">https://doi.org/10.1145/2463372.2463470</a>.","ista":"Paixao T, Barton NH. 2013. A variance decomposition approach to the analysis of genetic algorithms. Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 845–852.","short":"T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852.","ieee":"T. Paixao and N. H. Barton, “A variance decomposition approach to the analysis of genetic algorithms,” in <i>Proceedings of the 15th annual conference on Genetic and evolutionary computation</i>, Amsterdam, Netherlands, 2013, pp. 845–852."},"publist_id":"4173","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2463372.2463470","type":"conference","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"oa_version":"None","_id":"2719","date_updated":"2024-10-09T20:55:12Z","publication_status":"published","title":"A variance decomposition approach to the analysis of genetic algorithms","month":"07","date_published":"2013-07-01T00:00:00Z","ec_funded":1,"publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","status":"public","page":"845 - 852","author":[{"first_name":"Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"day":"01","date_created":"2018-12-11T11:59:15Z","language":[{"iso":"eng"}],"conference":{"start_date":"2013-07-06","location":"Amsterdam, Netherlands","end_date":"2013-07-10","name":"GECCO: Genetic and evolutionary computation conference"},"year":"2013","abstract":[{"text":"Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation.","lang":"eng"}],"corr_author":"1"},{"oa_version":"Submitted Version","title":"Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila","_id":"2720","publication_status":"published","oa":1,"ec_funded":1,"intvolume":"       195","pmid":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781978/"}],"abstract":[{"text":"Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is &lt;10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes.","lang":"eng"}],"year":"2013","project":[{"grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000325286200020"],"pmid":["23934880"]},"publisher":"Genetics Society of America","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"issue":"2","type":"journal_article","date_updated":"2025-09-29T14:08:19Z","publication":"Genetics","date_published":"2013-10-01T00:00:00Z","month":"10","page":"527-540","status":"public","author":[{"full_name":"Long, Hongan","first_name":"Hongan","last_name":"Long"},{"first_name":"Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago"},{"last_name":"Azevedo","first_name":"Ricardo","full_name":"Azevedo, Ricardo"},{"full_name":"Zufall, Rebecca","first_name":"Rebecca","last_name":"Zufall"}],"day":"01","date_created":"2018-12-11T11:59:15Z","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","isi":1,"volume":195,"quality_controlled":"1","citation":{"apa":"Long, H., Paixao, T., Azevedo, R., &#38; Zufall, R. (2013). Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.113.153536\">https://doi.org/10.1534/genetics.113.153536</a>","ama":"Long H, Paixao T, Azevedo R, Zufall R. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. <i>Genetics</i>. 2013;195(2):527-540. doi:<a href=\"https://doi.org/10.1534/genetics.113.153536\">10.1534/genetics.113.153536</a>","mla":"Long, Hongan, et al. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” <i>Genetics</i>, vol. 195, no. 2, Genetics Society of America, 2013, pp. 527–40, doi:<a href=\"https://doi.org/10.1534/genetics.113.153536\">10.1534/genetics.113.153536</a>.","chicago":"Long, Hongan, Tiago Paixao, Ricardo Azevedo, and Rebecca Zufall. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” <i>Genetics</i>. Genetics Society of America, 2013. <a href=\"https://doi.org/10.1534/genetics.113.153536\">https://doi.org/10.1534/genetics.113.153536</a>.","ista":"Long H, Paixao T, Azevedo R, Zufall R. 2013. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. 195(2), 527–540.","short":"H. Long, T. Paixao, R. Azevedo, R. Zufall, Genetics 195 (2013) 527–540.","ieee":"H. Long, T. Paixao, R. Azevedo, and R. Zufall, “Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila,” <i>Genetics</i>, vol. 195, no. 2. Genetics Society of America, pp. 527–540, 2013."},"publist_id":"4172","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1534/genetics.113.153536"},{"publication":"Journal of Statistical Physics","month":"07","date_published":"2013-07-18T00:00:00Z","page":"1003 - 1032","status":"public","department":[{"_id":"LaEr"}],"issue":"6","type":"journal_article","date_updated":"2025-09-29T14:07:43Z","corr_author":"1","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"full_name":"Farrell, Brendan","last_name":"Farrell","first_name":"Brendan"}],"day":"18","date_created":"2018-12-11T11:59:34Z","language":[{"iso":"eng"}],"article_processing_charge":"No","isi":1,"scopus_import":"1","publist_id":"4107","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1007/s10955-013-0807-8","volume":152,"quality_controlled":"1","citation":{"apa":"Erdös, L., &#38; Farrell, B. (2013). Local eigenvalue density for general MANOVA matrices. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-013-0807-8\">https://doi.org/10.1007/s10955-013-0807-8</a>","ama":"Erdös L, Farrell B. Local eigenvalue density for general MANOVA matrices. <i>Journal of Statistical Physics</i>. 2013;152(6):1003-1032. doi:<a href=\"https://doi.org/10.1007/s10955-013-0807-8\">10.1007/s10955-013-0807-8</a>","mla":"Erdös, László, and Brendan Farrell. “Local Eigenvalue Density for General MANOVA Matrices.” <i>Journal of Statistical Physics</i>, vol. 152, no. 6, Springer, 2013, pp. 1003–32, doi:<a href=\"https://doi.org/10.1007/s10955-013-0807-8\">10.1007/s10955-013-0807-8</a>.","chicago":"Erdös, László, and Brendan Farrell. “Local Eigenvalue Density for General MANOVA Matrices.” <i>Journal of Statistical Physics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10955-013-0807-8\">https://doi.org/10.1007/s10955-013-0807-8</a>.","ista":"Erdös L, Farrell B. 2013. Local eigenvalue density for general MANOVA matrices. Journal of Statistical Physics. 152(6), 1003–1032.","short":"L. Erdös, B. Farrell, Journal of Statistical Physics 152 (2013) 1003–1032.","ieee":"L. Erdös and B. Farrell, “Local eigenvalue density for general MANOVA matrices,” <i>Journal of Statistical Physics</i>, vol. 152, no. 6. Springer, pp. 1003–1032, 2013."},"oa":1,"intvolume":"       152","oa_version":"Preprint","title":"Local eigenvalue density for general MANOVA matrices","_id":"2782","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1207.0031","open_access":"1"}],"abstract":[{"lang":"eng","text":"We consider random n×n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are known as MANOVA matrices and which have joint eigenvalue density given by the third classical ensemble, the Jacobi ensemble. We show that, away from the spectral edge, the eigenvalue density converges to the limiting density of the Jacobi ensemble even on the shortest possible scales of order 1/n (up to log n factors). This result is the analogue of the local Wigner semicircle law and the local Marchenko-Pastur law for general MANOVA matrices."}],"year":"2013","arxiv":1,"external_id":{"arxiv":["1207.0031"],"isi":["000323203800001"]},"publisher":"Springer"},{"year":"2013","abstract":[{"text":"A novel Taylor-Couette system has been constructed for investigations of transitional as well as high Reynolds number turbulent flows in very large aspect ratios. The flexibility of the setup enables studies of a variety of problems regarding hydrodynamic instabilities and turbulence in rotating flows. The inner and outer cylinders and the top and bottom endplates can be rotated independently with rotation rates of up to 30 Hz, thereby covering five orders of magnitude in Reynolds numbers (Re = 101-106). The radius ratio can be easily changed, the highest realized one is η = 0.98 corresponding to an aspect ratio of 260 gap width in the vertical and 300 in the azimuthal direction. For η &lt; 0.98 the aspect ratio can be dynamically changed during measurements and complete transparency in the radial direction over the full length of the cylinders is provided by the usage of a precision glass inner cylinder. The temperatures of both cylinders are controlled independently. Overall this apparatus combines an unmatched variety in geometry, rotation rates, and temperatures, which is provided by a sophisticated high-precision bearing system. Possible applications are accurate studies of the onset of turbulence and spatio-temporal intermittent flow patterns in very large domains, transport processes of turbulence at high Re, the stability of Keplerian flows for different boundary conditions, and studies of baroclinic instabilities.","lang":"eng"}],"_id":"2806","publication_status":"published","title":"High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects","oa_version":"None","intvolume":"        84","article_number":"065106","publisher":"American Institute of Physics","external_id":{"isi":["000321273500052"]},"date_created":"2018-12-11T11:59:42Z","day":"06","language":[{"iso":"eng"}],"author":[{"first_name":"Kerstin","last_name":"Avila","full_name":"Avila, Kerstin"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"date_updated":"2025-09-29T14:07:11Z","type":"journal_article","issue":"6","department":[{"_id":"BjHo"}],"status":"public","month":"06","date_published":"2013-06-06T00:00:00Z","publication":"Review of Scientific Instruments","quality_controlled":"1","citation":{"chicago":"Avila, Kerstin, and Björn Hof. “High-Precision Taylor-Couette Experiment to Study Subcritical Transitions and the Role of Boundary Conditions and Size Effects.” <i>Review of Scientific Instruments</i>. American Institute of Physics, 2013. <a href=\"https://doi.org/10.1063/1.4807704\">https://doi.org/10.1063/1.4807704</a>.","ama":"Avila K, Hof B. High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. <i>Review of Scientific Instruments</i>. 2013;84(6). doi:<a href=\"https://doi.org/10.1063/1.4807704\">10.1063/1.4807704</a>","apa":"Avila, K., &#38; Hof, B. (2013). High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. <i>Review of Scientific Instruments</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4807704\">https://doi.org/10.1063/1.4807704</a>","mla":"Avila, Kerstin, and Björn Hof. “High-Precision Taylor-Couette Experiment to Study Subcritical Transitions and the Role of Boundary Conditions and Size Effects.” <i>Review of Scientific Instruments</i>, vol. 84, no. 6, 065106, American Institute of Physics, 2013, doi:<a href=\"https://doi.org/10.1063/1.4807704\">10.1063/1.4807704</a>.","ieee":"K. Avila and B. Hof, “High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects,” <i>Review of Scientific Instruments</i>, vol. 84, no. 6. American Institute of Physics, 2013.","ista":"Avila K, Hof B. 2013. High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects. Review of Scientific Instruments. 84(6), 065106.","short":"K. Avila, B. Hof, Review of Scientific Instruments 84 (2013)."},"volume":84,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1063/1.4807704","publist_id":"4081","scopus_import":"1","isi":1,"article_processing_charge":"No"},{"scopus_import":1,"file":[{"file_name":"IST-2016-533-v1+1_Extending_continuous_maps_polynomiality_and_undecidability.pdf","date_created":"2018-12-12T10:14:29Z","access_level":"open_access","relation":"main_file","file_id":"5081","content_type":"application/pdf","file_size":447945,"checksum":"06c2ce5c1135fbc1f71ca15eeb242dcf","creator":"system","date_updated":"2020-07-14T12:45:48Z"}],"quality_controlled":"1","citation":{"chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In <i>45th Annual ACM Symposium on Theory of Computing</i>, 595–604. ACM, 2013. <a href=\"https://doi.org/10.1145/2488608.2488683\">https://doi.org/10.1145/2488608.2488683</a>.","ama":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: <i>45th Annual ACM Symposium on Theory of Computing</i>. ACM; 2013:595-604. doi:<a href=\"https://doi.org/10.1145/2488608.2488683\">10.1145/2488608.2488683</a>","apa":"Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., &#38; Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In <i>45th Annual ACM Symposium on theory of computing</i> (pp. 595–604). Palo Alto, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2488608.2488683\">https://doi.org/10.1145/2488608.2488683</a>","mla":"Čadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.” <i>45th Annual ACM Symposium on Theory of Computing</i>, ACM, 2013, pp. 595–604, doi:<a href=\"https://doi.org/10.1145/2488608.2488683\">10.1145/2488608.2488683</a>.","ieee":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in <i>45th Annual ACM Symposium on theory of computing</i>, Palo Alto, CA, United States, 2013, pp. 595–604.","short":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.","ista":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604."},"doi":"10.1145/2488608.2488683","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4078","date_updated":"2021-01-12T06:59:51Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"has_accepted_license":"1","type":"conference","page":"595 - 604","status":"public","publication":"45th Annual ACM Symposium on theory of computing","month":"06","date_published":"2013-06-01T00:00:00Z","ddc":["510"],"file_date_updated":"2020-07-14T12:45:48Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:42Z","day":"01","author":[{"full_name":"Čadek, Martin","last_name":"Čadek","first_name":"Martin"},{"first_name":"Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"},{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"full_name":"Vokřínek, Lukáš","first_name":"Lukáš","last_name":"Vokřínek"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli"}],"publisher":"ACM","title":"Extending continuous maps: Polynomiality and undecidability","publication_status":"published","_id":"2807","oa_version":"Submitted Version","oa":1,"conference":{"end_date":"2013-06-04","name":"STOC: Symposium on the Theory of Computing","location":"Palo Alto, CA, United States","start_date":"2013-06-01"},"abstract":[{"text":"We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \\no holes up to dimension k-1&quot; (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. ","lang":"eng"}],"year":"2013","pubrep_id":"533"},{"external_id":{"pmid":["23669745"],"isi":["000321325700015"]},"publisher":"American Society of Plant Biologists","pmid":1,"oa":1,"intvolume":"       162","title":"The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain","publication_status":"published","_id":"2808","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In order to establish a reference for analysis of the function of auxin and the auxin biosynthesis regulators SHORT INTERNODE/ STYLISH (SHI/STY) during Physcomitrella patens reproductive development, we have described male (antheridial) and female (archegonial) development in detail, including temporal and positional information of organ initiation. This has allowed us to define discrete stages of organ morphogenesis and to show that reproductive organ development in P. patens is highly organized and that organ phyllotaxis differs between vegetative and reproductive development. Using the PpSHI1 and PpSHI2 reporter and knockout lines, the auxin reporters GmGH3pro:GUS and PpPINApro:GFP-GUS, and the auxin-conjugating transgene PpSHI2pro:IAAL, we could show that the PpSHI genes, and by inference also auxin, play important roles for reproductive organ development in moss. The PpSHI genes are required for the apical opening of the reproductive organs, the final differentiation of the egg cell, and the progression of canal cells into a cell death program. The apical cells of the archegonium, the canal cells, and the egg cell are also sites of auxin responsiveness and are affected by reduced levels of active auxin, suggesting that auxin mediates PpSHI function in the reproductive organs."}],"year":"2013","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3707547/","open_access":"1"}],"isi":1,"article_processing_charge":"No","scopus_import":"1","doi":"10.1104/pp.113.214023","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4079","volume":162,"quality_controlled":"1","citation":{"short":"K. Landberg, E. Pederson, T. Viaene, B. Bozorg, J. Friml, H. Jönsson, M. Thelander, E. Sundberg, Plant Physiology 162 (2013) 1406–1419.","ista":"Landberg K, Pederson E, Viaene T, Bozorg B, Friml J, Jönsson H, Thelander M, Sundberg E. 2013. The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. Plant Physiology. 162(3), 1406–1419.","ieee":"K. Landberg <i>et al.</i>, “The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain,” <i>Plant Physiology</i>, vol. 162, no. 3. American Society of Plant Biologists, pp. 1406–1419, 2013.","ama":"Landberg K, Pederson E, Viaene T, et al. The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. <i>Plant Physiology</i>. 2013;162(3):1406-1419. doi:<a href=\"https://doi.org/10.1104/pp.113.214023\">10.1104/pp.113.214023</a>","apa":"Landberg, K., Pederson, E., Viaene, T., Bozorg, B., Friml, J., Jönsson, H., … Sundberg, E. (2013). The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.113.214023\">https://doi.org/10.1104/pp.113.214023</a>","mla":"Landberg, Katarina, et al. “The Moss Physcomitrella Patens Reproductive Organ Development Is Highly Organized, Affected by the Two SHI/STY Genes and by the Level of Active Auxin in the SHI/STY Expression Domain.” <i>Plant Physiology</i>, vol. 162, no. 3, American Society of Plant Biologists, 2013, pp. 1406–19, doi:<a href=\"https://doi.org/10.1104/pp.113.214023\">10.1104/pp.113.214023</a>.","chicago":"Landberg, Katarina, Eric Pederson, Tom Viaene, Behruz Bozorg, Jiří Friml, Henrik Jönsson, Mattias Thelander, and Eva Sundberg. “The Moss Physcomitrella Patens Reproductive Organ Development Is Highly Organized, Affected by the Two SHI/STY Genes and by the Level of Active Auxin in the SHI/STY Expression Domain.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2013. <a href=\"https://doi.org/10.1104/pp.113.214023\">https://doi.org/10.1104/pp.113.214023</a>."},"page":"1406 - 1419","status":"public","publication":"Plant Physiology","date_published":"2013-07-03T00:00:00Z","month":"07","date_updated":"2025-09-29T14:06:13Z","department":[{"_id":"JiFr"}],"type":"journal_article","issue":"3","language":[{"iso":"eng"}],"day":"03","date_created":"2018-12-11T11:59:42Z","author":[{"full_name":"Landberg, Katarina","first_name":"Katarina","last_name":"Landberg"},{"full_name":"Pederson, Eric","last_name":"Pederson","first_name":"Eric"},{"last_name":"Viaene","first_name":"Tom","full_name":"Viaene, Tom"},{"full_name":"Bozorg, Behruz","last_name":"Bozorg","first_name":"Behruz"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"},{"last_name":"Jönsson","first_name":"Henrik","full_name":"Jönsson, Henrik"},{"full_name":"Thelander, Mattias","last_name":"Thelander","first_name":"Mattias"},{"last_name":"Sundberg","first_name":"Eva","full_name":"Sundberg, Eva"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1371/journal.pgen.1003580","publist_id":"4075","citation":{"ieee":"M. de Vos, F. Poelwijk, N. Battich, J. Ndika, and S. Tans, “Environmental dependence of genetic constraint,” <i>PLoS Genetics</i>, vol. 9, no. 6. Public Library of Science, 2013.","ista":"de Vos M, Poelwijk F, Battich N, Ndika J, Tans S. 2013. Environmental dependence of genetic constraint. PLoS Genetics. 9(6), e1003580.","short":"M. de Vos, F. Poelwijk, N. Battich, J. Ndika, S. Tans, PLoS Genetics 9 (2013).","chicago":"Vos, Marjon de, Frank Poelwijk, Nico Battich, Joseph Ndika, and Sander Tans. “Environmental Dependence of Genetic Constraint.” <i>PLoS Genetics</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pgen.1003580\">https://doi.org/10.1371/journal.pgen.1003580</a>.","mla":"de Vos, Marjon, et al. “Environmental Dependence of Genetic Constraint.” <i>PLoS Genetics</i>, vol. 9, no. 6, e1003580, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1003580\">10.1371/journal.pgen.1003580</a>.","ama":"de Vos M, Poelwijk F, Battich N, Ndika J, Tans S. Environmental dependence of genetic constraint. <i>PLoS Genetics</i>. 2013;9(6). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1003580\">10.1371/journal.pgen.1003580</a>","apa":"de Vos, M., Poelwijk, F., Battich, N., Ndika, J., &#38; Tans, S. (2013). Environmental dependence of genetic constraint. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1003580\">https://doi.org/10.1371/journal.pgen.1003580</a>"},"quality_controlled":"1","volume":9,"isi":1,"file":[{"file_name":"IST-2016-412-v1+1_journal.pgen.1003580.pdf","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:08:51Z","file_id":"4713","file_size":474655,"content_type":"application/pdf","creator":"system","checksum":"7a4736dd80496d29ff6908b6f2329b4e","date_updated":"2020-07-14T12:45:48Z"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:43Z","day":"27","file_date_updated":"2020-07-14T12:45:48Z","author":[{"full_name":"De Vos, Marjon","id":"3111FFAC-F248-11E8-B48F-1D18A9856A87","last_name":"De Vos","first_name":"Marjon"},{"full_name":"Poelwijk, Frank","first_name":"Frank","last_name":"Poelwijk"},{"full_name":"Battich, Nico","last_name":"Battich","first_name":"Nico"},{"full_name":"Ndika, Joseph","first_name":"Joseph","last_name":"Ndika"},{"last_name":"Tans","first_name":"Sander","full_name":"Tans, Sander"}],"status":"public","ddc":["570"],"month":"06","date_published":"2013-06-27T00:00:00Z","publication":"PLoS Genetics","date_updated":"2025-09-29T14:05:09Z","type":"journal_article","issue":"6","department":[{"_id":"ToBo"}],"has_accepted_license":"1","publisher":"Public Library of Science","article_number":"e1003580","external_id":{"isi":["000321222600053"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2013","abstract":[{"text":"The epistatic interactions that underlie evolutionary constraint have mainly been studied for constant external conditions. However, environmental changes may modulate epistasis and hence affect genetic constraints. Here we investigate genetic constraints in the adaptive evolution of a novel regulatory function in variable environments, using the lac repressor, LacI, as a model system. We have systematically reconstructed mutational trajectories from wild type LacI to three different variants that each exhibit an inverse response to the inducing ligand IPTG, and analyzed the higher-order interactions between genetic and environmental changes. We find epistasis to depend strongly on the environment. As a result, mutational steps essential to inversion but inaccessible by positive selection in one environment, become accessible in another. We present a graphical method to analyze the observed complex higher-order interactions between multiple mutations and environmental change, and show how the interactions can be explained by a combination of mutational effects on allostery and thermodynamic stability. This dependency of genetic constraint on the environment should fundamentally affect evolutionary dynamics and affects the interpretation of phylogenetic data.","lang":"eng"}],"pubrep_id":"412","intvolume":"         9","oa":1,"_id":"2810","publication_status":"published","title":"Environmental dependence of genetic constraint","oa_version":"Published Version"},{"month":"06","date_published":"2013-06-01T00:00:00Z","publication":"Proceedings of the 29th annual symposium on Computational Geometry","oa":1,"status":"public","page":"117 - 125","type":"conference","department":[{"_id":"HeEd"}],"oa_version":"Submitted Version","publication_status":"published","_id":"2812","date_updated":"2026-06-18T17:57:27Z","title":"Homological reconstruction and simplification in R3","main_file_link":[{"open_access":"1","url":"http://hal.archives-ouvertes.fr/hal-00833791/"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1805"}]},"year":"2013","acknowledgement":"Some of the authors were partially supported by the GIGA ANR grant (contract ANR-09-BLAN-0331-01) and the European project CG-Learning (contract 255827).","abstract":[{"text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H* (X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in ℝ3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard.","lang":"eng"}],"author":[{"full_name":"Attali, Dominique","last_name":"Attali","first_name":"Dominique"},{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich"},{"full_name":"Devillers, Olivier","last_name":"Devillers","first_name":"Olivier"},{"full_name":"Glisse, Marc","first_name":"Marc","last_name":"Glisse"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"}],"language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T11:59:44Z","conference":{"start_date":"2013-06-17","name":"SoCG: Symposium on Computational Geometry","end_date":"2013-06-20","location":"Rio de Janeiro, Brazil"},"scopus_import":1,"publist_id":"4072","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2462356.2462373","publisher":"ACM","quality_controlled":"1","citation":{"ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” in <i>Proceedings of the 29th annual symposium on Computational Geometry</i>, Rio de Janeiro, Brazil, 2013, pp. 117–125.","ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2013. Homological reconstruction and simplification in R3. Proceedings of the 29th annual symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 117–125.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, in:, Proceedings of the 29th Annual Symposium on Computational Geometry, ACM, 2013, pp. 117–125.","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” In <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>, 117–25. ACM, 2013. <a href=\"https://doi.org/10.1145/2462356.2462373\">https://doi.org/10.1145/2462356.2462373</a>.","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., &#38; Lieutier, A. (2013). Homological reconstruction and simplification in R3. In <i>Proceedings of the 29th annual symposium on Computational Geometry</i> (pp. 117–125). Rio de Janeiro, Brazil: ACM. <a href=\"https://doi.org/10.1145/2462356.2462373\">https://doi.org/10.1145/2462356.2462373</a>","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. In: <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>. ACM; 2013:117-125. doi:<a href=\"https://doi.org/10.1145/2462356.2462373\">10.1145/2462356.2462373</a>","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>, ACM, 2013, pp. 117–25, doi:<a href=\"https://doi.org/10.1145/2462356.2462373\">10.1145/2462356.2462373</a>."}},{"corr_author":"1","date_created":"2018-12-11T11:59:44Z","language":[{"iso":"eng"}],"day":"25","author":[{"first_name":"Devranjan","last_name":"Samanta","full_name":"Samanta, Devranjan"},{"last_name":"Dubief","first_name":"Yves","full_name":"Dubief, Yves"},{"first_name":"Markus","last_name":"Holzner","full_name":"Holzner, Markus"},{"full_name":"Schäfer, Christof","first_name":"Christof","last_name":"Schäfer"},{"first_name":"Alexander","last_name":"Morozov","full_name":"Morozov, Alexander"},{"full_name":"Wagner, Christian","first_name":"Christian","last_name":"Wagner"},{"orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"page":"10557 - 10562","status":"public","publication":"PNAS","month":"06","date_published":"2013-06-25T00:00:00Z","date_updated":"2025-09-29T14:03:43Z","department":[{"_id":"BjHo"}],"type":"journal_article","issue":"26","doi":"10.1073/pnas.1219666110","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4073","volume":110,"citation":{"ieee":"D. Samanta <i>et al.</i>, “Elasto-inertial turbulence,” <i>PNAS</i>, vol. 110, no. 26. National Academy of Sciences, pp. 10557–10562, 2013.","ista":"Samanta D, Dubief Y, Holzner M, Schäfer C, Morozov A, Wagner C, Hof B. 2013. Elasto-inertial turbulence. PNAS. 110(26), 10557–10562.","short":"D. Samanta, Y. Dubief, M. Holzner, C. Schäfer, A. Morozov, C. Wagner, B. Hof, PNAS 110 (2013) 10557–10562.","chicago":"Samanta, Devranjan, Yves Dubief, Markus Holzner, Christof Schäfer, Alexander Morozov, Christian Wagner, and Björn Hof. “Elasto-Inertial Turbulence.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1219666110\">https://doi.org/10.1073/pnas.1219666110</a>.","ama":"Samanta D, Dubief Y, Holzner M, et al. Elasto-inertial turbulence. <i>PNAS</i>. 2013;110(26):10557-10562. doi:<a href=\"https://doi.org/10.1073/pnas.1219666110\">10.1073/pnas.1219666110</a>","apa":"Samanta, D., Dubief, Y., Holzner, M., Schäfer, C., Morozov, A., Wagner, C., &#38; Hof, B. (2013). Elasto-inertial turbulence. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1219666110\">https://doi.org/10.1073/pnas.1219666110</a>","mla":"Samanta, Devranjan, et al. “Elasto-Inertial Turbulence.” <i>PNAS</i>, vol. 110, no. 26, National Academy of Sciences, 2013, pp. 10557–62, doi:<a href=\"https://doi.org/10.1073/pnas.1219666110\">10.1073/pnas.1219666110</a>."},"quality_controlled":"1","isi":1,"article_processing_charge":"No","scopus_import":"1","abstract":[{"text":"Turbulence is ubiquitous in nature, yet even for the case of ordinary Newtonian fluids like water, our understanding of this phenomenon is limited. Many liquids of practical importance are more complicated (e.g., blood, polymer melts, paints), however; they exhibit elastic as well as viscous characteristics, and the relation between stress and strain is nonlinear. We demonstrate here for a model system of such complex fluids that at high shear rates, turbulence is not simply modified as previously believed but is suppressed and replaced by a different type of disordered motion, elasto-inertial turbulence. Elasto-inertial turbulence is found to occur at much lower Reynolds numbers than Newtonian turbulence, and the dynamical properties differ significantly. The friction scaling observed coincides with the so-called &quot;maximum drag reduction&quot; asymptote, which is exhibited by a wide range of viscoelastic fluids.","lang":"eng"}],"year":"2013","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3696777/","open_access":"1"}],"pmid":1,"oa":1,"intvolume":"       110","title":"Elasto-inertial turbulence","publication_status":"published","_id":"2813","oa_version":"Submitted Version","publisher":"National Academy of Sciences","external_id":{"pmid":["23757498"],"isi":["000321503700035"]}},{"publisher":"World Scientific Publishing","external_id":{"arxiv":["0804.4525"],"isi":["000319838100002"]},"project":[{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/0804.4525","open_access":"1"}],"year":"2013","abstract":[{"lang":"eng","text":"We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing &quot;reset&quot; action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies. We also discuss the memory requirement for deterministic strategies and extensions of our results to other models, such as pushdown systems and timed systems."}],"arxiv":1,"intvolume":"        24","oa":1,"ec_funded":1,"oa_version":"Preprint","publication_status":"published","_id":"2814","title":"The complexity of coverage","publist_id":"4070","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1142/S0129054113400066","quality_controlled":"1","citation":{"ieee":"K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” <i>International Journal of Foundations of Computer Science</i>, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.","short":"K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185.","ista":"Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185.","chicago":"Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2013. <a href=\"https://doi.org/10.1142/S0129054113400066\">https://doi.org/10.1142/S0129054113400066</a>.","apa":"Chatterjee, K., Alfaro, L., &#38; Majumdar, R. (2013). The complexity of coverage. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054113400066\">https://doi.org/10.1142/S0129054113400066</a>","ama":"Chatterjee K, Alfaro L, Majumdar R. The complexity of coverage. <i>International Journal of Foundations of Computer Science</i>. 2013;24(2):165-185. doi:<a href=\"https://doi.org/10.1142/S0129054113400066\">10.1142/S0129054113400066</a>","mla":"Chatterjee, Krishnendu, et al. “The Complexity of Coverage.” <i>International Journal of Foundations of Computer Science</i>, vol. 24, no. 2, World Scientific Publishing, 2013, pp. 165–85, doi:<a href=\"https://doi.org/10.1142/S0129054113400066\">10.1142/S0129054113400066</a>."},"volume":24,"article_processing_charge":"No","isi":1,"scopus_import":"1","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Alfaro","first_name":"Luca","full_name":"Alfaro, Luca"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:44Z","day":"01","date_published":"2013-02-01T00:00:00Z","month":"02","publication":"International Journal of Foundations of Computer Science","status":"public","page":"165 - 185","type":"journal_article","issue":"2","department":[{"_id":"KrCh"}],"date_updated":"2025-09-29T14:02:41Z"},{"intvolume":"        49","oa":1,"oa_version":"Published Version","_id":"2815","publication_status":"published","title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","main_file_link":[{"url":"https://doi.org/10.1007/s00454-013-9517-x","open_access":"1"}],"year":"2013","abstract":[{"text":"The fact that a sum of isotropic Gaussian kernels can have more modes than kernels is surprising. Extra (ghost) modes do not exist in ℝ1 and are generally not well studied in higher dimensions. We study a configuration of n+1 Gaussian kernels for which there are exactly n+2 modes. We show that all modes lie on a finite set of lines, which we call axes, and study the restriction of the Gaussian mixture to these axes in order to discover that there are an exponential number of critical points in this configuration. Although the existence of ghost modes remained unknown due to the difficulty of finding examples in ℝ2, we show that the resilience of ghost modes grows like the square root of the dimension. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes.","lang":"eng"}],"external_id":{"isi":["000320672400005"]},"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"publisher":"Springer","month":"06","ddc":["500"],"date_published":"2013-06-01T00:00:00Z","publication":"Discrete & Computational Geometry","status":"public","page":"797 - 822","type":"journal_article","issue":"4","department":[{"_id":"HeEd"}],"date_updated":"2026-06-18T18:35:33Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3134"}]},"article_type":"original","corr_author":"1","acknowledgement":"This research is partially supported by the National Science Foundation (NSF) under Grant DBI-0820624, by the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fasy","id":"F65D502E-E68D-11E9-9252-C644099818F6","first_name":"Brittany Terese","full_name":"Fasy, Brittany Terese"},{"full_name":"Rote, Günter","last_name":"Rote","first_name":"Günter"}],"date_created":"2018-12-11T11:59:44Z","day":"01","language":[{"iso":"eng"}],"article_processing_charge":"No","isi":1,"scopus_import":"1","publist_id":"3991","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s00454-013-9517-x","citation":{"ieee":"H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” <i>Discrete &#38; Computational Geometry</i>, vol. 49, no. 4. Springer, pp. 797–822, 2013.","short":"H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete &#38; Computational Geometry 49 (2013) 797–822.","ista":"Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &#38; Computational Geometry. 49(4), 797–822.","chicago":"Edelsbrunner, Herbert, Brittany Terese Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00454-013-9517-x\">https://doi.org/10.1007/s00454-013-9517-x</a>.","mla":"Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Discrete &#38; Computational Geometry</i>, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi:<a href=\"https://doi.org/10.1007/s00454-013-9517-x\">10.1007/s00454-013-9517-x</a>.","ama":"Edelsbrunner H, Fasy BT, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. <i>Discrete &#38; Computational Geometry</i>. 2013;49(4):797-822. doi:<a href=\"https://doi.org/10.1007/s00454-013-9517-x\">10.1007/s00454-013-9517-x</a>","apa":"Edelsbrunner, H., Fasy, B. T., &#38; Rote, G. (2013). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-013-9517-x\">https://doi.org/10.1007/s00454-013-9517-x</a>"},"quality_controlled":"1","volume":49}]