[{"article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"issn":["0027-8424"]},"issue":"18","publisher":"National Academy of Sciences","citation":{"ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. <i>PNAS</i>. 2017;114(18):4715-4720. doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:<a href=\"https://doi.org/10.1073/pnas.1621239114\">10.1073/pnas.1621239114</a>.","chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>.","apa":"Hilbe, C., Martinez, V., Chatterjee, K., &#38; Nowak, M. (2017). Memory-n strategies of direct reciprocity. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1621239114\">https://doi.org/10.1073/pnas.1621239114</a>","ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” <i>PNAS</i>, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720."},"department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"       114","date_published":"2017-05-02T00:00:00Z","quality_controlled":"1","day":"02","doi":"10.1073/pnas.1621239114","oa":1,"type":"journal_article","pmid":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"corr_author":"1","scopus_import":"1","status":"public","title":"Memory-n strategies of direct reciprocity","publication":"PNAS","language":[{"iso":"eng"}],"_id":"671","month":"05","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"full_name":"Martinez, Vaquero","first_name":"Vaquero","last_name":"Martinez"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"publication_status":"published","date_updated":"2025-09-10T14:28:19Z","year":"2017","volume":114,"isi":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"}],"page":"4715 - 4720","publist_id":"7053","ec_funded":1,"abstract":[{"text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.","lang":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:47:50Z","external_id":{"pmid":["28420786"],"isi":["000400358000050"]}},{"day":"02","quality_controlled":"1","date_published":"2017-05-02T00:00:00Z","intvolume":"        19","publisher":"Cell Press","issue":"5","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ama":"Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. 2017;19(5):902-909. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>","short":"K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.","mla":"Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">10.1016/j.celrep.2017.04.027</a>.","ista":"Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.","ieee":"K. Vaahtomeri <i>et al.</i>, “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” <i>Cell Reports</i>, vol. 19, no. 5. Cell Press, pp. 902–909, 2017.","chicago":"Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>.","apa":"Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.027\">https://doi.org/10.1016/j.celrep.2017.04.027</a>"},"publication_identifier":{"issn":["2211-1247"]},"pubrep_id":"900","article_processing_charge":"Yes","has_accepted_license":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"corr_author":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:38Z","oa":1,"doi":"10.1016/j.celrep.2017.04.027","ddc":["570"],"publication_status":"published","date_updated":"2025-09-10T14:27:34Z","author":[{"id":"368EE576-F248-11E8-B48F-1D18A9856A87","last_name":"Vaahtomeri","first_name":"Kari","orcid":"0000-0001-7829-3518","full_name":"Vaahtomeri, Kari"},{"last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","full_name":"Brown, Markus"},{"orcid":"0000-0001-9843-3522","first_name":"Robert","full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ingrid","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"De Vries"},{"last_name":"Leithner","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1073-744X","first_name":"Alexander F","full_name":"Leithner, Alexander F"},{"id":"3C23B994-F248-11E8-B48F-1D18A9856A87","last_name":"Mehling","full_name":"Mehling, Matthias","first_name":"Matthias","orcid":"0000-0001-8599-1226"},{"first_name":"Walter","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","last_name":"Kaufmann"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"month":"05","_id":"672","language":[{"iso":"eng"}],"publication":"Cell Reports","file":[{"file_id":"5109","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf","file_size":2248814,"checksum":"8fdddaab1f1d76a6ec9ca94dcb6b07a2","date_created":"2018-12-12T10:14:54Z","date_updated":"2020-07-14T12:47:38Z"}],"scopus_import":"1","status":"public","title":"Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia","external_id":{"isi":["000402124100002"]},"date_created":"2018-12-11T11:47:50Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration."}],"ec_funded":1,"page":"902 - 909","publist_id":"7052","year":"2017","isi":1,"volume":19,"project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes","call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556"},{"grant_number":"Y 564-B12","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Cytoskeletal force generation and force transduction of migrating leukocytes"}]},{"citation":{"apa":"Mondelli, M., Hassani, S. H., &#38; Urbanke, R. (2017). Construction of polar codes with sublinear complexity. In <i>2017 IEEE International Symposium on Information Theory </i> (pp. 1853–1857). Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” in <i>2017 IEEE International Symposium on Information Theory </i>, Aachen, Germany, 2017, pp. 1853–1857.","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” In <i>2017 IEEE International Symposium on Information Theory </i>, 1853–57. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006850\">https://doi.org/10.1109/isit.2017.8006850</a>.","ista":"Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with sublinear complexity. 2017 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1853–1857.","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” <i>2017 IEEE International Symposium on Information Theory </i>, IEEE, 2017, pp. 1853–57, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, in:, 2017 IEEE International Symposium on Information Theory , IEEE, 2017, pp. 1853–1857.","ama":"Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear complexity. In: <i>2017 IEEE International Symposium on Information Theory </i>. IEEE; 2017:1853-1857. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006850\">10.1109/isit.2017.8006850</a>"},"_id":"6729","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","language":[{"iso":"eng"}],"publication":"2017 IEEE International Symposium on Information Theory ","publication_identifier":{"isbn":["9781509040964"],"eissn":["2157-8117"]},"extern":"1","title":"Construction of polar codes with sublinear complexity","status":"public","arxiv":1,"day":"15","date_updated":"2023-02-23T12:49:08Z","publication_status":"published","quality_controlled":"1","date_published":"2017-06-15T00:00:00Z","author":[{"last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","full_name":"Mondelli, Marco"},{"first_name":"S. Hamed","full_name":"Hassani, S. Hamed","last_name":"Hassani"},{"first_name":"Rudiger","full_name":"Urbanke, Rudiger","last_name":"Urbanke"}],"month":"06","abstract":[{"text":"Consider the problem of constructing a polar code of block length N for the transmission over a given channel W. Typically this requires to compute the reliability of all the N synthetic channels and then to include those that are sufficiently reliable. However, we know from [1], [2] that there is a partial order among the synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order [1], [2], we can construct a polar code by computing the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists in reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general and it can be used to further improve the complexity of the construction problem in case a new partial order on the synthetic channels of polar codes is discovered.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.05295"}],"conference":{"location":"Aachen, Germany","end_date":"2017-06-30","name":"ISIT: International Symposium on Information Theory","start_date":"2017-06-25"},"type":"conference","page":"1853-1857","year":"2017","oa":1,"doi":"10.1109/isit.2017.8006850","external_id":{"arxiv":["1612.05295"]},"related_material":{"record":[{"id":"6663","relation":"later_version","status":"public"}]},"date_created":"2019-07-30T07:14:18Z","oa_version":"Preprint"},{"article_type":"original","title":"Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow","scopus_import":"1","status":"public","_id":"673","language":[{"iso":"eng"}],"publication":"Physical Review E","month":"05","author":[{"orcid":"0000-0001-5964-0203","first_name":"Sebastian","full_name":"Altmeyer, Sebastian","last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lueptow, Richard","first_name":"Richard","last_name":"Lueptow"}],"OA_type":"closed access","date_updated":"2025-09-10T14:26:12Z","publication_status":"published","volume":95,"isi":1,"year":"2017","abstract":[{"text":"We present a numerical study of wavy supercritical cylindrical Couette flow between counter-rotating cylinders in which the wavy pattern propagates either prograde with the inner cylinder or retrograde opposite the rotation of the inner cylinder. The wave propagation reversals from prograde to retrograde and vice versa occur at distinct values of the inner cylinder Reynolds number when the associated frequency of the wavy instability vanishes. The reversal occurs for both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation reversal only occurs for sufficiently strong counter-rotation. The flow pattern reversal appears to be intrinsic in the system as either periodic boundary conditions or fixed end wall boundary conditions for different system sizes always result in the wave propagation reversal. We present a detailed bifurcation sequence and parameter space diagram with respect to retrograde behavior of wavy flows. The retrograde propagation of the instability occurs when the inner Reynolds number is about two times the outer Reynolds number. The mechanism for the retrograde propagation is associated with the inviscidly unstable region near the inner cylinder and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal behavior, global mean angular velocity, and torque of the flow with the wavy pattern are explored.","lang":"eng"}],"publist_id":"7049","oa_version":"None","date_created":"2018-12-11T11:47:50Z","external_id":{"isi":["000401233900007"],"pmid":["28618504"]},"publication_identifier":{"issn":["2470-0045"]},"article_processing_charge":"No","department":[{"_id":"BjHo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>, vol. 95, no. 5, 053103, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>.","ista":"Altmeyer S, Lueptow R. 2017. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. Physical Review E. 95(5), 053103.","chicago":"Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review E</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>.","ieee":"S. Altmeyer and R. Lueptow, “Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow,” <i>Physical Review E</i>, vol. 95, no. 5. American Physical Society, 2017.","apa":"Altmeyer, S., &#38; Lueptow, R. (2017). Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">https://doi.org/10.1103/PhysRevE.95.053103</a>","ama":"Altmeyer S, Lueptow R. Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. 2017;95(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.053103\">10.1103/PhysRevE.95.053103</a>","short":"S. Altmeyer, R. Lueptow, Physical Review E 95 (2017)."},"issue":"5","publisher":"American Physical Society","date_published":"2017-05-10T00:00:00Z","intvolume":"        95","day":"10","quality_controlled":"1","doi":"10.1103/PhysRevE.95.053103","type":"journal_article","pmid":1,"corr_author":"1","article_number":"053103"},{"language":[{"iso":"eng"}],"publication":"IEEE Transactions on Information Theory","_id":"6730","status":"public","title":"Reed–Muller codes achieve capacity on erasure channels","extern":"1","publication_status":"published","date_updated":"2021-01-12T08:08:43Z","author":[{"full_name":"Kudekar, Shrinivas","first_name":"Shrinivas","last_name":"Kudekar"},{"last_name":"Kumar","full_name":"Kumar, Santhosh","first_name":"Santhosh"},{"last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","first_name":"Marco"},{"last_name":"Pfister","full_name":"Pfister, Henry D.","first_name":"Henry D."},{"first_name":"Eren","full_name":"Sasoglu, Eren","last_name":"Sasoglu"},{"last_name":"Urbanke","full_name":"Urbanke, Ridiger L.","first_name":"Ridiger L."}],"month":"07","page":"4298-4316","abstract":[{"lang":"eng","text":"We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance. An important consequence of this result is that a sequence of Reed-Muller codes with increasing block length and converging rate achieves capacity. This possibility has been suggested previously in the literature but it has only been proven for cases where the limiting code rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves, in the affirmative, the existence question for capacity-achieving sequences of binary cyclic codes. The primary tools used in the proof are the sharp threshold property for symmetric monotone Boolean functions and the area theorem for extrinsic information transfer functions."}],"year":"2017","volume":63,"external_id":{"arxiv":["1601.04689"]},"date_created":"2019-07-30T07:18:11Z","oa_version":"Preprint","publisher":"IEEE","issue":"7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kudekar, Shrinivas, et al. “Reed–Muller Codes Achieve Capacity on Erasure Channels.” <i>IEEE Transactions on Information Theory</i>, vol. 63, no. 7, IEEE, 2017, pp. 4298–316, doi:<a href=\"https://doi.org/10.1109/tit.2017.2673829\">10.1109/tit.2017.2673829</a>.","apa":"Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., &#38; Urbanke, R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2017.2673829\">https://doi.org/10.1109/tit.2017.2673829</a>","chicago":"Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, and Ridiger L. Urbanke. “Reed–Muller Codes Achieve Capacity on Erasure Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/tit.2017.2673829\">https://doi.org/10.1109/tit.2017.2673829</a>.","ieee":"S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke, “Reed–Muller codes achieve capacity on erasure channels,” <i>IEEE Transactions on Information Theory</i>, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.","ista":"Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. 2017. Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. 63(7), 4298–4316.","ama":"Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. Reed–Muller codes achieve capacity on erasure channels. <i>IEEE Transactions on Information Theory</i>. 2017;63(7):4298-4316. doi:<a href=\"https://doi.org/10.1109/tit.2017.2673829\">10.1109/tit.2017.2673829</a>","short":"S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, E. Sasoglu, R.L. Urbanke, IEEE Transactions on Information Theory 63 (2017) 4298–4316."},"publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"quality_controlled":"1","day":"01","arxiv":1,"intvolume":"        63","date_published":"2017-07-01T00:00:00Z","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1601.04689","open_access":"1"}],"doi":"10.1109/tit.2017.2673829","oa":1},{"date_published":"2017-05-04T00:00:00Z","author":[{"orcid":"0000-0002-3242-7020","first_name":"Marco","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"full_name":"Maric, Ivana","first_name":"Ivana","last_name":"Maric"},{"first_name":"Dennis","full_name":"Hui, Dennis","last_name":"Hui"},{"last_name":"Hong","full_name":"Hong, Song-Nam","first_name":"Song-Nam"}],"month":"05","day":"04","arxiv":1,"publication_status":"published","quality_controlled":"1","date_updated":"2021-01-12T08:08:43Z","publication_identifier":{"isbn":["9781509059089"]},"extern":"1","status":"public","title":"Capacity-achieving rate-compatible polar codes for general channels","publisher":"IEEE","_id":"6731","citation":{"mla":"Mondelli, Marco, et al. “Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>, 7919107, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">10.1109/wcncw.2017.7919107</a>.","ista":"Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. 2017. Capacity-achieving rate-compatible polar codes for general channels. 2017 IEEE Wireless Communications and Networking Conference Workshops . WCNCW: Wireless communications and networking conference workshops, 7919107.","ieee":"M. Mondelli, H. Hassani, I. Maric, D. Hui, and S.-N. Hong, “Capacity-achieving rate-compatible polar codes for general channels,” in <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>, San Francisco, CA, USA, 2017.","apa":"Mondelli, M., Hassani, H., Maric, I., Hui, D., &#38; Hong, S.-N. (2017). Capacity-achieving rate-compatible polar codes for general channels. In <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. San Francisco, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">https://doi.org/10.1109/wcncw.2017.7919107</a>","chicago":"Mondelli, Marco, Hamed Hassani, Ivana Maric, Dennis Hui, and Song-Nam Hong. “Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” In <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">https://doi.org/10.1109/wcncw.2017.7919107</a>.","ama":"Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. Capacity-achieving rate-compatible polar codes for general channels. In: <i>2017 IEEE Wireless Communications and Networking Conference Workshops </i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/wcncw.2017.7919107\">10.1109/wcncw.2017.7919107</a>","short":"M. Mondelli, H. Hassani, I. Maric, D. Hui, S.-N. Hong, in:, 2017 IEEE Wireless Communications and Networking Conference Workshops , IEEE, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"2017 IEEE Wireless Communications and Networking Conference Workshops ","language":[{"iso":"eng"}],"oa_version":"Preprint","external_id":{"arxiv":["1611.01199"]},"date_created":"2019-07-31T05:56:58Z","article_number":"7919107","year":"2017","oa":1,"doi":"10.1109/wcncw.2017.7919107","conference":{"location":"San Francisco, CA, USA","end_date":"2017-03-22","name":"WCNCW: Wireless communications and networking conference workshops","start_date":"2017-03-19"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.01199"}],"abstract":[{"text":"We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of universal polar codes. Our scheme possesses the usual attractive features of polar codes: low complexity code construction, encoding, and decoding; super-polynomial scaling of the error probability with the block length; and absence of error floors. On the negative side, the scaling of the gap to capacity with the block length is slower than in standard polar codes, and we prove an upper bound on the scaling exponent.","lang":"eng"}],"type":"conference"},{"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y 564-B12","call_identifier":"FWF","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425"}],"volume":27,"isi":1,"year":"2017","publist_id":"7050","page":"1314 - 1325","ec_funded":1,"abstract":[{"lang":"eng","text":"Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo."}],"oa_version":"None","external_id":{"isi":["000400741700021"]},"date_created":"2018-12-11T11:47:51Z","title":"Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6","status":"public","scopus_import":"1","publication":"Current Biology","language":[{"iso":"eng"}],"_id":"674","author":[{"first_name":"Jan","full_name":"Schwarz, Jan","last_name":"Schwarz","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"id":"3FD04378-F248-11E8-B48F-1D18A9856A87","last_name":"Bierbaum","first_name":"Veronika","full_name":"Bierbaum, Veronika"},{"full_name":"Vaahtomeri, Kari","orcid":"0000-0001-7829-3518","first_name":"Kari","last_name":"Vaahtomeri","id":"368EE576-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","first_name":"Robert"},{"last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","full_name":"Brown, Markus"},{"first_name":"Ingrid","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"De Vries"},{"full_name":"Leithner, Alexander F","first_name":"Alexander F","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner"},{"last_name":"Reversat","id":"35B76592-F248-11E8-B48F-1D18A9856A87","full_name":"Reversat, Anne","orcid":"0000-0003-0666-8928","first_name":"Anne"},{"first_name":"Jack","orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","last_name":"Merrin"},{"first_name":"Teresa","full_name":"Tarrant, Teresa","last_name":"Tarrant"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","full_name":"Bollenbach, Tobias","first_name":"Tobias","orcid":"0000-0003-4398-476X"},{"full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"}],"month":"05","date_updated":"2025-09-10T14:26:47Z","publication_status":"published","doi":"10.1016/j.cub.2017.04.004","type":"journal_article","corr_author":"1","article_processing_charge":"No","publication_identifier":{"issn":["09609822"]},"citation":{"mla":"Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current Biology</i>, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:<a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">10.1016/j.cub.2017.04.004</a>.","chicago":"Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">https://doi.org/10.1016/j.cub.2017.04.004</a>.","ieee":"J. Schwarz <i>et al.</i>, “Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6,” <i>Current Biology</i>, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.","apa":"Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries, I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">https://doi.org/10.1016/j.cub.2017.04.004</a>","ista":"Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.","ama":"Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current Biology</i>. 2017;27(9):1314-1325. doi:<a href=\"https://doi.org/10.1016/j.cub.2017.04.004\">10.1016/j.cub.2017.04.004</a>","short":"J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries, A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt, Current Biology 27 (2017) 1314–1325."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"NanoFab"}],"issue":"9","publisher":"Cell Press","intvolume":"        27","date_published":"2017-05-09T00:00:00Z","quality_controlled":"1","day":"09"},{"external_id":{"isi":["000401424900016"]},"date_created":"2018-12-11T11:47:51Z","oa_version":"None","abstract":[{"text":"We report the enhancement of infrared absorption of chemisorbed carbon monoxide on platinum in the gap of plasmonic nanoantennas. Our method is based on the self-assembled formation of platinum nanoislands on nanoscopic dipole antenna arrays manufactured via electron beam lithography. We employ systematic variations of the plasmonic antenna resonance to precisely couple to the molecular stretch vibration of carbon monoxide adsorbed on the platinum nanoislands. Ultimately, we reach more than 1500-fold infrared absorption enhancements, allowing for an ultrasensitive detection of a monolayer of chemisorbed carbon monoxide. The developed procedure can be adapted to other metal adsorbents and molecular species and could be utilized for coverage sensing in surface catalytic reactions. ","lang":"eng"}],"publist_id":"7048","page":"1931 - 1934","isi":1,"volume":42,"year":"2017","ddc":["530"],"date_updated":"2025-09-10T14:25:19Z","publication_status":"published","author":[{"full_name":"Haase, Johannes","first_name":"Johannes","last_name":"Haase"},{"last_name":"Bagiante","id":"38ED402E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0122-9603","first_name":"Salvatore","full_name":"Bagiante, Salvatore"},{"first_name":"Hans","full_name":"Sigg, Hans","last_name":"Sigg"},{"full_name":"Van Bokhoven, Jeroen","first_name":"Jeroen","last_name":"Van Bokhoven"}],"month":"05","_id":"675","language":[{"iso":"eng"}],"publication":"Optics Letters","article_type":"original","title":"Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas","status":"public","scopus_import":"1","type":"journal_article","doi":"10.1364/OL.42.001931","day":"15","quality_controlled":"1","date_published":"2017-05-15T00:00:00Z","intvolume":"        42","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"NanoFab"}],"citation":{"short":"J. Haase, S. Bagiante, H. Sigg, J. Van Bokhoven, Optics Letters 42 (2017) 1931–1934.","ama":"Haase J, Bagiante S, Sigg H, Van Bokhoven J. Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. <i>Optics Letters</i>. 2017;42(10):1931-1934. doi:<a href=\"https://doi.org/10.1364/OL.42.001931\">10.1364/OL.42.001931</a>","ista":"Haase J, Bagiante S, Sigg H, Van Bokhoven J. 2017. Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. Optics Letters. 42(10), 1931–1934.","chicago":"Haase, Johannes, Salvatore Bagiante, Hans Sigg, and Jeroen Van Bokhoven. “Surface Enhanced Infrared Absorption of Chemisorbed Carbon Monoxide Using Plasmonic Nanoantennas.” <i>Optics Letters</i>. Optica Publishing Group, 2017. <a href=\"https://doi.org/10.1364/OL.42.001931\">https://doi.org/10.1364/OL.42.001931</a>.","apa":"Haase, J., Bagiante, S., Sigg, H., &#38; Van Bokhoven, J. (2017). Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OL.42.001931\">https://doi.org/10.1364/OL.42.001931</a>","ieee":"J. Haase, S. Bagiante, H. Sigg, and J. Van Bokhoven, “Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas,” <i>Optics Letters</i>, vol. 42, no. 10. Optica Publishing Group, pp. 1931–1934, 2017.","mla":"Haase, Johannes, et al. “Surface Enhanced Infrared Absorption of Chemisorbed Carbon Monoxide Using Plasmonic Nanoantennas.” <i>Optics Letters</i>, vol. 42, no. 10, Optica Publishing Group, 2017, pp. 1931–34, doi:<a href=\"https://doi.org/10.1364/OL.42.001931\">10.1364/OL.42.001931</a>."},"publisher":"Optica Publishing Group","issue":"10","article_processing_charge":"No"},{"external_id":{"isi":["000402125100002"]},"date_created":"2018-12-11T11:47:52Z","oa_version":"Published Version","abstract":[{"text":"The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR.","lang":"eng"}],"page":"1294 - 1303","publist_id":"7046","year":"2017","volume":19,"isi":1,"ddc":["570"],"publication_status":"published","date_updated":"2025-09-10T14:23:55Z","author":[{"last_name":"Lademann","first_name":"Claudio","full_name":"Lademann, Claudio"},{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","last_name":"Renkawitz","full_name":"Renkawitz, Jörg","first_name":"Jörg","orcid":"0000-0003-2856-3369"},{"last_name":"Pfander","full_name":"Pfander, Boris","first_name":"Boris"},{"last_name":"Jentsch","first_name":"Stefan","full_name":"Jentsch, Stefan"}],"month":"05","_id":"677","language":[{"iso":"eng"}],"publication":"Cell Reports","file":[{"file_name":"IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5171","creator":"system","date_updated":"2020-07-14T12:47:40Z","date_created":"2018-12-12T10:15:48Z","checksum":"efc7287d9c6354983cb151880e9ad72a","file_size":3005610}],"scopus_import":"1","status":"public","title":"The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"type":"journal_article","file_date_updated":"2020-07-14T12:47:40Z","oa":1,"doi":"10.1016/j.celrep.2017.04.051","day":"16","quality_controlled":"1","date_published":"2017-05-16T00:00:00Z","intvolume":"        19","publisher":"Cell Press","issue":"7","citation":{"mla":"Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” <i>Cell Reports</i>, vol. 19, no. 7, Cell Press, 2017, pp. 1294–303, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">10.1016/j.celrep.2017.04.051</a>.","chicago":"Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">https://doi.org/10.1016/j.celrep.2017.04.051</a>.","ieee":"C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination,” <i>Cell Reports</i>, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.","apa":"Lademann, C., Renkawitz, J., Pfander, B., &#38; Jentsch, S. (2017). The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">https://doi.org/10.1016/j.celrep.2017.04.051</a>","ista":"Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 19(7), 1294–1303.","ama":"Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. <i>Cell Reports</i>. 2017;19(7):1294-1303. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.04.051\">10.1016/j.celrep.2017.04.051</a>","short":"C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017) 1294–1303."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MiSi"}],"publication_identifier":{"issn":["2211-1247"]},"article_processing_charge":"No","pubrep_id":"899"},{"department":[{"_id":"CaHe"}],"citation":{"mla":"Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” <i>Nature Cell Biology</i>, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:<a href=\"https://doi.org/10.1038/ncb3524\">10.1038/ncb3524</a>.","ista":"Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development. Nature Cell Biology. 19(6), 581–588.","apa":"Petridou, N., Spiro, Z. P., &#38; Heisenberg, C.-P. J. (2017). Multiscale force sensing in development. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb3524\">https://doi.org/10.1038/ncb3524</a>","chicago":"Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale Force Sensing in Development.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncb3524\">https://doi.org/10.1038/ncb3524</a>.","ieee":"N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing in development,” <i>Nature Cell Biology</i>, vol. 19, no. 6. Nature Publishing Group, pp. 581–588, 2017.","ama":"Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development. <i>Nature Cell Biology</i>. 2017;19(6):581-588. doi:<a href=\"https://doi.org/10.1038/ncb3524\">10.1038/ncb3524</a>","short":"N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 581–588."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"6","publisher":"Nature Publishing Group","publication_identifier":{"issn":["1465-7392"]},"article_processing_charge":"No","day":"31","quality_controlled":"1","date_published":"2017-05-31T00:00:00Z","intvolume":"        19","type":"journal_article","doi":"10.1038/ncb3524","corr_author":"1","_id":"678","language":[{"iso":"eng"}],"publication":"Nature Cell Biology","title":"Multiscale force sensing in development","status":"public","scopus_import":"1","date_updated":"2025-09-10T14:23:21Z","publication_status":"published","author":[{"first_name":"Nicoletta","orcid":"0000-0002-8451-1195","full_name":"Petridou, Nicoletta","id":"2A003F6C-F248-11E8-B48F-1D18A9856A87","last_name":"Petridou"},{"last_name":"Spiro","id":"426AD026-F248-11E8-B48F-1D18A9856A87","first_name":"Zoltan P","full_name":"Spiro, Zoltan P"},{"orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"month":"05","abstract":[{"lang":"eng","text":"The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development."}],"publist_id":"7040","page":"581 - 588","volume":19,"isi":1,"project":[{"name":"The generation and function of anisotropic tissue tension in zebrafish epiboly","_id":"25236028-B435-11E9-9278-68D0E5697425","grant_number":"ALTF534-2016"}],"year":"2017","date_created":"2018-12-11T11:47:53Z","external_id":{"isi":["000402525200003"]},"oa_version":"None"},{"type":"journal_article","file_date_updated":"2020-07-14T12:47:40Z","doi":"10.1371/journal.pcbi.1005582","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"e1005582","has_accepted_license":"1","corr_author":"1","publisher":"Public Library of Science","issue":"6","citation":{"ista":"Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Sensory noise predicts divisive reshaping of receptive fields. PLoS Computational Biology. 13(6), e1005582.","chicago":"Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” <i>PLoS Computational Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">https://doi.org/10.1371/journal.pcbi.1005582</a>.","ieee":"M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Sensory noise predicts divisive reshaping of receptive fields,” <i>PLoS Computational Biology</i>, vol. 13, no. 6. Public Library of Science, 2017.","apa":"Chalk, M. J., Masset, P., Gutkin, B., &#38; Denève, S. (2017). Sensory noise predicts divisive reshaping of receptive fields. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">https://doi.org/10.1371/journal.pcbi.1005582</a>","mla":"Chalk, Matthew J., et al. “Sensory Noise Predicts Divisive Reshaping of Receptive Fields.” <i>PLoS Computational Biology</i>, vol. 13, no. 6, e1005582, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">10.1371/journal.pcbi.1005582</a>.","short":"M.J. Chalk, P. Masset, B. Gutkin, S. Denève, PLoS Computational Biology 13 (2017).","ama":"Chalk MJ, Masset P, Gutkin B, Denève S. Sensory noise predicts divisive reshaping of receptive fields. <i>PLoS Computational Biology</i>. 2017;13(6). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005582\">10.1371/journal.pcbi.1005582</a>"},"department":[{"_id":"GaTk"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","pubrep_id":"898","publication_identifier":{"issn":["1553-734X"]},"quality_controlled":"1","day":"01","intvolume":"        13","date_published":"2017-06-01T00:00:00Z","publist_id":"7035","abstract":[{"text":"In order to respond reliably to specific features of their environment, sensory neurons need to integrate multiple incoming noisy signals. Crucially, they also need to compete for the interpretation of those signals with other neurons representing similar features. The form that this competition should take depends critically on the noise corrupting these signals. In this study we show that for the type of noise commonly observed in sensory systems, whose variance scales with the mean signal, sensory neurons should selectively divide their input signals by their predictions, suppressing ambiguous cues while amplifying others. Any change in the stimulus context alters which inputs are suppressed, leading to a deep dynamic reshaping of neural receptive fields going far beyond simple surround suppression. Paradoxically, these highly variable receptive fields go alongside and are in fact required for an invariant representation of external sensory features. In addition to offering a normative account of context-dependent changes in sensory responses, perceptual inference in the presence of signal-dependent noise accounts for ubiquitous features of sensory neurons such as divisive normalization, gain control and contrast dependent temporal dynamics.","lang":"eng"}],"year":"2017","volume":13,"isi":1,"external_id":{"isi":["000404565400034"]},"related_material":{"record":[{"relation":"research_data","id":"9855","status":"public"}]},"date_created":"2018-12-11T11:47:53Z","oa_version":"Published Version","language":[{"iso":"eng"}],"publication":"PLoS Computational Biology","_id":"680","status":"public","file":[{"date_updated":"2020-07-14T12:47:40Z","date_created":"2018-12-12T10:07:47Z","checksum":"796a1026076af6f4405a47d985bc7b68","file_size":14555676,"file_name":"IST-2017-898-v1+1_journal.pcbi.1005582.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"system","file_id":"4645"}],"scopus_import":"1","title":"Sensory noise predicts divisive reshaping of receptive fields","publication_status":"published","date_updated":"2025-09-10T14:20:48Z","ddc":["571"],"author":[{"orcid":"0000-0001-7782-4436","first_name":"Matthew J","full_name":"Chalk, Matthew J","last_name":"Chalk","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Masset","first_name":"Paul","full_name":"Masset, Paul"},{"last_name":"Gutkin","first_name":"Boris","full_name":"Gutkin, Boris"},{"last_name":"Denève","first_name":"Sophie","full_name":"Denève, Sophie"}],"month":"06"},{"conference":{"end_date":"2017-07-07","location":"Brisbane, Australia","start_date":"2017-07-04","name":"SoCG: Symposium on Computational Geometry"},"file_date_updated":"2020-07-14T12:47:41Z","type":"conference","oa":1,"doi":"10.4230/LIPIcs.SoCG.2017.49","has_accepted_license":"1","article_number":"49","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"citation":{"short":"A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>","ieee":"A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77.","apa":"Lubiw, A., Masárová, Z., &#38; Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>","chicago":"Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>.","ista":"Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.","mla":"Lubiw, Anna, et al. <i>A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations</i>. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.49\">10.4230/LIPIcs.SoCG.2017.49</a>."},"department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"896","day":"01","quality_controlled":"1","date_published":"2017-06-01T00:00:00Z","intvolume":"        77","abstract":[{"lang":"eng","text":"Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture."}],"publist_id":"7033","volume":77,"year":"2017","related_material":{"record":[{"relation":"later_version","id":"5986","status":"public"}]},"date_created":"2018-12-11T11:47:54Z","oa_version":"Published Version","_id":"683","language":[{"iso":"eng"}],"title":"A proof of the orbit conjecture for flipping edge labelled triangulations","status":"public","scopus_import":1,"file":[{"file_name":"IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"system","file_id":"5265","date_updated":"2020-07-14T12:47:41Z","date_created":"2018-12-12T10:17:12Z","checksum":"24fdde981cc513352a78dcf9b0660ae9","file_size":710007}],"ddc":["514","516"],"date_updated":"2025-04-15T06:53:14Z","publication_status":"published","month":"06","author":[{"last_name":"Lubiw","full_name":"Lubiw, Anna","first_name":"Anna"},{"full_name":"Masárová, Zuzana","first_name":"Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","last_name":"Masárová"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}]},{"corr_author":"1","oa":1,"doi":"10.1017/jsl.2016.71","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1206.5174"}],"type":"journal_article","date_published":"2017-06-01T00:00:00Z","intvolume":"        82","day":"01","arxiv":1,"quality_controlled":"1","publication_identifier":{"issn":["0022-4812"],"eissn":["1943-5886"]},"article_processing_charge":"No","department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. 2017;82(2):420-452. doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>.","ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.","apa":"Chatterjee, K., &#38; Piterman, N. (2017). Obligation blackwell games and p-automata. <i>Journal of Symbolic Logic</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jsl.2016.71\">https://doi.org/10.1017/jsl.2016.71</a>","ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” <i>Journal of Symbolic Logic</i>, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:<a href=\"https://doi.org/10.1017/jsl.2016.71\">10.1017/jsl.2016.71</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Cambridge University Press","issue":"2","oa_version":"Submitted Version","date_created":"2018-12-11T11:47:54Z","external_id":{"arxiv":["1206.5174"],"isi":["000403796700002"]},"volume":82,"isi":1,"year":"2017","abstract":[{"text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic.","lang":"eng"}],"publist_id":"7026","page":"420 - 452","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"}],"month":"06","date_updated":"2025-09-10T14:18:30Z","publication_status":"published","title":"Obligation blackwell games and p-automata","status":"public","scopus_import":"1","_id":"684","language":[{"iso":"eng"}],"publication":"Journal of Symbolic Logic"},{"date_created":"2019-09-01T22:01:00Z","external_id":{"arxiv":["1610.02995"]},"oa_version":"Preprint","type":"conference","ec_funded":1,"abstract":[{"lang":"eng","text":"In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified."}],"conference":{"start_date":"2017-04-24","name":"ICLR: International Conference on Learning Representations","end_date":"2017-04-26","location":"Toulon, France"},"main_file_link":[{"url":"https://arxiv.org/abs/1610.02995","open_access":"1"}],"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"year":"2017","oa":1,"date_updated":"2021-01-12T08:09:17Z","publication_status":"published","quality_controlled":"1","arxiv":1,"day":"21","month":"02","author":[{"last_name":"Martius","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","full_name":"Martius, Georg S","first_name":"Georg S"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"date_published":"2017-02-21T00:00:00Z","language":[{"iso":"eng"}],"publication":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings","citation":{"ama":"Martius GS, Lampert C. Extrapolation and learning equations. In: <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations; 2017.","short":"G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","mla":"Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, International Conference on Learning Representations, 2017.","ieee":"G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>, Toulon, France, 2017.","chicago":"Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. International Conference on Learning Representations, 2017.","apa":"Martius, G. S., &#38; Lampert, C. (2017). Extrapolation and learning equations. In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>. Toulon, France: International Conference on Learning Representations.","ista":"Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations."},"_id":"6841","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"publisher":"International Conference on Learning Representations","title":"Extrapolation and learning equations","status":"public","scopus_import":1},{"date_published":"2017-06-01T00:00:00Z","intvolume":"        68","day":"01","arxiv":1,"quality_controlled":"1","publication_identifier":{"issn":["0033-5606"]},"article_processing_charge":"No","citation":{"ista":"Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal of Mathematics. 68(2), 635–703.","chicago":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>.","apa":"Davison, B. (2017). The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haw053\">https://doi.org/10.1093/qmath/haw053</a>","ieee":"B. Davison, “The critical CoHA of a quiver with potential,” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.","mla":"Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly Journal of Mathematics</i>, vol. 68, no. 2, Oxford University Press, 2017, pp. 635–703, doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>.","short":"B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.","ama":"Davison B. The critical CoHA of a quiver with potential. <i>Quarterly Journal of Mathematics</i>. 2017;68(2):635-703. doi:<a href=\"https://doi.org/10.1093/qmath/haw053\">10.1093/qmath/haw053</a>"},"department":[{"_id":"TaHa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"2","publisher":"Oxford University Press","corr_author":"1","oa":1,"doi":"10.1093/qmath/haw053","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1311.7172"}],"type":"journal_article","month":"06","author":[{"full_name":"Davison, Ben","first_name":"Ben","orcid":"0000-0002-8944-4390","id":"4634AB1E-F248-11E8-B48F-1D18A9856A87","last_name":"Davison"}],"date_updated":"2025-09-10T14:15:30Z","publication_status":"published","title":"The critical CoHA of a quiver with potential","scopus_import":"1","status":"public","_id":"687","language":[{"iso":"eng"}],"publication":"Quarterly Journal of Mathematics","oa_version":"Submitted Version","date_created":"2018-12-11T11:47:55Z","external_id":{"isi":["000404545300015"],"arxiv":["1311.7172"]},"isi":1,"volume":68,"project":[{"grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Arithmetic and physics of Higgs moduli spaces"}],"year":"2017","abstract":[{"lang":"eng","text":"Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs."}],"ec_funded":1,"publist_id":"7022","page":"635 - 703"},{"month":"06","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"ddc":["514","516"],"date_updated":"2025-07-10T11:53:56Z","publication_status":"published","title":"Topological data analysis with Bregman divergences","status":"public","scopus_import":"1","file":[{"file_name":"IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4856","creator":"system","date_updated":"2020-07-14T12:47:42Z","date_created":"2018-12-12T10:11:03Z","file_size":990546,"checksum":"067ab0cb3f962bae6c3af6bf0094e0f3"}],"_id":"688","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:47:56Z","volume":77,"year":"2017","abstract":[{"lang":"eng","text":"We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. "}],"publist_id":"7021","page":"391-3916","date_published":"2017-06-01T00:00:00Z","intvolume":"        77","day":"01","quality_controlled":"1","publication_identifier":{"issn":["1868-8969"]},"article_processing_charge":"No","pubrep_id":"895","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.","ama":"Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>","ista":"Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.","ieee":"H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916.","apa":"Edelsbrunner, H., &#38; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>","chicago":"Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.","mla":"Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2017.39\">10.4230/LIPIcs.SoCG.2017.39</a>."},"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","corr_author":"1","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"doi":"10.4230/LIPIcs.SoCG.2017.39","conference":{"end_date":"2017-07-07","location":"Brisbane, Australia","start_date":"2017-07-04","name":"Symposium on Computational Geometry, SoCG"},"file_date_updated":"2020-07-14T12:47:42Z","type":"conference"},{"date_published":"2017-06-07T00:00:00Z","intvolume":"         9","day":"07","quality_controlled":"1","publication_identifier":{"issn":["1946-6234"]},"article_processing_charge":"No","issue":"393","publisher":"American Association for the Advancement of Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” <i>Science Translational Medicine</i>, vol. 9, no. 393, eaan8196, American Association for the Advancement of Science, 2017, doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">10.1126/scitranslmed.aan8196</a>.","apa":"Novarino, G. (2017). Rett syndrome modeling goes simian. <i>Science Translational Medicine</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">https://doi.org/10.1126/scitranslmed.aan8196</a>","chicago":"Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” <i>Science Translational Medicine</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">https://doi.org/10.1126/scitranslmed.aan8196</a>.","ieee":"G. Novarino, “Rett syndrome modeling goes simian,” <i>Science Translational Medicine</i>, vol. 9, no. 393. American Association for the Advancement of Science, 2017.","ista":"Novarino G. 2017. Rett syndrome modeling goes simian. Science Translational Medicine. 9(393), eaan8196.","ama":"Novarino G. Rett syndrome modeling goes simian. <i>Science Translational Medicine</i>. 2017;9(393). doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan8196\">10.1126/scitranslmed.aan8196</a>","short":"G. Novarino, Science Translational Medicine 9 (2017)."},"department":[{"_id":"GaNo"}],"corr_author":"1","article_number":"eaan8196","doi":"10.1126/scitranslmed.aan8196","type":"journal_article","month":"06","author":[{"full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","date_updated":"2025-07-10T11:54:00Z","status":"public","scopus_import":"1","title":"Rett syndrome modeling goes simian","_id":"689","publication":"Science Translational Medicine","language":[{"iso":"eng"}],"oa_version":"None","date_created":"2018-12-11T11:47:56Z","year":"2017","volume":9,"abstract":[{"text":"Rett syndrome modeling in monkey mirrors the human disorder.","lang":"eng"}],"publist_id":"7019"},{"oa":1,"doi":"10.1073/pnas.1704470114","type":"journal_article","pmid":1,"file_date_updated":"2020-07-14T12:47:44Z","corr_author":"1","has_accepted_license":"1","publication_identifier":{"issn":["0027-8424"]},"article_processing_charge":"Yes (in subscription journal)","publisher":"National Academy of Sciences","issue":"26","citation":{"short":"T. Miki, W. Kaufmann, G. Malagon, L. Gomez, K. Tabuchi, M. Watanabe, R. Shigemoto, A. Marty, PNAS 114 (2017) E5246–E5255.","ama":"Miki T, Kaufmann W, Malagon G, et al. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. <i>PNAS</i>. 2017;114(26):E5246-E5255. doi:<a href=\"https://doi.org/10.1073/pnas.1704470114\">10.1073/pnas.1704470114</a>","ista":"Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R, Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255.","ieee":"T. Miki <i>et al.</i>, “Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses,” <i>PNAS</i>, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255, 2017.","chicago":"Miki, Takafumi, Walter Kaufmann, Gerardo Malagon, Laura Gomez, Katsuhiko Tabuchi, Masahiko Watanabe, Ryuichi Shigemoto, and Alain Marty. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1704470114\">https://doi.org/10.1073/pnas.1704470114</a>.","apa":"Miki, T., Kaufmann, W., Malagon, G., Gomez, L., Tabuchi, K., Watanabe, M., … Marty, A. (2017). Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1704470114\">https://doi.org/10.1073/pnas.1704470114</a>","mla":"Miki, Takafumi, et al. “Numbers of Presynaptic Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.” <i>PNAS</i>, vol. 114, no. 26, National Academy of Sciences, 2017, pp. E5246–55, doi:<a href=\"https://doi.org/10.1073/pnas.1704470114\">10.1073/pnas.1704470114</a>."},"department":[{"_id":"EM-Fac"},{"_id":"RySh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2017-06-27T00:00:00Z","intvolume":"       114","day":"27","quality_controlled":"1","year":"2017","isi":1,"volume":114,"abstract":[{"lang":"eng","text":"Many central synapses contain a single presynaptic active zone and a single postsynaptic density. Vesicular release statistics at such “simple synapses” indicate that they contain a small complement of docking sites where vesicles repetitively dock and fuse. In this work, we investigate functional and morphological aspects of docking sites at simple synapses made between cerebellar parallel fibers and molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture replicas, we find that Cav2.1 channels form several clusters per active zone with about nine channels per cluster. The mean value and range of intersynaptic variation are similar for Cav2.1 cluster numbers and for functional estimates of docking-site numbers obtained from the maximum numbers of released vesicles per action potential. Both numbers grow in relation with synaptic size and decrease by a similar extent with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range: 1–5). These changes were accompanied by decreases of miniature current amplitude (from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2), and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic transmission with development. Altogether, these results suggest a close correspondence between the number of functionally defined vesicular docking sites and that of clusters of voltage-gated calcium channels. "}],"page":"E5246 - E5255","publist_id":"7013","oa_version":"Published Version","date_created":"2018-12-11T11:47:57Z","external_id":{"pmid":["28607047"],"isi":["000404108400028"]},"status":"public","scopus_import":"1","file":[{"date_updated":"2020-07-14T12:47:44Z","date_created":"2020-01-03T13:27:29Z","file_size":2721544,"checksum":"2ab75d554f3df4a34d20fa8040589b7e","file_name":"2017_PNAS_Miki.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"kschuh","file_id":"7223"}],"title":"Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses","_id":"693","publication":"PNAS","language":[{"iso":"eng"}],"author":[{"first_name":"Takafumi","full_name":"Miki, Takafumi","last_name":"Miki"},{"full_name":"Kaufmann, Walter","first_name":"Walter","orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","last_name":"Kaufmann"},{"full_name":"Malagon, Gerardo","first_name":"Gerardo","last_name":"Malagon"},{"last_name":"Gomez","full_name":"Gomez, Laura","first_name":"Laura"},{"last_name":"Tabuchi","full_name":"Tabuchi, Katsuhiko","first_name":"Katsuhiko"},{"first_name":"Masahiko","full_name":"Watanabe, Masahiko","last_name":"Watanabe"},{"full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Marty","first_name":"Alain","full_name":"Marty, Alain"}],"month":"06","ddc":["570"],"publication_status":"published","date_updated":"2025-09-10T14:00:03Z"},{"doi":"10.1145/3087801.3087833","year":"2017","type":"conference","page":"101-110","conference":{"start_date":"2017-07-25","name":"PODC: Principles of Distributed Computing","end_date":"2017-07-27","location":"Washington, DC, United States"},"abstract":[{"lang":"eng","text":"LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of O(1), Θ(log* n), or Θ(n), and the design of optimal algorithms can be fully automated. This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log* n), and Θ(n). However, given an LCL problem it is undecidable whether its complexity is Θ(log* n) or Θ(n) in 2-dimensional grids.\r\nNevertheless, if we correctly guess that the complexity of a problem is Θ(log* n), we can completely automate the design of optimal algorithms. For any problem we can find an algorithm that is of a normal form A' o Sk, where A' is a finite function, Sk is an algorithm for finding a maximal independent set in kth power of the grid, and k is a constant.\r\nFinally, partially with the help of automated design tools, we classify the complexity of several concrete LCL problems related to colourings and orientations."}],"oa_version":"None","date_created":"2019-10-08T12:47:46Z","article_processing_charge":"No","status":"public","title":"LCL problems on grids","publication_identifier":{"isbn":["9781450349925"]},"extern":"1","language":[{"iso":"eng"}],"publisher":"ACM","_id":"6932","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Brandt, Sebastian, et al. <i>LCL Problems on Grids</i>. ACM, 2017, pp. 101–10, doi:<a href=\"https://doi.org/10.1145/3087801.3087833\">10.1145/3087801.3087833</a>.","ieee":"S. Brandt <i>et al.</i>, “LCL problems on grids,” presented at the PODC: Principles of Distributed Computing, Washington, DC, United States, 2017, pp. 101–110.","apa":"Brandt, S., Hirvonen, J., Korhonen, J. H., Lempiäinen, T., Östergård, P. R. J., Purcell, C., … Uznański, P. (2017). LCL problems on grids (pp. 101–110). Presented at the PODC: Principles of Distributed Computing, Washington, DC, United States: ACM. <a href=\"https://doi.org/10.1145/3087801.3087833\">https://doi.org/10.1145/3087801.3087833</a>","chicago":"Brandt, Sebastian, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R.J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemysław Uznański. “LCL Problems on Grids,” 101–10. ACM, 2017. <a href=\"https://doi.org/10.1145/3087801.3087833\">https://doi.org/10.1145/3087801.3087833</a>.","ista":"Brandt S, Hirvonen J, Korhonen JH, Lempiäinen T, Östergård PRJ, Purcell C, Rybicki J, Suomela J, Uznański P. 2017. LCL problems on grids. PODC: Principles of Distributed Computing, 101–110.","ama":"Brandt S, Hirvonen J, Korhonen JH, et al. LCL problems on grids. In: ACM; 2017:101-110. doi:<a href=\"https://doi.org/10.1145/3087801.3087833\">10.1145/3087801.3087833</a>","short":"S. Brandt, J. Hirvonen, J.H. Korhonen, T. Lempiäinen, P.R.J. Östergård, C. Purcell, J. Rybicki, J. Suomela, P. Uznański, in:, ACM, 2017, pp. 101–110."},"month":"07","author":[{"last_name":"Brandt","full_name":"Brandt, Sebastian","first_name":"Sebastian"},{"last_name":"Hirvonen","first_name":"Juho","full_name":"Hirvonen, Juho"},{"full_name":"Korhonen, Janne H.","first_name":"Janne H.","last_name":"Korhonen"},{"last_name":"Lempiäinen","full_name":"Lempiäinen, Tuomo","first_name":"Tuomo"},{"last_name":"Östergård","full_name":"Östergård, Patric R.J.","first_name":"Patric R.J."},{"last_name":"Purcell","full_name":"Purcell, Christopher","first_name":"Christopher"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","first_name":"Joel","orcid":"0000-0002-6432-6646"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"first_name":"Przemysław","full_name":"Uznański, Przemysław","last_name":"Uznański"}],"date_published":"2017-07-01T00:00:00Z","quality_controlled":"1","publication_status":"published","date_updated":"2025-07-10T11:54:03Z","day":"01"},{"abstract":[{"lang":"eng","text":"A change regarding the extent of adhesion - hereafter referred to as adhesion plasticity - between adhesive and less-adhesive states of mammalian cells is important for their behavior. To investigate adhesion plasticity, we have selected a stable isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension. These suspension cells are unable to re-adhere to various matrices or to contract three-dimensional collagen lattices. By using transcriptome analysis, we identified the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity. Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore, by transiently challenging breast cancer cells to grow under non-adherent conditions markedly reduces Tns3 protein expression, which is regained upon re-adhesion. Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion, spreading and migration. Tns3-knockdown cells display impaired structure and dynamics of focal adhesion complexes as determined by immunostaining. Restoration of Tns3 protein expression in suspension cells partially rescues adhesion and focal contact composition. Our work identifies Tns3 as a crucial focal adhesion component regulated by, and functionally contributing to, the switch between adhesive and non-adhesive states in MDA-MB-468 cancer cells."}],"page":"2172 - 2184","publist_id":"7008","year":"2017","volume":130,"isi":1,"external_id":{"isi":["000405612200009"],"pmid":["28515231"]},"date_created":"2018-12-11T11:47:58Z","oa_version":"Published Version","_id":"694","publication":"Journal of Cell Science","language":[{"iso":"eng"}],"article_type":"original","file":[{"file_size":10847596,"checksum":"42c81a0a4fc3128883b391c3af3f74bc","date_created":"2019-10-24T09:43:56Z","date_updated":"2020-07-14T12:47:45Z","creator":"dernst","file_id":"6966","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2017_CellScience_Vess.pdf"}],"scopus_import":"1","status":"public","title":"A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity","ddc":["570"],"publication_status":"published","date_updated":"2025-09-10T11:13:35Z","month":"07","author":[{"last_name":"Veß","full_name":"Veß, Astrid","first_name":"Astrid"},{"last_name":"Blache","full_name":"Blache, Ulrich","first_name":"Ulrich"},{"last_name":"Leitner","first_name":"Laura","full_name":"Leitner, Laura"},{"full_name":"Kurz, Angela","first_name":"Angela","last_name":"Kurz"},{"full_name":"Ehrenpfordt, Anja","first_name":"Anja","last_name":"Ehrenpfordt"},{"full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"},{"full_name":"Posern, Guido","first_name":"Guido","last_name":"Posern"}],"pmid":1,"type":"journal_article","file_date_updated":"2020-07-14T12:47:45Z","oa":1,"doi":"10.1242/jcs.200899","has_accepted_license":"1","publisher":"Company of Biologists","issue":"13","citation":{"ama":"Veß A, Blache U, Leitner L, et al. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. <i>Journal of Cell Science</i>. 2017;130(13):2172-2184. doi:<a href=\"https://doi.org/10.1242/jcs.200899\">10.1242/jcs.200899</a>","short":"A. Veß, U. Blache, L. Leitner, A. Kurz, A. Ehrenpfordt, M.K. Sixt, G. Posern, Journal of Cell Science 130 (2017) 2172–2184.","mla":"Veß, Astrid, et al. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” <i>Journal of Cell Science</i>, vol. 130, no. 13, Company of Biologists, 2017, pp. 2172–84, doi:<a href=\"https://doi.org/10.1242/jcs.200899\">10.1242/jcs.200899</a>.","ista":"Veß A, Blache U, Leitner L, Kurz A, Ehrenpfordt A, Sixt MK, Posern G. 2017. A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell Science. 130(13), 2172–2184.","apa":"Veß, A., Blache, U., Leitner, L., Kurz, A., Ehrenpfordt, A., Sixt, M. K., &#38; Posern, G. (2017). A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.200899\">https://doi.org/10.1242/jcs.200899</a>","ieee":"A. Veß <i>et al.</i>, “A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity,” <i>Journal of Cell Science</i>, vol. 130, no. 13. Company of Biologists, pp. 2172–2184, 2017.","chicago":"Veß, Astrid, Ulrich Blache, Laura Leitner, Angela Kurz, Anja Ehrenpfordt, Michael K Sixt, and Guido Posern. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” <i>Journal of Cell Science</i>. Company of Biologists, 2017. <a href=\"https://doi.org/10.1242/jcs.200899\">https://doi.org/10.1242/jcs.200899</a>."},"department":[{"_id":"MiSi"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["0021-9533"]},"article_processing_charge":"No","day":"01","quality_controlled":"1","date_published":"2017-07-01T00:00:00Z","intvolume":"       130"}]