@article{6867, abstract = {A novel magnetic scratch method achieves repeatability, reproducibility and geometric control greater than pipette scratch assays and closely approximating the precision of cell exclusion assays while inducing the cell injury inherently necessary for wound healing assays. The magnetic scratch is affordable, easily implemented and standardisable and thus may contribute toward better comparability of data generated in different studies and laboratories.}, author = {Fenu, M. and Bettermann, T. and Vogl, C. and Darwish-Miranda, Nasser and Schramel, J. and Jenner, F. and Ribitsch, I.}, issn = {20452322}, journal = {Scientific Reports}, number = {1}, publisher = {Springer Nature}, title = {{A novel magnet-based scratch method for standardisation of wound-healing assays}}, doi = {10.1038/s41598-019-48930-7}, volume = {9}, year = {2019}, } @article{6868, abstract = {Hyperpolarization-activated cyclic-nucleotide-gated (HCN) channels control electrical rhythmicity and excitability in the heart and brain, but the function of HCN channels at the subcellular level in axons remains poorly understood. Here, we show that the action potential conduction velocity in both myelinated and unmyelinated central axons can be bidirectionally modulated by a HCN channel blocker, cyclic adenosine monophosphate (cAMP), and neuromodulators. Recordings from mouse cerebellar mossy fiber boutons show that HCN channels ensure reliable high-frequency firing and are strongly modulated by cAMP (EC50 40 mM; estimated endogenous cAMP concentration 13 mM). In addition, immunogold-electron microscopy revealed HCN2 as the dominating subunit in cerebellar mossy fibers. Computational modeling indicated that HCN2 channels control conduction velocity primarily by altering the resting membrane potential and are associated with significant metabolic costs. These results suggest that the cAMP-HCN pathway provides neuromodulators with an opportunity to finely tune energy consumption and temporal delays across axons in the brain.}, author = {Byczkowicz, Niklas and Eshra, Abdelmoneim and Montanaro-Punzengruber, Jacqueline-Claire and Trevisiol, Andrea and Hirrlinger, Johannes and Kole, Maarten Hp and Shigemoto, Ryuichi and Hallermann, Stefan}, issn = {2050084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{HCN channel-mediated neuromodulation can control action potential velocity and fidelity in central axons}}, doi = {10.7554/eLife.42766}, volume = {8}, year = {2019}, } @article{6877, author = {Kopf, Aglaja and Sixt, Michael K}, issn = {1097-4172}, journal = {Cell}, number = {1}, pages = {51--53}, publisher = {Elsevier}, title = {{The neural crest pitches in to remove apoptotic debris}}, doi = {10.1016/j.cell.2019.08.047}, volume = {179}, year = {2019}, } @inproceedings{6884, abstract = {In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the "bank" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. }, author = {Avni, Guy and Henzinger, Thomas A and Zikelic, Dorde}, location = {Aachen, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Bidding mechanisms in graph games}}, doi = {10.4230/LIPICS.MFCS.2019.11}, volume = {138}, year = {2019}, } @inproceedings{6885, abstract = {A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. }, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Long-run average behavior of vector addition systems with states}}, doi = {10.4230/LIPICS.CONCUR.2019.27}, volume = {140}, year = {2019}, } @inproceedings{6886, abstract = {In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. }, author = {Aghajohari, Milad and Avni, Guy and Henzinger, Thomas A}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Determinacy in discrete-bidding infinite-duration games}}, doi = {10.4230/LIPICS.CONCUR.2019.20}, volume = {140}, year = {2019}, } @inproceedings{6887, abstract = {The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. }, author = {Chatterjee, Krishnendu and Dvorák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {Leibniz International Proceedings in Informatics}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Near-linear time algorithms for Streett objectives in graphs and MDPs}}, doi = {10.4230/LIPICS.CONCUR.2019.7}, volume = {140}, year = {2019}, } @inproceedings{6888, abstract = {In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.}, author = {Lechner, Mathias and Hasani, Ramin and Zimmer, Manuel and Henzinger, Thomas A and Grosu, Radu}, booktitle = {Proceedings - IEEE International Conference on Robotics and Automation}, isbn = {9781538660270}, location = {Montreal, QC, Canada}, publisher = {IEEE}, title = {{Designing worm-inspired neural networks for interpretable robotic control}}, doi = {10.1109/icra.2019.8793840}, volume = {2019-May}, year = {2019}, } @inproceedings{6889, abstract = {We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. }, author = {Chatterjee, Krishnendu and Piterman, Nir}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Combinations of Qualitative Winning for Stochastic Parity Games}}, doi = {10.4230/LIPICS.CONCUR.2019.6}, volume = {140}, year = {2019}, } @inbook{6890, abstract = {Describing the protein interactions that form pleomorphic and asymmetric viruses represents a considerable challenge to most structural biology techniques, including X-ray crystallography and single particle cryo-electron microscopy. Obtaining a detailed understanding of these interactions is nevertheless important, considering the number of relevant human pathogens that do not follow strict icosahedral or helical symmetry. Cryo-electron tomography and subtomogram averaging methods provide structural insights into complex biological environments and are well suited to go beyond structures of perfectly symmetric viruses. This chapter discusses recent developments showing that cryo-ET and subtomogram averaging can provide high-resolution insights into hitherto unknown structural features of pleomorphic and asymmetric virus particles. It also describes how these methods have significantly added to our understanding of retrovirus capsid assemblies in immature and mature viruses. Additional examples of irregular viruses and their associated proteins, whose structures have been studied via cryo-ET and subtomogram averaging, further support the versatility of these methods.}, author = {Obr, Martin and Schur, Florian KM}, booktitle = {Complementary Strategies to Study Virus Structure and Function}, editor = {Rey, Félix A.}, isbn = {9780128184561}, issn = {0065-3527}, pages = {117--159}, publisher = {Elsevier}, title = {{Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging}}, doi = {10.1016/bs.aivir.2019.07.008}, volume = {105}, year = {2019}, } @phdthesis{6891, abstract = {While cells of mesenchymal or epithelial origin perform their effector functions in a purely anchorage dependent manner, cells derived from the hematopoietic lineage are not committed to operate only within a specific niche. Instead, these cells are able to function autonomously of the molecular composition in a broad range of tissue compartments. By this means, cells of the hematopoietic lineage retain the capacity to disseminate into connective tissue and recirculate between organs, building the foundation for essential processes such as tissue regeneration or immune surveillance. Cells of the immune system, specifically leukocytes, are extraordinarily good at performing this task. These cells are able to flexibly shift their mode of migration between an adhesion-mediated and an adhesion-independent manner, instantaneously accommodating for any changes in molecular composition of the external scaffold. The key component driving directed leukocyte migration is the chemokine receptor 7, which guides the cell along gradients of chemokine ligand. Therefore, the physical destination of migrating leukocytes is purely deterministic, i.e. given by global directional cues such as chemokine gradients. Nevertheless, these cells typically reside in three-dimensional scaffolds of inhomogeneous complexity, raising the question whether cells are able to locally discriminate between multiple optional migration routes. Current literature provides evidence that leukocytes, specifically dendritic cells, do indeed probe their surrounding by virtue of multiple explorative protrusions. However, it remains enigmatic how these cells decide which one is the more favorable route to follow and what are the key players involved in performing this task. Due to the heterogeneous environment of most tissues, and the vast adaptability of migrating leukocytes, at this time it is not clear to what extent leukocytes are able to optimize their migratory strategy by adapting their level of adhesiveness. And, given the fact that leukocyte migration is characterized by branched cell shapes in combination with high migration velocities, it is reasonable to assume that these cells require fine tuned shape maintenance mechanisms that tightly coordinate protrusion and adhesion dynamics in a spatiotemporal manner. Therefore, this study aimed to elucidate how rapidly migrating leukocytes opt for an ideal migratory path while maintaining a continuous cell shape and balancing adhesive forces to efficiently navigate through complex microenvironments. The results of this study unraveled a role for the microtubule cytoskeleton in promoting the decision making process during path finding and for the first time point towards a microtubule-mediated function in cell shape maintenance of highly ramified cells such as dendritic cells. Furthermore, we found that migrating low-adhesive leukocytes are able to instantaneously adapt to increased tensile load by engaging adhesion receptors. This response was only occurring tangential to the substrate while adhesive properties in the vertical direction were not increased. As leukocytes are primed for rapid migration velocities, these results demonstrate that leukocyte integrins are able to confer a high level of traction forces parallel to the cell membrane along the direction of migration without wasting energy in gluing the cell to the substrate. Thus, the data in the here presented thesis provide new insights into the pivotal role of cytoskeletal dynamics and the mechanisms of force transduction during leukocyte migration. Thereby the here presented results help to further define fundamental principles underlying leukocyte migration and open up potential therapeutic avenues of clinical relevance. }, author = {Kopf, Aglaja}, isbn = {978-3-99078-002-2}, issn = {2663-337X}, keywords = {cell biology, immunology, leukocyte, migration, microfluidics}, pages = {171}, publisher = {Institute of Science and Technology Austria}, title = {{The implication of cytoskeletal dynamics on leukocyte migration}}, doi = {10.15479/AT:ISTA:6891}, year = {2019}, } @phdthesis{6894, abstract = {Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving. Nevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions. While, previously, directions were given by the user, we introduce (1) the first method for computing template directions from spurious counterexamples, so as to generalize and eliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid automata with (possibly non-linear) convex constraints on derivatives only, while for linear ODE requires further abstraction. Specifically, we introduce (2) the conic abstractions, which, partitioning the state space into appropriate (possibly non-uniform) cones, divide curvy trajectories into relatively straight sections, suitable for polyhedral abstractions. Finally, we introduce (3) space-time interpolation, which, combining interval arithmetic and template refinement, computes appropriate (possibly non-uniform) time partitioning and template directions along spurious trajectories, so as to eliminate them. We obtain sound and automatic methods for the reachability analysis over dense and unbounded time of convex hybrid automata and hybrid automata with linear ODE. We build prototype tools and compare—favorably—our methods against the respective state-of-the-art tools, on several benchmarks.}, author = {Giacobbe, Mirco}, issn = {2663-337X}, pages = {132}, publisher = {Institute of Science and Technology Austria}, title = {{Automatic time-unbounded reachability analysis of hybrid systems}}, doi = {10.15479/AT:ISTA:6894}, year = {2019}, } @article{6896, abstract = {Until recently, a great amount of brain studies have been conducted in human post mortem tissues, cell lines and model organisms. These researches provided useful insights regarding cell-cell interactions occurring in the brain. However, such approaches suffer from technical limitations and inaccurate modeling of the tissue 3D cytoarchitecture. Importantly, they might lack a human genetic background essential for disease modeling. With the development of protocols to generate human cerebral organoids, we are now closer to reproducing the early stages of human brain development in vitro. As a result, more relevant cell-cell interaction studies can be conducted. In this review, we discuss the advantages of 3D cultures over 2D in modulating brain cell-cell interactions during physiological and pathological development, as well as the progress made in developing organoids in which neurons, macroglia, microglia and vascularization are present. Finally, we debate the limitations of those models and possible future directions.}, author = {Oliveira, Bárbara and Yahya, Aysan Çerağ and Novarino, Gaia}, issn = {18726240}, journal = {Brain Research}, publisher = {Elsevier}, title = {{Modeling cell-cell interactions in the brain using cerebral organoids}}, doi = {10.1016/j.brainres.2019.146458}, volume = {1724}, year = {2019}, } @article{6897, abstract = {The apical hook is a transiently formed structure that plays a protective role when the germinating seedling penetrates through the soil towards the surface. Crucial for proper bending is the local auxin maxima, which defines the concave (inner) side of the hook curvature. As no sign of asymmetric auxin distribution has been reported in embryonic hypocotyls prior to hook formation, the question of how auxin asymmetry is established in the early phases of seedling germination remains largely unanswered. Here, we analyzed the auxin distribution and expression of PIN auxin efflux carriers from early phases of germination, and show that bending of the root in response to gravity is the crucial initial cue that governs the hypocotyl bending required for apical hook formation. Importantly, polar auxin transport machinery is established gradually after germination starts as a result of tight root-hypocotyl interaction and a proper balance between abscisic acid and gibberellins.}, author = {Zhu, Qiang and Gallemi, Marçal and Pospíšil, Jiří and Žádníková, Petra and Strnad, Miroslav and Benková, Eva}, issn = {14779129}, journal = {Development}, number = {17}, publisher = {The Company of Biologists}, title = {{Root gravity response module guides differential growth determining both root bending and apical hook formation in Arabidopsis}}, doi = {10.1242/dev.175919}, volume = {146}, year = {2019}, } @article{6898, abstract = {Background Chlamydia are ancient intracellular pathogens with reduced, though strikingly conserved genome. Despite their parasitic lifestyle and isolated intracellular environment, these bacteria managed to avoid accumulation of deleterious mutations leading to subsequent genome degradation characteristic for many parasitic bacteria. Results We report pan-genomic analysis of sixteen species from genus Chlamydia including identification and functional annotation of orthologous genes, and characterization of gene gains, losses, and rearrangements. We demonstrate the overall genome stability of these bacteria as indicated by a large fraction of common genes with conserved genomic locations. On the other hand, extreme evolvability is confined to several paralogous gene families such as polymorphic membrane proteins and phospholipase D, and likely is caused by the pressure from the host immune system. Conclusions This combination of a large, conserved core genome and a small, evolvable periphery likely reflect the balance between the selective pressure towards genome reduction and the need to adapt to escape from the host immunity.}, author = {Sigalova, Olga M. and Chaplin, Andrei V. and Bochkareva, Olga and Shelyakin, Pavel V. and Filaretov, Vsevolod A. and Akkuratov, Evgeny E. and Burskaia, Valentina and Gelfand, Mikhail S.}, issn = {14712164}, journal = {BMC Genomics}, number = {1}, publisher = {BioMed Central}, title = {{Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction}}, doi = {10.1186/s12864-019-6059-5}, volume = {20}, year = {2019}, } @article{6899, abstract = {Intra-organ communication guides morphogenetic processes that are essential for an organ to carry out complex physiological functions. In the heart, the growth of the myocardium is tightly coupled to that of the endocardium, a specialized endothelial tissue that lines its interior. Several molecular pathways have been implicated in the communication between these tissues including secreted factors, components of the extracellular matrix, or proteins involved in cell-cell communication. Yet, it is unknown how the growth of the endocardium is coordinated with that of the myocardium. Here, we show that an increased expansion of the myocardial atrial chamber volume generates higher junctional forces within endocardial cells. This leads to biomechanical signaling involving VE-cadherin, triggering nuclear localization of the Hippo pathway transcriptional regulator Yap1 and endocardial proliferation. Our work suggests that the growth of the endocardium results from myocardial chamber volume expansion and ends when the tension on the tissue is relaxed.}, author = {Bornhorst, Dorothee and Xia, Peng and Nakajima, Hiroyuki and Dingare, Chaitanya and Herzog, Wiebke and Lecaudey, Virginie and Mochizuki, Naoki and Heisenberg, Carl-Philipp J and Yelon, Deborah and Abdelilah-Seyfried, Salim}, issn = {20411723}, journal = {Nature communications}, number = {1}, pages = {4113}, publisher = {Nature Publishing Group}, title = {{Biomechanical signaling within the developing zebrafish heart attunes endocardial growth to myocardial chamber dimensions}}, doi = {10.1038/s41467-019-12068-x}, volume = {10}, year = {2019}, } @article{6900, abstract = {Across diverse biological systems—ranging from neural networks to intracellular signaling and genetic regulatory networks—the information about changes in the environment is frequently encoded in the full temporal dynamics of the network nodes. A pressing data-analysis challenge has thus been to efficiently estimate the amount of information that these dynamics convey from experimental data. Here we develop and evaluate decoding-based estimation methods to lower bound the mutual information about a finite set of inputs, encoded in single-cell high-dimensional time series data. For biological reaction networks governed by the chemical Master equation, we derive model-based information approximations and analytical upper bounds, against which we benchmark our proposed model-free decoding estimators. In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based estimators robustly extract a large fraction of the available information from high-dimensional trajectories with a realistic number of data samples. We apply these estimators to previously published data on Erk and Ca2+ signaling in mammalian cells and to yeast stress-response, and find that substantial amount of information about environmental state can be encoded by non-trivial response statistics even in stationary signals. We argue that these single-cell, decoding-based information estimates, rather than the commonly-used tests for significant differences between selected population response statistics, provide a proper and unbiased measure for the performance of biological signaling networks.}, author = {Cepeda Humerez, Sarah A and Ruess, Jakob and Tkačik, Gašper}, issn = {15537358}, journal = {PLoS computational biology}, number = {9}, pages = {e1007290}, publisher = {Public Library of Science}, title = {{Estimating information in time-varying signals}}, doi = {10.1371/journal.pcbi.1007290}, volume = {15}, year = {2019}, } @article{6919, author = {Qi, Chao and Minin, Giulio Di and Vercellino, Irene and Wutz, Anton and Korkhov, Volodymyr M.}, issn = {23752548}, journal = {Science Advances}, number = {9}, publisher = {American Association for the Advancement of Science}, title = {{Structural basis of sterol recognition by human hedgehog receptor PTCH1}}, doi = {10.1126/sciadv.aaw6490}, volume = {5}, year = {2019}, } @article{6920, author = {Artner, Christina and Benková, Eva}, issn = {1674-2052}, journal = {Molecular Plant}, number = {10}, pages = {1312--1314}, publisher = {Cell Press}, title = {{Ethylene and cytokinin - partners in root growth regulation}}, doi = {10.1016/j.molp.2019.09.003}, volume = {12}, year = {2019}, } @inproceedings{6931, abstract = {Consider a distributed system with n processors out of which f can be Byzantine faulty. In the approximate agreement task, each processor i receives an input value xi and has to decide on an output value yi such that 1. the output values are in the convex hull of the non-faulty processors’ input values, 2. the output values are within distance d of each other. Classically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1. In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to output vertices that are within distance d of each other in G, but still remain in the graph-induced convex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with a deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1, we show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f, where ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact variants of these and related tasks over a large class of combinatorial structures.}, author = {Nowak, Thomas and Rybicki, Joel}, booktitle = {33rd International Symposium on Distributed Computing}, keywords = {consensus, approximate agreement, Byzantine faults, chordal graphs, lattice agreement}, location = {Budapest, Hungary}, pages = {29:1----29:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Byzantine approximate agreement on graphs}}, doi = {10.4230/LIPICS.DISC.2019.29}, volume = {146}, year = {2019}, }