@article{6835,
  abstract     = {We derive the Hasse principle and weak approximation for fibrations of certain varieties in the spirit of work by Colliot-Thélène–Sansuc and Harpaz–Skorobogatov–Wittenberg. Our varieties are defined through polynomials in many variables and part of our work is devoted to establishing Schinzel's hypothesis for polynomials of this kind. This last part is achieved by using arguments behind Birch's well-known result regarding the Hasse principle for complete intersections with the notable difference that we prove our result in 50% fewer variables than in the classical Birch setting. We also study the problem of square-free values of an integer polynomial with 66.6% fewer variables than in the Birch setting.},
  author       = {Destagnol, Kevin N and Sofos, Efthymios},
  issn         = {0007-4497},
  journal      = {Bulletin des Sciences Mathematiques},
  number       = {11},
  publisher    = {Elsevier},
  title        = {{Rational points and prime values of polynomials in moderately many variables}},
  doi          = {10.1016/j.bulsci.2019.102794},
  volume       = {156},
  year         = {2019},
}

@article{6836,
  abstract     = {Direct reciprocity is a powerful mechanism for the evolution of cooperation on the basis of repeated interactions1,2,3,4. It requires that interacting individuals are sufficiently equal, such that everyone faces similar consequences when they cooperate or defect. Yet inequality is ubiquitous among humans5,6 and is generally considered to undermine cooperation and welfare7,8,9,10. Most previous models of reciprocity do not include inequality11,12,13,14,15. These models assume that individuals are the same in all relevant aspects. Here we introduce a general framework to study direct reciprocity among unequal individuals. Our model allows for multiple sources of inequality. Subjects can differ in their endowments, their productivities and in how much they benefit from public goods. We find that extreme inequality prevents cooperation. But if subjects differ in productivity, some endowment inequality can be necessary for cooperation to prevail. Our mathematical predictions are supported by a behavioural experiment in which we vary the endowments and productivities of the subjects. We observe that overall welfare is maximized when the two sources of heterogeneity are aligned, such that more productive individuals receive higher endowments. By contrast, when endowments and productivities are misaligned, cooperation quickly breaks down. Our findings have implications for policy-makers concerned with equity, efficiency and the provisioning of public goods.},
  author       = {Hauser, Oliver P. and Hilbe, Christian and Chatterjee, Krishnendu and Nowak, Martin A.},
  issn         = {1476-4687},
  journal      = {Nature},
  number       = {7770},
  pages        = {524--527},
  publisher    = {Springer Nature},
  title        = {{Social dilemmas among unequals}},
  doi          = {10.1038/s41586-019-1488-5},
  volume       = {572},
  year         = {2019},
}

@article{6837,
  abstract     = {Migrasomes are a recently discovered type of extracellular vesicles that are characteristically generated along retraction fibers in migrating cells. Two studies now show how migrasomes are formed and how they function in the physiologically relevant context of the developing zebrafish embryo.},
  author       = {Tavano, Ste and Heisenberg, Carl-Philipp J},
  issn         = {1476-4679},
  journal      = {Nature Cell Biology},
  number       = {8},
  pages        = {918--920},
  publisher    = {Springer Nature},
  title        = {{Migrasomes take center stage}},
  doi          = {10.1038/s41556-019-0369-3},
  volume       = {21},
  year         = {2019},
}

@article{6840,
  abstract     = {We discuss thermodynamic properties of harmonically trapped
imperfect quantum gases. The spatial inhomogeneity of these systems imposes
a redefinition of the mean-field interparticle potential energy as compared
to the homogeneous case. In our approach, it takes the form a
2N2 ωd, where
N is the number of particles, ω—the harmonic trap frequency, d—system’s
dimensionality, and a is a parameter characterizing the interparticle interaction.
We provide arguments that this model corresponds to the limiting case of
a long-ranged interparticle potential of vanishingly small amplitude. This
conclusion is drawn from a computation similar to the well-known Kac scaling
procedure, which is presented here in a form adapted to the case of an isotropic
harmonic trap. We show that within the model, the imperfect gas of trapped
repulsive bosons undergoes the Bose–Einstein condensation provided d > 1.
The main result of our analysis is that in d = 1 the gas of attractive imperfect
fermions with a = −aF < 0 is thermodynamically equivalent to the gas of
repulsive bosons with a = aB > 0 provided the parameters aF and aB fulfill
the relation aB + aF = . This result supplements similar recent conclusion
about thermodynamic equivalence of two-dimensional (2D) uniform imperfect
repulsive Bose and attractive Fermi gases.},
  author       = {Mysliwy, Krzysztof and Napiórkowski, Marek},
  issn         = {1742-5468},
  journal      = {Journal of Statistical Mechanics: Theory and Experiment},
  number       = {6},
  publisher    = {IOP Publishing},
  title        = {{Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps}},
  doi          = {10.1088/1742-5468/ab190d},
  volume       = {2019},
  year         = {2019},
}

