[{"month":"06","doi":"10.1145/2897518.2897638","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07056"}],"publication":"48th Annual ACM SIGACT Symposium on Theory of Computing","publisher":"Association for Computing Machinery","publication_status":"published","day":"01","status":"public","arxiv":1,"publication_identifier":{"issn":["0737-8017"],"isbn":["978-145034132-5"]},"quality_controlled":"1","external_id":{"arxiv":["1504.07056"]},"date_published":"2016-06-01T00:00:00Z","citation":{"ista":"Henzinger M, Krinninger S, Nanongkai D. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 489–498.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” In <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, 489–98. Association for Computing Machinery, 2016. <a href=\"https://doi.org/10.1145/2897518.2897638\">https://doi.org/10.1145/2897518.2897638</a>.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” in <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, Cambridge, MA, United States, 2016, pp. 489–498.","ama":"Henzinger M, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In: <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>. Association for Computing Machinery; 2016:489-498. doi:<a href=\"https://doi.org/10.1145/2897518.2897638\">10.1145/2897518.2897638</a>","mla":"Henzinger, Monika, et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, Association for Computing Machinery, 2016, pp. 489–98, doi:<a href=\"https://doi.org/10.1145/2897518.2897638\">10.1145/2897518.2897638</a>.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–498.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2016). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i> (pp. 489–498). Cambridge, MA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2897518.2897638\">https://doi.org/10.1145/2897518.2897638</a>"},"page":"489 - 498","_id":"11866","date_updated":"2024-11-06T12:19:26Z","abstract":[{"text":"We present a deterministic (1+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here n is the number of nodes in the network and D is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+o(1))-approximation Õ(n1/2D1/4+D)-time algorithm of Nanongkai [STOC 2014] by a factor of as large as n1/8, and (ii) the O(є−1logє−1)-approximation factor of Lenzen and Patt-Shamir’s Õ(n1/2+є+D)-time algorithm [STOC 2013] within the same running time. Our running time matches the known time lower bound of Ω(n1/2/logn + D) [Das Sarma et al. STOC 2011] modulo some lower-order terms, thus essentially settling the status of this problem which was raised at least a decade ago [Elkin SIGACT News 2004]. It also implies a (2+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for approximating a network’s weighted diameter which almost matches the lower bound by Holzer et al. [PODC 2012].\r\n\r\nIn achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic, construction of an (no(1), o(1))-hop set of size O(n1+o(1)). We combine these techniques with many distributed algorithmic techniques, some of which from problems that are not directly related to shortest paths, e.g. ruling sets [Goldberg et al. STOC 1987], source detection [Lenzen, Peleg PODC 2013], and partial distance estimation [Lenzen, Patt-Shamir PODC 2015]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1+o(1))-approximation O(no(1))-time algorithm on congested cliques, and (ii) a (1+o(1))-approximation O(no(1)logW)-pass O(n1+o(1)logW)-space streaming algorithm, when edge weights are in {1, 2, …, W}. The first result answers an open problem in [Nanongkai, STOC 2014]. The second result partially answers an open problem raised by McGregor in 2006 [<pre>sublinear.info</pre>, Problem 14].","lang":"eng"}],"language":[{"iso":"eng"}],"date_created":"2022-08-16T09:19:31Z","oa_version":"Preprint","type":"conference","oa":1,"conference":{"location":"Cambridge, MA, United States","start_date":"2016-06-19","name":"STOC: Symposium on Theory of Computing","end_date":"2016-06-21"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A deterministic almost-tight distributed algorithm for approximating single-source shortest paths","scopus_import":"1","year":"2016","article_processing_charge":"No","extern":"1","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}]},{"external_id":{"arxiv":["1604.05765"]},"quality_controlled":"1","publisher":"Association for Computing Machinery","publication_status":"published","publication":"48th Annual ACM SIGACT Symposium on Theory of Computing","arxiv":1,"publication_identifier":{"isbn":["978-145034132-5"],"issn":["0737-8017"]},"day":"01","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05765"}],"month":"06","doi":"10.1145/2897518.2897568","extern":"1","year":"2016","article_processing_charge":"No","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"scopus_import":"1","conference":{"start_date":"2016-06-19","location":"Cambridge, MA, United States","name":"STOC: Symposium on Theory of Computing","end_date":"2016-06-21"},"title":"New deterministic approximation algorithms for fully dynamic matching","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_created":"2022-08-16T09:27:35Z","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"page":"398 - 411","citation":{"chicago":"Bhattacharya, Sayan, Monika Henzinger, and Danupon Nanongkai. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.” In <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, 398–411. Association for Computing Machinery, 2016. <a href=\"https://doi.org/10.1145/2897518.2897568\">https://doi.org/10.1145/2897518.2897568</a>.","ista":"Bhattacharya S, Henzinger M, Nanongkai D. 2016. New deterministic approximation algorithms for fully dynamic matching. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 398–411.","ama":"Bhattacharya S, Henzinger M, Nanongkai D. New deterministic approximation algorithms for fully dynamic matching. In: <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>. Association for Computing Machinery; 2016:398-411. doi:<a href=\"https://doi.org/10.1145/2897518.2897568\">10.1145/2897518.2897568</a>","ieee":"S. Bhattacharya, M. Henzinger, and D. Nanongkai, “New deterministic approximation algorithms for fully dynamic matching,” in <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, Cambridge, MA, United States, 2016, pp. 398–411.","apa":"Bhattacharya, S., Henzinger, M., &#38; Nanongkai, D. (2016). New deterministic approximation algorithms for fully dynamic matching. In <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i> (pp. 398–411). Cambridge, MA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2897518.2897568\">https://doi.org/10.1145/2897518.2897568</a>","mla":"Bhattacharya, Sayan, et al. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.” <i>48th Annual ACM SIGACT Symposium on Theory of Computing</i>, Association for Computing Machinery, 2016, pp. 398–411, doi:<a href=\"https://doi.org/10.1145/2897518.2897568\">10.1145/2897518.2897568</a>.","short":"S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411."},"date_published":"2016-06-01T00:00:00Z","_id":"11867","date_updated":"2024-11-06T12:19:37Z","abstract":[{"lang":"eng","text":"We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O(poly(logn, 1/є)) update time. (2) An algorithm that maintains an αK approximation of the value of the maximum matching with O(n2/K) update time in bipartite graphs, for every sufficiently large constant positive integer K. Here, 1≤ αK < 2 is a constant determined by the value of K. Result (1) is the first deterministic algorithm that can maintain an o(logn)-approximate maximum matching with polylogarithmic update time, improving the seminal result of Onak et al. [STOC 2010]. Its approximation guarantee almost matches the guarantee of the best randomized polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with arbitrarily small polynomial update time on bipartite graphs. Previously the best update time for this problem was O(m1/4) [Bernstein et al. ICALP 2015], where m is the current number of edges in the graph."}]},{"language":[{"iso":"eng"}],"_id":"1188","abstract":[{"text":"We consider a population dynamics model coupling cell growth to a diffusion in the space of metabolic phenotypes as it can be obtained from realistic constraints-based modelling. \r\nIn the asymptotic regime of slow\r\ndiffusion, that coincides with the relevant experimental range, the resulting\r\nnon-linear Fokker–Planck equation is solved for the steady state in the WKB\r\napproximation that maps it into the ground state of a quantum particle in an\r\nAiry potential plus a centrifugal term. We retrieve scaling laws for growth rate\r\nfluctuations and time response with respect to the distance from the maximum\r\ngrowth rate suggesting that suboptimal populations can have a faster response\r\nto perturbations.","lang":"eng"}],"date_updated":"2025-09-22T09:45:38Z","citation":{"ieee":"D. De Martino and D. Masoero, “Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth,” <i> Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2016, no. 12. IOP Publishing, 2016.","ama":"De Martino D, Masoero D. Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth. <i> Journal of Statistical Mechanics: Theory and Experiment</i>. 2016;2016(12). doi:<a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">10.1088/1742-5468/aa4e8f</a>","ista":"De Martino D, Masoero D. 2016. Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth.  Journal of Statistical Mechanics: Theory and Experiment. 2016(12), 123502.","chicago":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &#38;amp; Growth.” <i> Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2016. <a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">https://doi.org/10.1088/1742-5468/aa4e8f</a>.","mla":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &#38;amp; Growth.” <i> Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2016, no. 12, 123502, IOP Publishing, 2016, doi:<a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">10.1088/1742-5468/aa4e8f</a>.","short":"D. De Martino, D. Masoero,  Journal of Statistical Mechanics: Theory and Experiment 2016 (2016).","apa":"De Martino, D., &#38; Masoero, D. (2016). Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth. <i> Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">https://doi.org/10.1088/1742-5468/aa4e8f</a>"},"department":[{"_id":"GaTk"}],"date_published":"2016-12-30T00:00:00Z","isi":1,"oa":1,"issue":"12","article_number":"123502","type":"journal_article","oa_version":"Preprint","date_created":"2018-12-11T11:50:37Z","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth","author":[{"first_name":"Daniele","orcid":"0000-0002-5214-4706","last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","full_name":"De Martino, Daniele"},{"last_name":"Masoero","first_name":"Davide","full_name":"Masoero, Davide"}],"intvolume":"      2016","article_processing_charge":"No","year":"2016","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1088/1742-5468/aa4e8f","month":"12","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1606.09048","open_access":"1"}],"publist_id":"6165","arxiv":1,"status":"public","day":"30","publication_status":"published","publisher":"IOP Publishing","volume":2016,"publication":" Journal of Statistical Mechanics: Theory and Experiment","acknowledgement":"D De Martino is supported by the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007–2013) under REA grant agreement no. [291734]. D Masoero is supported by the FCT scholarship, number SFRH/BPD/75908/2011. D De Martino thanks the Grupo de Física Matemática of the Universidade de Lisboa for the kind hospitality. We also wish to thank Matteo Osella, Vincenzo Vitagliano and Vera Luz Masoero for useful discussions, also late at night.","external_id":{"arxiv":["1606.09048"],"isi":["000391973900001"]},"quality_controlled":"1"},{"publication_status":"published","publisher":"Technical University Vienna","title":"Dissipative Few-Body Quantum Systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"28","extern":"1","article_processing_charge":"No","year":"2016","supervisor":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail"},{"last_name":"Rabl","first_name":"Peter","full_name":"Rabl, Peter"}],"author":[{"full_name":"Jochum, Clemens","last_name":"Jochum","first_name":"Clemens"}],"language":[{"iso":"eng"}],"month":"11","_id":"1189","date_updated":"2021-01-12T06:48:57Z","abstract":[{"lang":"eng","text":"Within the scope of this thesis,  we show that a driven-dissipative system with\r\nfew ultracold atoms can exhibit dissipatively bound states, even if the atom-atom\r\ninteraction is purely repulsive.  This bond arises due to the dipole-dipole inter-\r\naction, which is restricted to one of the lower electronic energy states, resulting\r\nin the distance-dependent coherent population trapping.  The quality of this al-\r\nready established method of dissipative binding is improved and the application\r\nis extended to higher dimensions and a larger number of atoms.  Here, we simu-\r\nlate two- and three-atom systems using an adapted approach to the Monte Carlo\r\nwave-function  method  and  analyse  the  results.   Finally,  we  examine  the  possi-\r\nbility  of  finding  a  setting  allowing  trimer  states  but  prohibiting  dimer  states.\r\nIn the context of open quantum systems, such a three-body bound states corre-\r\nsponds to the driven-dissipative analogue of a Borromean state.  These states can\r\nbe detected in modern experiments with dipolar and Rydberg-dressed ultracold\r\natomic gases.\r\n"}],"page":"94","citation":{"ieee":"C. Jochum, “Dissipative Few-Body Quantum Systems,” Technical University Vienna, 2016.","ama":"Jochum C. Dissipative Few-Body Quantum Systems. 2016.","ista":"Jochum C. 2016. Dissipative Few-Body Quantum Systems. Technical University Vienna.","chicago":"Jochum, Clemens. “Dissipative Few-Body Quantum Systems.” Technical University Vienna, 2016.","mla":"Jochum, Clemens. <i>Dissipative Few-Body Quantum Systems</i>. Technical University Vienna, 2016.","short":"C. Jochum, Dissipative Few-Body Quantum Systems, Technical University Vienna, 2016.","apa":"Jochum, C. (2016). <i>Dissipative Few-Body Quantum Systems</i>. Technical University Vienna."},"date_published":"2016-11-28T00:00:00Z","type":"dissertation","oa_version":"Published Version","date_created":"2018-12-11T11:50:37Z","publist_id":"6164","oa":1,"main_file_link":[{"open_access":"1","url":"http://repositum.tuwien.ac.at/obvutwhs/content/titleinfo/1517088"}]},{"language":[{"iso":"eng"}],"page":"947-1006","citation":{"mla":"Henzinger, Monika, et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” <i>SIAM Journal on Computing</i>, vol. 45, no. 3, Society for Industrial &#38; Applied Mathematics, 2016, pp. 947–1006, doi:<a href=\"https://doi.org/10.1137/140957299\">10.1137/140957299</a>.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 45 (2016) 947–1006.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2016). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/140957299\">https://doi.org/10.1137/140957299</a>","ama":"Henzinger M, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. <i>SIAM Journal on Computing</i>. 2016;45(3):947-1006. doi:<a href=\"https://doi.org/10.1137/140957299\">10.1137/140957299</a>","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” <i>SIAM Journal on Computing</i>, vol. 45, no. 3. Society for Industrial &#38; Applied Mathematics, pp. 947–1006, 2016.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2016. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 45(3), 947–1006.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2016. <a href=\"https://doi.org/10.1137/140957299\">https://doi.org/10.1137/140957299</a>."},"date_published":"2016-05-01T00:00:00Z","_id":"11891","abstract":[{"lang":"eng","text":"We study dynamic (1+𝜖)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected 𝑛-node 𝑚-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and constant query time by Roditty and Zwick [SIAM J. Comput., 41 (2012), pp. 670--683]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [J. ACM, 28 (1981), pp. 1--4]; it has a total update time of 𝑂(𝑚𝑛2) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of 𝑂̃ (𝑛5/2/𝜖) and constant query time that has an additive error of 2 in addition to the 1+𝜖 multiplicative error. This beats the previous 𝑂̃ (𝑚𝑛/𝜖) time when 𝑚=Ω(𝑛3/2). Note that the additive error is unavoidable since, even in the static case, an 𝑂(𝑛3−𝛿)-time (a so-called truly subcubic) combinatorial algorithm with 1+𝜖 multiplicative error cannot have an additive error less than 2−𝜖, unless we make a major breakthrough for Boolean matrix multiplication [D. Dor, S. Halrepin, and U. Zwick, SIAM J. Comput., 29 (2000), pp. 1740--1759] and many other long-standing problems [V. Vassilevska Williams and R. Williams, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, pp. 645--654]. The algorithm can also be turned into a (2+𝜖)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3+𝜖)-approximation algorithm with 𝑂̃ (𝑛5/2+𝑂(log(1/𝜖)/log𝑛√)) running time of Bernstein and Roditty [Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 1355--1365] in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and a query time of 𝑂(loglog𝑛). The algorithm has a multiplicative error of 1+𝜖 and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in [Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, pp. 725--734]. The deterministic algorithm can be turned into a deterministic fully dynamic (1+𝜖)-approximation with an amortized update time of 𝑂̃ (𝑚𝑛/(𝜖𝑡)) and a query time of 𝑂̃ (𝑡) for every 𝑡≤𝑛√. In order to achieve our results, we introduce two new techniques: (i) A monotone Even--Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called a locally persevering emulator. (ii) A derandomization technique based on moving Even--Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest."}],"date_updated":"2024-11-06T12:23:06Z","oa":1,"issue":"3","type":"journal_article","date_created":"2022-08-17T08:37:00Z","oa_version":"Preprint","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization","article_type":"original","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"intvolume":"        45","extern":"1","year":"2016","article_processing_charge":"No","doi":"10.1137/140957299","month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1308.0776"}],"arxiv":1,"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"day":"01","status":"public","publisher":"Society for Industrial & Applied Mathematics","publication_status":"published","publication":"SIAM Journal on Computing","volume":45,"external_id":{"arxiv":["1308.0776"]},"quality_controlled":"1"},{"conference":{"location":"New Brunswick, NJ, USA ","start_date":"2016-09-09","end_date":"2016-09-11","name":"FOCS: Foundations of Computer Science"},"title":"Commutativity in the algorithmic Lovasz local lemma","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","year":"2016","article_processing_charge":"No","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"related_material":{"record":[{"status":"public","id":"5975","relation":"later_version"}]},"department":[{"_id":"VlKo"}],"citation":{"ama":"Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2016-December. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, New Brunswick, NJ, USA , 2016, vol. 2016–December.","ista":"Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, Vol. 2016–December. IEEE, 2016. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>.","short":"V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2016–December, 7782993, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>.","apa":"Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>"},"date_published":"2016-12-15T00:00:00Z","_id":"1193","abstract":[{"lang":"eng","text":"We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid &quot;bad features&quot;, or &quot;flaws&quot;. It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and &quot;resamples&quot; it using a &quot;resampling oracle&quot; provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new &quot;commutativity&quot; condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately."}],"date_updated":"2025-09-22T09:44:20Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:38Z","oa_version":"Preprint","type":"conference","article_number":"7782993","oa":1,"isi":1,"publication":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science","volume":"2016-December","publisher":"IEEE","publication_status":"published","day":"15","status":"public","arxiv":1,"quality_controlled":"1","external_id":{"isi":["000391198500082"],"arxiv":["1506.08547"]},"acknowledgement":"European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160","month":"12","doi":"10.1109/FOCS.2016.88","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"publist_id":"6158","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547v7"}],"ec_funded":1},{"title":"Reconstruction of haplotype-blocks selected during experimental evolution.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","year":"2016","article_processing_charge":"No","intvolume":"        34","author":[{"full_name":"Franssen, Susan","last_name":"Franssen","first_name":"Susan"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"last_name":"Schlötterer","first_name":"Christian","full_name":"Schlötterer, Christian"}],"citation":{"apa":"Franssen, S., Barton, N. H., &#38; Schlötterer, C. (2016). Reconstruction of haplotype-blocks selected during experimental evolution. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msw210\">https://doi.org/10.1093/molbev/msw210</a>","short":"S. Franssen, N.H. Barton, C. Schlötterer, Molecular Biology and Evolution 34 (2016) 174–184.","mla":"Franssen, Susan, et al. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” <i>Molecular Biology and Evolution</i>, vol. 34, no. 1, Oxford University Press, 2016, pp. 174–84, doi:<a href=\"https://doi.org/10.1093/molbev/msw210\">10.1093/molbev/msw210</a>.","ieee":"S. Franssen, N. H. Barton, and C. Schlötterer, “Reconstruction of haplotype-blocks selected during experimental evolution.,” <i>Molecular Biology and Evolution</i>, vol. 34, no. 1. Oxford University Press, pp. 174–184, 2016.","ama":"Franssen S, Barton NH, Schlötterer C. Reconstruction of haplotype-blocks selected during experimental evolution. <i>Molecular Biology and Evolution</i>. 2016;34(1):174-184. doi:<a href=\"https://doi.org/10.1093/molbev/msw210\">10.1093/molbev/msw210</a>","chicago":"Franssen, Susan, Nicholas H Barton, and Christian Schlötterer. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/molbev/msw210\">https://doi.org/10.1093/molbev/msw210</a>.","ista":"Franssen S, Barton NH, Schlötterer C. 2016. Reconstruction of haplotype-blocks selected during experimental evolution. Molecular Biology and Evolution. 34(1), 174–184."},"page":"174 - 184","department":[{"_id":"NiBa"}],"date_published":"2016-10-03T00:00:00Z","abstract":[{"lang":"eng","text":"The genetic analysis of experimentally evolving populations typically relies on short reads from pooled individuals (Pool-Seq). While this method provides reliable allele frequency estimates, the underlying haplotype structure remains poorly characterized. With small population sizes and adaptive variants that start from low frequencies, the interpretation of selection signatures in most Evolve and Resequencing studies remains challenging. To facilitate the characterization of selection targets, we propose a new approach that reconstructs selected haplotypes from replicated time series, using Pool-Seq data. We identify selected haplotypes through the correlated frequencies of alleles carried by them. Computer simulations indicate that selected haplotype-blocks of several Mb can be reconstructed with high confidence and low error rates, even when allele frequencies change only by 20% across three replicates. Applying this method to real data from D. melanogaster populations adapting to a hot environment, we identify a selected haplotype-block of 6.93 Mb. We confirm the presence of this haplotype-block in evolved populations by experimental haplotyping, demonstrating the power and accuracy of our haplotype reconstruction from Pool-Seq data. We propose that the combination of allele frequency estimates with haplotype information will provide the key to understanding the dynamics of adaptive alleles. "}],"_id":"1195","date_updated":"2025-09-22T09:43:41Z","has_accepted_license":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","date_created":"2018-12-11T11:50:39Z","type":"journal_article","issue":"1","isi":1,"oa":1,"publication":"Molecular Biology and Evolution","volume":34,"publisher":"Oxford University Press","publication_status":"published","day":"03","status":"public","file":[{"date_updated":"2020-07-14T12:44:38Z","creator":"system","content_type":"application/pdf","checksum":"1e78d3aaffcb40dc8b02b7b4666019e0","file_size":295274,"access_level":"open_access","file_name":"IST-2017-770-v1+1_FranssenEtAl_nofigs-1.pdf","relation":"main_file","date_created":"2018-12-12T10:16:35Z","file_id":"5223"},{"file_name":"IST-2017-770-v1+2_Fig1.pdf","access_level":"open_access","file_size":10902625,"checksum":"e13171843283774404c936c581b4543e","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:38Z","file_id":"5224","date_created":"2018-12-12T10:16:36Z","relation":"main_file"},{"relation":"main_file","date_created":"2018-12-12T10:16:37Z","file_id":"5225","checksum":"63bc6e6e61f347594d8c00c37f874a0b","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:44:38Z","file_name":"IST-2017-770-v1+3_Fig2.pdf","access_level":"open_access","file_size":21437},{"access_level":"open_access","file_name":"IST-2017-770-v1+4_Fig3.pdf","file_size":1172194,"checksum":"da87cc7c78808837f22a3dae1c8397f9","content_type":"application/pdf","date_updated":"2020-07-14T12:44:38Z","creator":"system","file_id":"5226","date_created":"2018-12-12T10:16:38Z","relation":"main_file"},{"file_id":"5227","date_created":"2018-12-12T10:16:38Z","relation":"main_file","file_size":50045,"file_name":"IST-2017-770-v1+5_Fig4.pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:38Z","creator":"system","checksum":"e47b2a0c32142f423b3100150c0294f8","content_type":"application/pdf"},{"date_created":"2018-12-12T10:16:39Z","relation":"main_file","file_id":"5228","date_updated":"2020-07-14T12:44:38Z","creator":"system","checksum":"a5a7d6b32e7e17d35d337d7ec2a9f6c9","content_type":"application/pdf","file_size":50705,"access_level":"open_access","file_name":"IST-2017-770-v1+6_Fig5.pdf"}],"quality_controlled":"1","ddc":["576"],"external_id":{"isi":["000396772000009"]},"acknowledgement":"The authors thank all members of the Institute of Population\r\nGenetics for discussion and support on the project and par-\r\nticularly N. Barghi for helpful comments on earlier versions of\r\nthe  manuscript.  This  work  was  supported  by  the  European\r\nResearch Council (ERC) grants “ArchAdapt” and “250152”.","month":"10","doi":"10.1093/molbev/msw210","pubrep_id":"770","file_date_updated":"2020-07-14T12:44:38Z","project":[{"call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"publist_id":"6155","ec_funded":1},{"publist_id":"6153","license":"https://creativecommons.org/licenses/by/4.0/","month":"11","file_date_updated":"2020-07-14T12:44:38Z","doi":"10.1371/journal.pcbi.1005148","project":[{"name":"Sensitivity to higher-order statistics in natural scenes","grant_number":"P 25651-N26","call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","acknowledgement":"JSP was supported by a C.V. Starr Fellowship from the Starr Foundation (http://www.starrfoundation.org/). GT was supported by Austrian Research Foundation (https://www.fwf.ac.at/en/) grant FWF P25651. MJB received support from National Eye Institute (https://nei.nih.gov/) grant EY 14196 and from the National Science Foundation grant 1504977. The authors thank Cristina Savin and Vicent Botella-Soler for helpful comments on the manuscript.","external_id":{"isi":["000391230900008"]},"ddc":["570"],"volume":12,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication":"PLoS Computational Biology","publication_status":"published","publisher":"Public Library of Science","status":"public","day":"17","file":[{"file_id":"5884","date_created":"2019-01-25T10:35:00Z","relation":"main_file","file_name":"2016_PLOS_Prentice.pdf","access_level":"open_access","file_size":4492021,"checksum":"47b08cbd4dbf32b25ba161f5f4b262cc","content_type":"application/pdf","date_updated":"2020-07-14T12:44:38Z","creator":"kschuh"}],"date_created":"2018-12-11T11:50:40Z","oa_version":"Published Version","article_number":"e1005855","type":"journal_article","issue":"11","oa":1,"isi":1,"date_updated":"2025-09-22T09:43:12Z","_id":"1197","abstract":[{"lang":"eng","text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina."}],"department":[{"_id":"GaTk"}],"citation":{"apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., &#38; Berry, M. (2016). Error-robust modes of the retinal population code. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">https://doi.org/10.1371/journal.pcbi.1005148</a>","short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, PLoS Computational Biology 12 (2016).","mla":"Prentice, Jason, et al. “Error-Robust Modes of the Retinal Population Code.” <i>PLoS Computational Biology</i>, vol. 12, no. 11, e1005855, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">10.1371/journal.pcbi.1005148</a>.","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Error-robust modes of the retinal population code. <i>PLoS Computational Biology</i>. 2016;12(11). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">10.1371/journal.pcbi.1005148</a>","ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Error-robust modes of the retinal population code,” <i>PLoS Computational Biology</i>, vol. 12, no. 11. Public Library of Science, 2016.","chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Error-Robust Modes of the Retinal Population Code.” <i>PLoS Computational Biology</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">https://doi.org/10.1371/journal.pcbi.1005148</a>.","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2016. Error-robust modes of the retinal population code. PLoS Computational Biology. 12(11), e1005855."},"date_published":"2016-11-17T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","article_processing_charge":"No","year":"2016","intvolume":"        12","author":[{"first_name":"Jason","last_name":"Prentice","full_name":"Prentice, Jason"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"full_name":"Ioffe, Mark","first_name":"Mark","last_name":"Ioffe"},{"first_name":"Adrianna","last_name":"Loback","full_name":"Loback, Adrianna"},{"first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"},{"full_name":"Berry, Michael","last_name":"Berry","first_name":"Michael"}],"related_material":{"record":[{"relation":"research_data","id":"9709","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Error-robust modes of the retinal population code","scopus_import":"1"},{"volume":18,"publication":"Organic Letters","publication_status":"published","publisher":"American Chemical Society","status":"public","pmid":1,"day":"04","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"quality_controlled":"1","external_id":{"pmid":["26902154"]},"month":"03","doi":"10.1021/acs.orglett.6b00194","title":"Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","year":"2016","extern":"1","intvolume":"        18","author":[{"first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Kappe, C. Oliver","first_name":"C. Oliver","last_name":"Kappe"}],"article_type":"letter_note","date_updated":"2024-10-14T12:07:21Z","_id":"11983","abstract":[{"lang":"eng","text":"A continuous process for the synthesis and inline separation of anhydrous trifluoromethyl diazomethane in a single continuous flow process is presented. The diazo building block is generated from the corresponding amine and NaNO2 under acidic, aqueous conditions and subsequently diffuses through a gas-permeable membrane into an organic stream. To avoid storage and transportation of the hazardous compound, a representative downstream process in a packed-bed reactor yielding highly functionalized building blocks was developed."}],"page":"1076-1079","citation":{"chicago":"Pieber, Bartholomäus, and C. Oliver Kappe. “Generation and Synthetic Application of Trifluoromethyl Diazomethane Utilizing Continuous Flow Technologies.” <i>Organic Letters</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.orglett.6b00194\">https://doi.org/10.1021/acs.orglett.6b00194</a>.","ista":"Pieber B, Kappe CO. 2016. Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. Organic Letters. 18(5), 1076–1079.","ama":"Pieber B, Kappe CO. Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. <i>Organic Letters</i>. 2016;18(5):1076-1079. doi:<a href=\"https://doi.org/10.1021/acs.orglett.6b00194\">10.1021/acs.orglett.6b00194</a>","ieee":"B. Pieber and C. O. Kappe, “Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies,” <i>Organic Letters</i>, vol. 18, no. 5. American Chemical Society, pp. 1076–1079, 2016.","apa":"Pieber, B., &#38; Kappe, C. O. (2016). Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies. <i>Organic Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.orglett.6b00194\">https://doi.org/10.1021/acs.orglett.6b00194</a>","mla":"Pieber, Bartholomäus, and C. Oliver Kappe. “Generation and Synthetic Application of Trifluoromethyl Diazomethane Utilizing Continuous Flow Technologies.” <i>Organic Letters</i>, vol. 18, no. 5, American Chemical Society, 2016, pp. 1076–79, doi:<a href=\"https://doi.org/10.1021/acs.orglett.6b00194\">10.1021/acs.orglett.6b00194</a>.","short":"B. Pieber, C.O. Kappe, Organic Letters 18 (2016) 1076–1079."},"date_published":"2016-03-04T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2022-08-25T11:22:20Z","oa_version":"None","type":"journal_article","issue":"5"},{"doi":"10.1021/acs.oprd.5b00370","month":"02","language":[{"iso":"eng"}],"date_published":"2016-02-19T00:00:00Z","citation":{"ieee":"B. Pieber, D. P. Cox, and C. O. Kappe, “Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions,” <i>Organic Process Research and Development</i>, vol. 20, no. 2. American Chemical Society, pp. 376–385, 2016.","ama":"Pieber B, Cox DP, Kappe CO. Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. <i>Organic Process Research and Development</i>. 2016;20(2):376-385. doi:<a href=\"https://doi.org/10.1021/acs.oprd.5b00370\">10.1021/acs.oprd.5b00370</a>","ista":"Pieber B, Cox DP, Kappe CO. 2016. Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. Organic Process Research and Development. 20(2), 376–385.","chicago":"Pieber, Bartholomäus, D. Phillip Cox, and C. Oliver Kappe. “Selective Olefin Reduction in Thebaine Using Hydrazine Hydrate and O₂ under Intensified Continuous Flow Conditions.” <i>Organic Process Research and Development</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.oprd.5b00370\">https://doi.org/10.1021/acs.oprd.5b00370</a>.","short":"B. Pieber, D.P. Cox, C.O. Kappe, Organic Process Research and Development 20 (2016) 376–385.","mla":"Pieber, Bartholomäus, et al. “Selective Olefin Reduction in Thebaine Using Hydrazine Hydrate and O₂ under Intensified Continuous Flow Conditions.” <i>Organic Process Research and Development</i>, vol. 20, no. 2, American Chemical Society, 2016, pp. 376–85, doi:<a href=\"https://doi.org/10.1021/acs.oprd.5b00370\">10.1021/acs.oprd.5b00370</a>.","apa":"Pieber, B., Cox, D. P., &#38; Kappe, C. O. (2016). Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions. <i>Organic Process Research and Development</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.oprd.5b00370\">https://doi.org/10.1021/acs.oprd.5b00370</a>"},"page":"376-385","_id":"11985","abstract":[{"text":"Hydrocodone, a high value active pharmaceutical ingredient (API), is usually produced in a semisynthetic pathway from morphine, codeine or thebaine. The latter alkaloid is an attractive precursor as it is not used as a remedy itself. The key step in this production route is a selective olefin reduction forming 8,14-dihydrothebaine which can be subsequently hydrolyzed to yield hydrocodone. Unfortunately, standard hydrogenation procedures cannot be applied due to severe selectivity problems. A transfer hydrogenation using in situ generated diimide is the only known alternative to achieve a selective transformation. The most (atom) economic generation of this highly unstable reducing agent is by oxidizing hydrazine hydrate (N2H4·H2O) with O2. In the past, this route was “forbidden” on an industrial scale due to its enormous explosion potential in batch. A continuous high-temperature/high-pressure methodology allows an efficient, safe, and scalable processing of the hazardous reaction mixture. The industrially relevant reduction was achieved by using four consecutive liquid feeds (of N2H4·H2O) and residence time units, resulting in a highly selective reduction within less than 1 h.","lang":"eng"}],"date_updated":"2023-02-21T10:10:26Z","issue":"2","type":"journal_article","oa_version":"None","date_created":"2022-08-25T11:34:28Z","scopus_import":"1","publication_identifier":{"eissn":["1520-586X"],"issn":["1083-6160"]},"day":"19","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions","publisher":"American Chemical Society","publication_status":"published","publication":"Organic Process Research and Development","volume":20,"article_type":"original","quality_controlled":"1","intvolume":"        20","author":[{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","last_name":"Pieber","orcid":"0000-0001-8689-388X"},{"last_name":"Cox","first_name":"D. Phillip","full_name":"Cox, D. Phillip"},{"first_name":"C. Oliver","last_name":"Kappe","full_name":"Kappe, C. Oliver"}],"extern":"1","year":"2016","article_processing_charge":"No"},{"publication_identifier":{"issn":["0936-5214"],"eissn":["1437-2096"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction","status":"public","day":"04","publication_status":"published","publisher":"Georg Thieme Verlag","volume":27,"publication":"Synlett","article_type":"letter_note","quality_controlled":"1","author":[{"last_name":"Kappe","first_name":"C.","full_name":"Kappe, C."},{"first_name":"Julia","last_name":"Monteiro","full_name":"Monteiro, Julia"},{"orcid":"0000-0001-8689-388X","last_name":"Pieber","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Corrêa, Arlene","last_name":"Corrêa","first_name":"Arlene"}],"intvolume":"        27","extern":"1","article_processing_charge":"No","year":"2016","doi":"10.1055/s-0035-1560317","language":[{"iso":"eng"}],"month":"01","_id":"11988","date_updated":"2023-02-21T10:10:33Z","abstract":[{"lang":"eng","text":"A continuous Bucherer–Bergs hydantoin synthesis utilizing intensified conditions is reported. The methodology is characterized by a two-feed flow approach to independently feed the organic substrate and the aqueous reagent solution. The increased interfacial area of the biphasic reaction mixture and the lack of headspace enabled almost quantitative conversions within ca. 30 minutes at 120 °C and 20 bar even for unpolar starting materials. In addition, a selective N(3)-monoalkylation of the resulting heterocycles under batch microwave conditions is reported yielding potential acetylcholinesterase inhibitors."}],"date_published":"2016-01-04T00:00:00Z","citation":{"short":"C. Kappe, J. Monteiro, B. Pieber, A. Corrêa, Synlett 27 (2016) 83–87.","mla":"Kappe, C., et al. “Continuous Synthesis of Hydantoins: Intensifying the Bucherer–Bergs Reaction.” <i>Synlett</i>, vol. 27, no. 01, Georg Thieme Verlag, 2016, pp. 83–87, doi:<a href=\"https://doi.org/10.1055/s-0035-1560317\">10.1055/s-0035-1560317</a>.","apa":"Kappe, C., Monteiro, J., Pieber, B., &#38; Corrêa, A. (2016). Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. <i>Synlett</i>. Georg Thieme Verlag. <a href=\"https://doi.org/10.1055/s-0035-1560317\">https://doi.org/10.1055/s-0035-1560317</a>","ama":"Kappe C, Monteiro J, Pieber B, Corrêa A. Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. <i>Synlett</i>. 2016;27(01):83-87. doi:<a href=\"https://doi.org/10.1055/s-0035-1560317\">10.1055/s-0035-1560317</a>","ieee":"C. Kappe, J. Monteiro, B. Pieber, and A. Corrêa, “Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction,” <i>Synlett</i>, vol. 27, no. 01. Georg Thieme Verlag, pp. 83–87, 2016.","ista":"Kappe C, Monteiro J, Pieber B, Corrêa A. 2016. Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction. Synlett. 27(01), 83–87.","chicago":"Kappe, C., Julia Monteiro, Bartholomäus Pieber, and Arlene Corrêa. “Continuous Synthesis of Hydantoins: Intensifying the Bucherer–Bergs Reaction.” <i>Synlett</i>. Georg Thieme Verlag, 2016. <a href=\"https://doi.org/10.1055/s-0035-1560317\">https://doi.org/10.1055/s-0035-1560317</a>."},"page":"83-87","issue":"01","type":"journal_article","oa_version":"None","date_created":"2022-08-25T11:52:22Z"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze","scopus_import":"1","author":[{"full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0001-5116-955X","last_name":"Hilbe"},{"full_name":"Traulsen, Arne","first_name":"Arne","last_name":"Traulsen"}],"intvolume":"        19","article_processing_charge":"No","year":"2016","date_updated":"2025-09-22T09:42:11Z","_id":"1200","department":[{"_id":"KrCh"}],"citation":{"apa":"Hilbe, C., &#38; Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>","short":"C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31.","mla":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” <i>Physics of Life Reviews</i>, vol. 19, Elsevier, 2016, pp. 29–31, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>.","ieee":"C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” <i>Physics of Life Reviews</i>, vol. 19. Elsevier, pp. 29–31, 2016.","ama":"Hilbe C, Traulsen A. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. <i>Physics of Life Reviews</i>. 2016;19:29-31. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>","chicago":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>.","ista":"Hilbe C, Traulsen A. 2016. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 19, 29–31."},"page":"29 - 31","date_published":"2016-12-01T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","oa":1,"isi":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:50:40Z","type":"journal_article","status":"public","day":"01","file":[{"file_size":171352,"file_name":"IST-2017-798-v1+1_comment_adami.pdf","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:44:39Z","checksum":"95e6dc78278334b99dacbf8822509364","content_type":"application/pdf","file_id":"4855","date_created":"2018-12-12T10:11:02Z","relation":"main_file"}],"volume":19,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication":"Physics of Life Reviews","publication_status":"published","publisher":"Elsevier","quality_controlled":"1","acknowledgement":"C.H. acknowledges generous support from the ISTFELLOW program.","ddc":["530"],"external_id":{"isi":["000390640200003"]},"file_date_updated":"2020-07-14T12:44:39Z","pubrep_id":"798","doi":"10.1016/j.plrev.2016.10.004","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"12","ec_funded":1,"publist_id":"6150"},{"day":"01","status":"public","publication":"Cell","volume":167,"publisher":"Cell Press","publication_status":"published","quality_controlled":"1","external_id":{"isi":["000389470500007"]},"doi":"10.1016/j.cell.2016.11.024","month":"12","publist_id":"6149","title":"Formin’ a nuclear protection","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","intvolume":"       167","author":[{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg","last_name":"Renkawitz","orcid":"0000-0003-2856-3369","first_name":"Jörg"},{"first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"year":"2016","article_processing_charge":"No","citation":{"short":"J. Renkawitz, M.K. Sixt, Cell 167 (2016) 1448–1449.","mla":"Renkawitz, Jörg, and Michael K. Sixt. “Formin’ a Nuclear Protection.” <i>Cell</i>, vol. 167, no. 6, Cell Press, 2016, pp. 1448–49, doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.024\">10.1016/j.cell.2016.11.024</a>.","apa":"Renkawitz, J., &#38; Sixt, M. K. (2016). Formin’ a nuclear protection. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2016.11.024\">https://doi.org/10.1016/j.cell.2016.11.024</a>","ama":"Renkawitz J, Sixt MK. Formin’ a nuclear protection. <i>Cell</i>. 2016;167(6):1448-1449. doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.024\">10.1016/j.cell.2016.11.024</a>","ieee":"J. Renkawitz and M. K. Sixt, “Formin’ a nuclear protection,” <i>Cell</i>, vol. 167, no. 6. Cell Press, pp. 1448–1449, 2016.","ista":"Renkawitz J, Sixt MK. 2016. Formin’ a nuclear protection. Cell. 167(6), 1448–1449.","chicago":"Renkawitz, Jörg, and Michael K Sixt. “Formin’ a Nuclear Protection.” <i>Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cell.2016.11.024\">https://doi.org/10.1016/j.cell.2016.11.024</a>."},"date_published":"2016-12-01T00:00:00Z","page":"1448 - 1449","department":[{"_id":"MiSi"}],"abstract":[{"lang":"eng","text":"In this issue of Cell, Skau et al. show that the formin FMN2 organizes a perinuclear actin cytoskeleton that protects the nucleus and its genomic content of migrating cells squeezing through small spaces."}],"_id":"1201","date_updated":"2025-09-22T09:41:33Z","language":[{"iso":"eng"}],"issue":"6","isi":1,"date_created":"2018-12-11T11:50:41Z","oa_version":"None","type":"journal_article"},{"isi":1,"oa":1,"issue":"4","type":"journal_article","oa_version":"Published Version","date_created":"2018-12-11T11:50:41Z","has_accepted_license":"1","language":[{"iso":"eng"}],"page":"254 - 261","citation":{"chicago":"Milutinovic, Barbara, Robert Peuß, Kevin Ferro, and Joachim Kurtz. “Immune Priming in Arthropods: An Update Focusing on the Red Flour Beetle.” <i>Zoology </i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.zool.2016.03.006\">https://doi.org/10.1016/j.zool.2016.03.006</a>.","ista":"Milutinovic B, Peuß R, Ferro K, Kurtz J. 2016. Immune priming in arthropods: an update focusing on the red flour beetle. Zoology . 119(4), 254–261.","ama":"Milutinovic B, Peuß R, Ferro K, Kurtz J. Immune priming in arthropods: an update focusing on the red flour beetle. <i>Zoology </i>. 2016;119(4):254-261. doi:<a href=\"https://doi.org/10.1016/j.zool.2016.03.006\">10.1016/j.zool.2016.03.006</a>","ieee":"B. Milutinovic, R. Peuß, K. Ferro, and J. Kurtz, “Immune priming in arthropods: an update focusing on the red flour beetle,” <i>Zoology </i>, vol. 119, no. 4. Elsevier, pp. 254–261, 2016.","apa":"Milutinovic, B., Peuß, R., Ferro, K., &#38; Kurtz, J. (2016). Immune priming in arthropods: an update focusing on the red flour beetle. <i>Zoology </i>. Elsevier. <a href=\"https://doi.org/10.1016/j.zool.2016.03.006\">https://doi.org/10.1016/j.zool.2016.03.006</a>","short":"B. Milutinovic, R. Peuß, K. Ferro, J. Kurtz, Zoology  119 (2016) 254–261.","mla":"Milutinovic, Barbara, et al. “Immune Priming in Arthropods: An Update Focusing on the Red Flour Beetle.” <i>Zoology </i>, vol. 119, no. 4, Elsevier, 2016, pp. 254–61, doi:<a href=\"https://doi.org/10.1016/j.zool.2016.03.006\">10.1016/j.zool.2016.03.006</a>."},"date_published":"2016-08-01T00:00:00Z","department":[{"_id":"SyCr"}],"date_updated":"2025-09-22T09:41:02Z","_id":"1202","intvolume":"       119","author":[{"last_name":"Milutinovic","orcid":"0000-0002-8214-4758","first_name":"Barbara","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara"},{"first_name":"Robert","last_name":"Peuß","full_name":"Peuß, Robert"},{"first_name":"Kevin","last_name":"Ferro","full_name":"Ferro, Kevin"},{"first_name":"Joachim","last_name":"Kurtz","full_name":"Kurtz, Joachim"}],"year":"2016","article_processing_charge":"No","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Immune priming in arthropods: an update focusing on the red flour beetle","publist_id":"6147","project":[{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"}],"doi":"10.1016/j.zool.2016.03.006","file_date_updated":"2020-07-14T12:44:39Z","month":"08","ddc":["570"],"external_id":{"isi":["000384958500003"]},"acknowledgement":"The authors thank Sophie A.O. Armitage and Jan N. Offenborn for helpful comments on the figures, and two anonymous reviewers for their helpful comments. The project was funded by the Deutsche Forschungsgemeinschaft (DFG, KU 1929/4-2) within the priority programme SPP 1399 “Host–Parasite Coevolution”.","quality_controlled":"1","file":[{"relation":"main_file","date_created":"2019-01-25T13:00:20Z","file_id":"5885","date_updated":"2020-07-14T12:44:39Z","creator":"kschuh","checksum":"8396d5bd95f9c4295857162f902afabf","content_type":"application/pdf","file_size":1473211,"file_name":"2016_Elsevier_Milutinovic.pdf","access_level":"open_access"}],"day":"01","status":"public","publisher":"Elsevier","publication_status":"published","publication":"Zoology ","volume":119,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"}},{"status":"public","day":"01","volume":54,"publication":"Journal of Clinical Microbiology","publication_status":"published","publisher":"American Society for Microbiology","quality_controlled":"1","acknowledgement":"We are grateful to ABCs for providing strains and the Bacterial Meningitis Laboratory for technical support.","external_id":{"isi":["000389209600026"]},"doi":"10.1128/JCM.01511-16","month":"12","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5121393/","open_access":"1"}],"publist_id":"6146","title":"Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","intvolume":"        54","author":[{"full_name":"Hu, Fang","first_name":"Fang","last_name":"Hu"},{"last_name":"Rishishwar","first_name":"Lavanya","full_name":"Rishishwar, Lavanya"},{"full_name":"Sivadas, Ambily","last_name":"Sivadas","first_name":"Ambily"},{"last_name":"Mitchell","first_name":"Gabriel","full_name":"Mitchell, Gabriel","id":"315BCD80-F248-11E8-B48F-1D18A9856A87"},{"last_name":"King","first_name":"Jordan","full_name":"King, Jordan"},{"full_name":"Murphy, Timothy","first_name":"Timothy","last_name":"Murphy"},{"full_name":"Gilsdorf, Janet","first_name":"Janet","last_name":"Gilsdorf"},{"full_name":"Mayer, Leonard","last_name":"Mayer","first_name":"Leonard"},{"first_name":"Xin","last_name":"Wang","full_name":"Wang, Xin"}],"article_processing_charge":"No","year":"2016","date_updated":"2025-09-22T09:40:28Z","_id":"1203","abstract":[{"lang":"eng","text":"Haemophilus haemolyticus has been recently discovered to have the potential to cause invasive disease. It is closely related to nontypeable Haemophilus influenzae (NT H. influenzae). NT H. influenzae and H. haemolyticus are often misidentified because none of the existing tests targeting the known phenotypes of H. haemolyticus are able to specifically identify H. haemolyticus. Through comparative genomic analysis of H. haemolyticus and NT H. influenzae, we identified genes unique to H. haemolyticus that can be used as targets for the identification of H. haemolyticus. A real-time PCR targeting purT (encoding phosphoribosylglycinamide formyltransferase 2 in the purine synthesis pathway) was developed and evaluated. The lower limit of detection was 40 genomes/PCR; the sensitivity and specificity in detecting H. haemolyticus were 98.9% and 97%, respectively. To improve the discrimination of H. haemolyticus and NT H. influenzae, a testing scheme combining two targets (H. haemolyticus purT and H. influenzae hpd, encoding protein D lipoprotein) was also evaluated and showed 96.7% sensitivity and 98.2% specificity for the identification of H. haemolyticus and 92.8% sensitivity and 100% specificity for the identification of H. influenzae, respectively. The dual-target testing scheme can be used for the diagnosis and surveillance of infection and disease caused by H. haemolyticus and NT H. influenzae."}],"department":[{"_id":"GaTk"}],"citation":{"ieee":"F. Hu <i>et al.</i>, “Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination,” <i>Journal of Clinical Microbiology</i>, vol. 54, no. 12. American Society for Microbiology, pp. 3010–3017, 2016.","ama":"Hu F, Rishishwar L, Sivadas A, et al. Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination. <i>Journal of Clinical Microbiology</i>. 2016;54(12):3010-3017. doi:<a href=\"https://doi.org/10.1128/JCM.01511-16\">10.1128/JCM.01511-16</a>","ista":"Hu F, Rishishwar L, Sivadas A, Mitchell G, King J, Murphy T, Gilsdorf J, Mayer L, Wang X. 2016. Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination. Journal of Clinical Microbiology. 54(12), 3010–3017.","chicago":"Hu, Fang, Lavanya Rishishwar, Ambily Sivadas, Gabriel Mitchell, Jordan King, Timothy Murphy, Janet Gilsdorf, Leonard Mayer, and Xin Wang. “Comparative Genomic Analysis of Haemophilus Haemolyticus and Nontypeable Haemophilus Influenzae and a New Testing Scheme for Their Discrimination.” <i>Journal of Clinical Microbiology</i>. American Society for Microbiology, 2016. <a href=\"https://doi.org/10.1128/JCM.01511-16\">https://doi.org/10.1128/JCM.01511-16</a>.","mla":"Hu, Fang, et al. “Comparative Genomic Analysis of Haemophilus Haemolyticus and Nontypeable Haemophilus Influenzae and a New Testing Scheme for Their Discrimination.” <i>Journal of Clinical Microbiology</i>, vol. 54, no. 12, American Society for Microbiology, 2016, pp. 3010–17, doi:<a href=\"https://doi.org/10.1128/JCM.01511-16\">10.1128/JCM.01511-16</a>.","short":"F. Hu, L. Rishishwar, A. Sivadas, G. Mitchell, J. King, T. Murphy, J. Gilsdorf, L. Mayer, X. Wang, Journal of Clinical Microbiology 54 (2016) 3010–3017.","apa":"Hu, F., Rishishwar, L., Sivadas, A., Mitchell, G., King, J., Murphy, T., … Wang, X. (2016). Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination. <i>Journal of Clinical Microbiology</i>. American Society for Microbiology. <a href=\"https://doi.org/10.1128/JCM.01511-16\">https://doi.org/10.1128/JCM.01511-16</a>"},"page":"3010 - 3017","date_published":"2016-12-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"12","oa":1,"isi":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:50:41Z","type":"journal_article"},{"article_processing_charge":"No","year":"2016","author":[{"last_name":"Amir","first_name":"Ariel","full_name":"Amir, Ariel"},{"first_name":"Mikhail","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tokieda, Tadashi","first_name":"Tadashi","last_name":"Tokieda"}],"intvolume":"       123","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Surprises in numerical expressions of physical constants","type":"journal_article","oa_version":"Preprint","date_created":"2018-12-11T11:50:42Z","isi":1,"oa":1,"issue":"6","language":[{"iso":"eng"}],"_id":"1204","date_updated":"2025-09-22T09:39:09Z","abstract":[{"text":"In science, as in life, &quot;surprises&quot; can be adequately appreciated only in the presence of a null model, what we expect a priori. In physics, theories sometimes express the values of dimensionless physical constants as combinations of mathematical constants like π or e. The inverse problem also arises, whereby the measured value of a physical constant admits a &quot;surprisingly&quot; simple approximation in terms of well-known mathematical constants. Can we estimate the probability for this to be a mere coincidence, rather than an inkling of some theory? We answer the question in the most naive form.","lang":"eng"}],"date_published":"2016-06-01T00:00:00Z","citation":{"short":"A. Amir, M. Lemeshko, T. Tokieda, American Mathematical Monthly 123 (2016) 609–612.","mla":"Amir, Ariel, et al. “Surprises in Numerical Expressions of Physical Constants.” <i>American Mathematical Monthly</i>, vol. 123, no. 6, Mathematical Association of America, 2016, pp. 609–12, doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.123.6.609\">10.4169/amer.math.monthly.123.6.609</a>.","apa":"Amir, A., Lemeshko, M., &#38; Tokieda, T. (2016). Surprises in numerical expressions of physical constants. <i>American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.4169/amer.math.monthly.123.6.609\">https://doi.org/10.4169/amer.math.monthly.123.6.609</a>","ama":"Amir A, Lemeshko M, Tokieda T. Surprises in numerical expressions of physical constants. <i>American Mathematical Monthly</i>. 2016;123(6):609-612. doi:<a href=\"https://doi.org/10.4169/amer.math.monthly.123.6.609\">10.4169/amer.math.monthly.123.6.609</a>","ieee":"A. Amir, M. Lemeshko, and T. Tokieda, “Surprises in numerical expressions of physical constants,” <i>American Mathematical Monthly</i>, vol. 123, no. 6. Mathematical Association of America, pp. 609–612, 2016.","ista":"Amir A, Lemeshko M, Tokieda T. 2016. Surprises in numerical expressions of physical constants. American Mathematical Monthly. 123(6), 609–612.","chicago":"Amir, Ariel, Mikhail Lemeshko, and Tadashi Tokieda. “Surprises in Numerical Expressions of Physical Constants.” <i>American Mathematical Monthly</i>. Mathematical Association of America, 2016. <a href=\"https://doi.org/10.4169/amer.math.monthly.123.6.609\">https://doi.org/10.4169/amer.math.monthly.123.6.609</a>."},"department":[{"_id":"MiLe"}],"page":"609 - 612","external_id":{"arxiv":["1603.00299"],"isi":["000381754900010"]},"quality_controlled":"1","publication_status":"published","publisher":"Mathematical Association of America","volume":123,"publication":"American Mathematical Monthly","arxiv":1,"status":"public","day":"01","publist_id":"6143","main_file_link":[{"url":"https://arxiv.org/abs/1603.00299","open_access":"1"}],"month":"06","doi":"10.4169/amer.math.monthly.123.6.609"},{"acknowledgement":"This research is sponsored in part by NSFC Program (No. 91218302, No. 61527812), National Science and Technology Major Project (No. 2016ZX01038101), Tsinghua University Initiative Scientific Research Program (20131089331), MIIT IT funds (Research and application of TCN key technologies) of China, and the National Key Technology R&D Program (No. 2015BAG14B01-02), Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23.\r\n","external_id":{"isi":["000389793300047"]},"ddc":["004"],"quality_controlled":"1","file":[{"file_id":"4673","date_created":"2018-12-12T10:08:13Z","relation":"main_file","access_level":"open_access","file_name":"IST-2017-783-v1+1_FM-Safety-Assured-Development-of-MVBC.pdf","file_size":281501,"content_type":"application/pdf","checksum":"fea0b3fae9a2a42e8bfec59840e30d8c","creator":"system","date_updated":"2020-07-14T12:44:39Z"}],"status":"public","day":"08","publication_status":"published","publisher":"Springer","volume":9995,"publist_id":"6144","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"pubrep_id":"783","file_date_updated":"2020-07-14T12:44:39Z","doi":"10.1007/978-3-319-48989-6_47","month":"11","related_material":{"record":[{"relation":"later_version","id":"434","status":"public"}]},"intvolume":"      9995","author":[{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"last_name":"Liu","first_name":"Han","full_name":"Liu, Han"},{"full_name":"Song, Houbing","last_name":"Song","first_name":"Houbing"},{"last_name":"Kong","orcid":"0000-0002-3066-6941","first_name":"Hui","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gu, Ming","last_name":"Gu","first_name":"Ming"},{"last_name":"Sun","first_name":"Jiaguang","full_name":"Sun, Jiaguang"},{"last_name":"Sha","first_name":"Lui","full_name":"Sha, Lui"}],"article_processing_charge":"No","year":"2016","scopus_import":"1","title":"Safety assured formal model driven design of the multifunction vehicle bus controller","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"name":"FM: Formal Methods","end_date":"2016-11-11","start_date":"2016-11-09","location":"Limassol, Cyprus"},"alternative_title":["LNCS"],"isi":1,"oa":1,"type":"conference","oa_version":"Submitted Version","date_created":"2018-12-11T11:50:42Z","language":[{"iso":"eng"}],"has_accepted_license":"1","_id":"1205","abstract":[{"lang":"eng","text":"In this paper, we present a formal model-driven engineering approach to establishing a safety-assured implementation of Multifunction vehicle bus controller (MVBC) based on the generic reference models and requirements described in the International Electrotechnical Commission (IEC) standard IEC-61375. First, the generic models described in IEC-61375 are translated into a network of timed automata, and some safety requirements tested in IEC-61375 are formalized as timed computation tree logic (TCTL) formulas. With the help of Uppaal, we check and debug whether the timed automata satisfy the formulas or not. Within this step, several logic inconsistencies in the original standard are detected and corrected. Then, we apply the tool Times to generate C code from the verified model, which was later synthesized into a real MVBC chip. Finally, the runtime verification tool RMOR is applied to verify some safety requirements at the implementation level. We set up a real platform with worldwide mostly used MVBC D113, and verify the correctness and the scalability of the synthesized MVBC chip more comprehensively. The errors in the standard has been confirmed and the resulted MVBC has been deployed in real train communication network."}],"date_updated":"2025-09-22T09:39:55Z","page":"757 - 763","citation":{"apa":"Jiang, Y., Liu, H., Song, H., Kong, H., Gu, M., Sun, J., &#38; Sha, L. (2016). Safety assured formal model driven design of the multifunction vehicle bus controller (Vol. 9995, pp. 757–763). Presented at the FM: Formal Methods, Limassol, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-319-48989-6_47\">https://doi.org/10.1007/978-3-319-48989-6_47</a>","short":"Y. Jiang, H. Liu, H. Song, H. Kong, M. Gu, J. Sun, L. Sha, in:, Springer, 2016, pp. 757–763.","mla":"Jiang, Yu, et al. <i>Safety Assured Formal Model Driven Design of the Multifunction Vehicle Bus Controller</i>. Vol. 9995, Springer, 2016, pp. 757–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-48989-6_47\">10.1007/978-3-319-48989-6_47</a>.","ieee":"Y. Jiang <i>et al.</i>, “Safety assured formal model driven design of the multifunction vehicle bus controller,” presented at the FM: Formal Methods, Limassol, Cyprus, 2016, vol. 9995, pp. 757–763.","ama":"Jiang Y, Liu H, Song H, et al. Safety assured formal model driven design of the multifunction vehicle bus controller. In: Vol 9995. Springer; 2016:757-763. doi:<a href=\"https://doi.org/10.1007/978-3-319-48989-6_47\">10.1007/978-3-319-48989-6_47</a>","chicago":"Jiang, Yu, Han Liu, Houbing Song, Hui Kong, Ming Gu, Jiaguang Sun, and Lui Sha. “Safety Assured Formal Model Driven Design of the Multifunction Vehicle Bus Controller,” 9995:757–63. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48989-6_47\">https://doi.org/10.1007/978-3-319-48989-6_47</a>.","ista":"Jiang Y, Liu H, Song H, Kong H, Gu M, Sun J, Sha L. 2016. Safety assured formal model driven design of the multifunction vehicle bus controller. FM: Formal Methods, LNCS, vol. 9995, 757–763."},"department":[{"_id":"ToHe"}],"date_published":"2016-11-08T00:00:00Z"},{"language":[{"iso":"eng"}],"abstract":[{"text":"We study a polar molecule immersed in a superfluid environment, such as a helium nanodroplet or a Bose–Einstein condensate, in the presence of a strong electrostatic field. We show that coupling of the molecular pendular motion, induced by the field, to the fluctuating bath leads to formation of pendulons—spherical harmonic librators dressed by a field of many-particle excitations. We study the behavior of the pendulon in a broad range of molecule–bath and molecule–field interaction strengths, and reveal that its spectrum features a series of instabilities which are absent in the field-free case of the angulon quasiparticle. Furthermore, we show that an external field allows to fine-tune the positions of these instabilities in the molecular rotational spectrum. This opens the door to detailed experimental studies of redistribution of orbital angular momentum in many-particle systems. © 2016 Wiley-VCH Verlag GmbH &amp; Co. KGaA, Weinheim","lang":"eng"}],"_id":"1206","date_updated":"2025-09-22T09:38:39Z","date_published":"2016-09-18T00:00:00Z","page":"3649 - 3654","citation":{"chicago":"Redchenko, Elena, and Mikhail Lemeshko. “Libration of Strongly Oriented Polar Molecules inside a Superfluid.” <i>ChemPhysChem</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1002/cphc.201601042\">https://doi.org/10.1002/cphc.201601042</a>.","ista":"Redchenko E, Lemeshko M. 2016. Libration of strongly oriented polar molecules inside a superfluid. ChemPhysChem. 17(22), 3649–3654.","ieee":"E. Redchenko and M. Lemeshko, “Libration of strongly oriented polar molecules inside a superfluid,” <i>ChemPhysChem</i>, vol. 17, no. 22. Wiley-Blackwell, pp. 3649–3654, 2016.","ama":"Redchenko E, Lemeshko M. Libration of strongly oriented polar molecules inside a superfluid. <i>ChemPhysChem</i>. 2016;17(22):3649-3654. doi:<a href=\"https://doi.org/10.1002/cphc.201601042\">10.1002/cphc.201601042</a>","apa":"Redchenko, E., &#38; Lemeshko, M. (2016). Libration of strongly oriented polar molecules inside a superfluid. <i>ChemPhysChem</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/cphc.201601042\">https://doi.org/10.1002/cphc.201601042</a>","mla":"Redchenko, Elena, and Mikhail Lemeshko. “Libration of Strongly Oriented Polar Molecules inside a Superfluid.” <i>ChemPhysChem</i>, vol. 17, no. 22, Wiley-Blackwell, 2016, pp. 3649–54, doi:<a href=\"https://doi.org/10.1002/cphc.201601042\">10.1002/cphc.201601042</a>.","short":"E. Redchenko, M. Lemeshko, ChemPhysChem 17 (2016) 3649–3654."},"department":[{"_id":"JoFi"},{"_id":"MiLe"}],"oa":1,"isi":1,"issue":"22","type":"journal_article","date_created":"2018-12-11T11:50:43Z","oa_version":"Preprint","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Libration of strongly oriented polar molecules inside a superfluid","intvolume":"        17","author":[{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","full_name":"Redchenko, Elena","last_name":"Redchenko","first_name":"Elena"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","year":"2016","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"doi":"10.1002/cphc.201601042","month":"09","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1609.08161","open_access":"1"}],"publist_id":"6140","arxiv":1,"status":"public","day":"18","publication_status":"published","publisher":"Wiley-Blackwell","volume":17,"publication":"ChemPhysChem","external_id":{"arxiv":["1609.08161"],"isi":["000388625000008"]},"quality_controlled":"1"},{"external_id":{"isi":["000388875500026"]},"acknowledgement":"J.A.S supported in part by a Medical Research D.G.Council UK Ph.D. fellowship.\r\nThis work was supported in part by European Union's 2020 Research and Innovation Program under Grant 701309. \r\n","quality_controlled":"1","publisher":"American Society for Biochemistry and Molecular Biology","publication_status":"published","publication":"Journal of Biological Chemistry","volume":291,"day":"18","status":"public","corr_author":"1","publist_id":"6139","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5114416/"}],"month":"11","project":[{"_id":"2593EBD6-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes"},{"call_identifier":"H2020","grant_number":"701309","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"doi":"10.1074/jbc.M116.735142","year":"2016","article_processing_charge":"No","intvolume":"       291","author":[{"id":"322DA418-F248-11E8-B48F-1D18A9856A87","full_name":"Letts, James A","first_name":"James A","orcid":"0000-0002-9864-3586","last_name":"Letts"},{"full_name":"Degliesposti, Gianluca","last_name":"Degliesposti","first_name":"Gianluca"},{"last_name":"Fiedorczuk","first_name":"Karol","full_name":"Fiedorczuk, Karol","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0"},{"last_name":"Skehel","first_name":"Mark","full_name":"Skehel, Mark"},{"full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","last_name":"Sazanov","first_name":"Leonid A"}],"scopus_import":"1","title":"Purification of ovine respiratory complex i results in a highly active and stable preparation","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","oa_version":"Submitted Version","date_created":"2018-12-11T11:50:44Z","oa":1,"isi":1,"issue":"47","language":[{"iso":"eng"}],"department":[{"_id":"LeSa"}],"date_published":"2016-11-18T00:00:00Z","citation":{"chicago":"Letts, James A, Gianluca Degliesposti, Karol Fiedorczuk, Mark Skehel, and Leonid A Sazanov. “Purification of Ovine Respiratory Complex i Results in a Highly Active and Stable Preparation.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2016. <a href=\"https://doi.org/10.1074/jbc.M116.735142\">https://doi.org/10.1074/jbc.M116.735142</a>.","ista":"Letts JA, Degliesposti G, Fiedorczuk K, Skehel M, Sazanov LA. 2016. Purification of ovine respiratory complex i results in a highly active and stable preparation. Journal of Biological Chemistry. 291(47), 24657–24675.","ama":"Letts JA, Degliesposti G, Fiedorczuk K, Skehel M, Sazanov LA. Purification of ovine respiratory complex i results in a highly active and stable preparation. <i>Journal of Biological Chemistry</i>. 2016;291(47):24657-24675. doi:<a href=\"https://doi.org/10.1074/jbc.M116.735142\">10.1074/jbc.M116.735142</a>","ieee":"J. A. Letts, G. Degliesposti, K. Fiedorczuk, M. Skehel, and L. A. Sazanov, “Purification of ovine respiratory complex i results in a highly active and stable preparation,” <i>Journal of Biological Chemistry</i>, vol. 291, no. 47. American Society for Biochemistry and Molecular Biology, pp. 24657–24675, 2016.","apa":"Letts, J. A., Degliesposti, G., Fiedorczuk, K., Skehel, M., &#38; Sazanov, L. A. (2016). Purification of ovine respiratory complex i results in a highly active and stable preparation. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M116.735142\">https://doi.org/10.1074/jbc.M116.735142</a>","mla":"Letts, James A., et al. “Purification of Ovine Respiratory Complex i Results in a Highly Active and Stable Preparation.” <i>Journal of Biological Chemistry</i>, vol. 291, no. 47, American Society for Biochemistry and Molecular Biology, 2016, pp. 24657–75, doi:<a href=\"https://doi.org/10.1074/jbc.M116.735142\">10.1074/jbc.M116.735142</a>.","short":"J.A. Letts, G. Degliesposti, K. Fiedorczuk, M. Skehel, L.A. Sazanov, Journal of Biological Chemistry 291 (2016) 24657–24675."},"page":"24657 - 24675","abstract":[{"text":"NADH-ubiquinone oxidoreductase (complex I) is the largest (∼1 MDa) and the least characterized complex of the mitochondrial electron transport chain. Because of the ease of sample availability, previous work has focused almost exclusively on bovine complex I. However, only medium resolution structural analyses of this complex have been reported. Working with other mammalian complex I homologues is a potential approach for overcoming these limitations. Due to the inherent difficulty of expressing large membrane protein complexes, screening of complex I homologues is limited to large mammals reared for human consumption. The high sequence identity among these available sources may preclude the benefits of screening. Here, we report the characterization of complex I purified from Ovis aries (ovine) heart mitochondria. All 44 unique subunits of the intact complex were identified by mass spectrometry. We identified differences in the subunit composition of subcomplexes of ovine complex I as compared with bovine, suggesting differential stability of inter-subunit interactions within the complex. Furthermore, the 42-kDa subunit, which is easily lost from the bovine enzyme, remains tightly bound to ovine complex I. Additionally, we developed a novel purification protocol for highly active and stable mitochondrial complex I using the branched-chain detergent lauryl maltose neopentyl glycol. Our data demonstrate that, although closely related, significant differences exist between the biochemical properties of complex I prepared from ovine and bovine mitochondria and that ovine complex I represents a suitable alternative target for further structural studies. ","lang":"eng"}],"_id":"1209","date_updated":"2025-09-22T09:38:04Z"},{"language":[{"iso":"eng"}],"month":"11","_id":"1210","abstract":[{"text":"Mechanisms for cell protection are essential for survival of multicellular organisms. In plants, the apical hook, which is transiently formed in darkness when the germinating seedling penetrates towards the soil surface, plays such protective role and shields the vitally important shoot apical meristem and cotyledons from damage. The apical hook is formed by bending of the upper hypocotyl soon after germination, and it is maintained in a closed stage while the hypocotyl continues to penetrate through the soil and rapidly opens when exposed to light in proximity of the soil surface. To uncover the complex molecular network orchestrating this spatiotemporally tightly coordinated process, monitoring of the apical hook development in real time is indispensable. Here we describe an imaging platform that enables high-resolution kinetic analysis of this dynamic developmental process. © Springer Science+Business Media New York 2017.","lang":"eng"}],"date_updated":"2021-01-12T06:49:07Z","citation":{"apa":"Zhu, Q., Žádníková, P., Smet, D., Van Der Straeten, D., &#38; Benková, E. (2016). Real time analysis of the apical hook development. In <i>Plant Hormones</i> (Vol. 1497, pp. 1–8). Humana Press. <a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">https://doi.org/10.1007/978-1-4939-6469-7_1</a>","mla":"Zhu, Qiang, et al. “Real Time Analysis of the Apical Hook Development.” <i>Plant Hormones</i>, vol. 1497, Humana Press, 2016, pp. 1–8, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">10.1007/978-1-4939-6469-7_1</a>.","short":"Q. Zhu, P. Žádníková, D. Smet, D. Van Der Straeten, E. Benková, in:, Plant Hormones, Humana Press, 2016, pp. 1–8.","ieee":"Q. Zhu, P. Žádníková, D. Smet, D. Van Der Straeten, and E. Benková, “Real time analysis of the apical hook development,” in <i>Plant Hormones</i>, vol. 1497, Humana Press, 2016, pp. 1–8.","ama":"Zhu Q, Žádníková P, Smet D, Van Der Straeten D, Benková E. Real time analysis of the apical hook development. In: <i>Plant Hormones</i>. Vol 1497. Humana Press; 2016:1-8. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">10.1007/978-1-4939-6469-7_1</a>","chicago":"Zhu, Qiang, Petra Žádníková, Dajo Smet, Dominique Van Der Straeten, and Eva Benková. “Real Time Analysis of the Apical Hook Development.” In <i>Plant Hormones</i>, 1497:1–8. Humana Press, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">https://doi.org/10.1007/978-1-4939-6469-7_1</a>.","ista":"Zhu Q, Žádníková P, Smet D, Van Der Straeten D, Benková E. 2016.Real time analysis of the apical hook development. In: Plant Hormones. Methods in Molecular Biology, vol. 1497, 1–8."},"department":[{"_id":"EvBe"}],"date_published":"2016-11-19T00:00:00Z","page":"1 - 8","doi":"10.1007/978-1-4939-6469-7_1","type":"book_chapter","publist_id":"6135","date_created":"2018-12-11T11:50:44Z","oa_version":"None","publication_status":"published","alternative_title":["Methods in Molecular Biology"],"publisher":"Humana Press","volume":1497,"publication":"Plant Hormones","scopus_import":1,"title":"Real time analysis of the apical hook development","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","day":"19","year":"2016","acknowledgement":"We thank Herman  \r\nHöfte \r\n, Todor Asenov, Robert Hauschield, and \r\nMarcal  Gallemi  for  help  with  the  establishment  of  the  real-time  \r\nimaging platform and technical support. This work was supported \r\nby the Czech Science Foundation (GA13-39982S) to Eva Benková. \r\nDominique   Van   Der   Straeten   acknowledges   the   Research   \r\nFoundation  Flanders  for  fi\r\n  nancial  support  (G.0656.13N).  Dajo  \r\nSmet holds a PhD fellowship of the Research Foundation Flanders. ","quality_controlled":"1","intvolume":"      1497","author":[{"first_name":"Qiang","last_name":"Zhu","id":"40A4B9E6-F248-11E8-B48F-1D18A9856A87","full_name":"Zhu, Qiang"},{"full_name":"Žádníková, Petra","first_name":"Petra","last_name":"Žádníková"},{"first_name":"Dajo","last_name":"Smet","full_name":"Smet, Dajo"},{"full_name":"Van Der Straeten, Dominique","last_name":"Van Der Straeten","first_name":"Dominique"},{"orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva"}]}]