@article{6843,
  abstract     = {The aim of this short paper is to offer a complete characterization of all (not necessarily surjective) isometric embeddings of the Wasserstein space Wp(X), where S is a countable discrete metric space and 0<p<∞ is any parameter value. Roughly speaking, we will prove that any isometric embedding can be described by a special kind of X×(0,1]-indexed family of nonnegative finite measures. Our result implies that a typical non-surjective isometric embedding of Wp(X) splits mass and does not preserve the shape of measures. In order to stress that the lack of surjectivity is what makes things challenging, we will prove alternatively that Wp(X) is isometrically rigid for all 0<p<∞.},
  author       = {Gehér, György Pál and Titkos, Tamás and Virosztek, Daniel},
  issn         = {1096-0813},
  journal      = {Journal of Mathematical Analysis and Applications},
  number       = {2},
  publisher    = {Elsevier},
  title        = {{On isometric embeddings of Wasserstein spaces – the discrete case}},
  doi          = {10.1016/j.jmaa.2019.123435},
  volume       = {480},
  year         = {2019},
}

@article{6844,
  abstract     = {Studying the progression of the proliferative and differentiative patterns of neural stem cells at the individual cell level is crucial to the understanding of cortex development and how the disruption of such patterns can lead to malformations and neurodevelopmental diseases. However, our understanding of the precise lineage progression programme at single-cell resolution is still incomplete due to the technical variations in lineage- tracing approaches. One of the key challenges involves developing a robust theoretical framework in which we can integrate experimental observations and introduce correction factors to obtain a reliable and representative description of the temporal modulation of proliferation and differentiation. In order to obtain more conclusive insights, we carry out virtual clonal analysis using mathematical modelling and compare our results against experimental data. Using a dataset obtained with Mosaic Analysis with Double Markers, we illustrate how the theoretical description can be exploited to interpret and reconcile the disparity between virtual and experimental results.},
  author       = {Picco, Noemi and Hippenmeyer, Simon and Rodarte, Julio and Streicher, Carmen and Molnár, Zoltán and Maini, Philip K. and Woolley, Thomas E.},
  issn         = {1469-7580},
  journal      = {Journal of Anatomy},
  number       = {3},
  pages        = {686--696},
  publisher    = {Wiley},
  title        = {{A mathematical insight into cell labelling experiments for clonal analysis}},
  doi          = {10.1111/joa.13001},
  volume       = {235},
  year         = {2019},
}

@article{6855,
  abstract     = {Many traits of interest are highly heritable and genetically complex, meaning that much of the variation they exhibit arises from differences at numerous loci in the genome. Complex traits and their evolution have been studied for more than a century, but only in the last decade have genome-wide association studies (GWASs) in humans begun to reveal their genetic basis. Here, we bring these threads of research together to ask how findings from GWASs can further our understanding of the processes that give rise to heritable variation in complex traits and of the genetic basis of complex trait evolution in response to changing selection pressures (i.e., of polygenic adaptation). Conversely, we ask how evolutionary thinking helps us to interpret findings from GWASs and informs related efforts of practical importance.},
  author       = {Sella, Guy and Barton, Nicholas H},
  issn         = {1545-293X},
  journal      = {Annual Review of Genomics and Human Genetics},
  pages        = {461--493},
  publisher    = {Annual Reviews},
  title        = {{Thinking about the evolution of complex traits in the era of genome-wide association studies}},
  doi          = {10.1146/annurev-genom-083115-022316},
  volume       = {20},
  year         = {2019},
}

@article{6856,
  abstract     = {Plant mating systems play a key role in structuring genetic variation both within and between species. In hybrid zones, the outcomes and dynamics of hybridization are usually interpreted as the balance between gene flow and selection against hybrids. Yet, mating systems can introduce selective forces that alter these expectations; with diverse outcomes for the level and direction of gene flow depending on variation in outcrossing and whether the mating systems of the species pair are the same or divergent. We present a survey of hybridization in 133 species pairs from 41 plant families and examine how patterns of hybridization vary with mating system. We examine if hybrid zone mode, level of gene flow, asymmetries in gene flow and the frequency of reproductive isolating barriers vary in relation to mating system/s of the species pair. We combine these results with a simulation model and examples from the literature to address two general themes: (i) the two‐way interaction between introgression and the evolution of reproductive systems, and (ii) how mating system can facilitate or restrict interspecific gene flow. We conclude that examining mating system with hybridization provides unique opportunities to understand divergence and the processes underlying reproductive isolation.},
  author       = {Pickup, Melinda and Barton, Nicholas H and Brandvain, Yaniv and Fraisse, Christelle and Yakimowski, Sarah and Dixit, Tanmay and Lexer, Christian and Cereghetti, Eva and Field, David},
  issn         = {1469-8137},
  journal      = {New Phytologist},
  number       = {3},
  pages        = {1035--1047},
  publisher    = {Wiley},
  title        = {{Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow}},
  doi          = {10.1111/nph.16180},
  volume       = {224},
  year         = {2019},
}

@article{6857,
  abstract     = {Gene Drives are regarded as future tools with a high potential for population control. Due to their inherent ability to overcome the rules of Mendelian inheritance, gene drives (GD) may spread genes rapidly through populations of sexually reproducing organisms. A release of organisms carrying a GD would constitute a paradigm shift in the handling of genetically modified organisms because gene drive organisms (GDO) are designed to drive their transgenes into wild populations and thereby increase the number of GDOs. The rapid development in this field and its focus on wild populations demand a prospective risk assessment with a focus on exposure related aspects. Presently, it is unclear how adequate risk management could be guaranteed to limit the spread of GDs in time and space, in order to avoid potential adverse effects in socio‐ecological systems.

The recent workshop on the “Evaluation of Spatial and Temporal Control of Gene Drives” hosted by the Institute of Safety/Security and Risk Sciences (ISR) in Vienna aimed at gaining some insight into the potential population dynamic behavior of GDs and appropriate measures of control. Scientists from France, Germany, England, and the USA discussed both topics in this meeting on April 4–5, 2019. This article summarizes results of the workshop.},
  author       = {Giese, B and Friess, J L and Schetelig, M F  and Barton, Nicholas H and Messer, Philip and Debarre, Florence and Meimberg, H and Windbichler, N and Boete, C},
  issn         = {1521-1878},
  journal      = {BioEssays},
  number       = {11},
  publisher    = {Wiley},
  title        = {{Gene Drives: Dynamics and regulatory matters – A report from the workshop “Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna}},
  doi          = {10.1002/bies.201900151},
  volume       = {41},
  year         = {2019},
}

@article{6858,
  author       = {Barton, Nicholas H},
  issn         = {2053-714X},
  journal      = {National Science Review},
  number       = {2},
  pages        = {291--292},
  publisher    = {Oxford University Press},
  title        = {{Is speciation driven by cycles of mixing and isolation?}},
  doi          = {10.1093/nsr/nwy113},
  volume       = {6},
  year         = {2019},
}

@article{6859,
  abstract     = {V (vacuolar)/A (archaeal)-type adenosine triphosphatases (ATPases), found in archaeaand eubacteria, couple ATP hydrolysis or synthesis to proton translocation across theplasma membrane using the rotary-catalysis mechanism. They belong to the V-typeATPase family, which differs from the mitochondrial/chloroplast F-type ATP synthasesin overall architecture. We solved cryo–electron microscopy structures of the intactThermus thermophilusV/A-ATPase, reconstituted into lipid nanodiscs, in three rotationalstates and two substates. These structures indicate substantial flexibility betweenV1and Voin a working enzyme, which results from mechanical competition between centralshaft rotation and resistance from the peripheral stalks. We also describedetails of adenosine diphosphate inhibition release, V1-Votorque transmission, andproton translocation, which are relevant for the entire V-type ATPase family.},
  author       = {Zhou, Long and Sazanov, Leonid A},
  issn         = {1095-9203},
  journal      = {Science},
  number       = {6455},
  publisher    = {AAAS},
  title        = {{Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase}},
  doi          = {10.1126/science.aaw9144},
  volume       = {365},
  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},
}

@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         = {1872-6240},
  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{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},
}