@phdthesis{818,
  abstract     = {Antibiotics have diverse effects on bacteria, including massive changes in bacterial gene expression. Whereas the gene expression changes under many antibiotics have been measured, the temporal organization of these responses and their dependence on the bacterial growth rate are unclear. As described in Chapter 1, we quantified the temporal gene expression changes in the bacterium Escherichia coli in response to the sudden exposure to antibiotics using a fluorescent reporter library and a robotic system. Our data show temporally structured gene expression responses, with response times for individual genes ranging from tens of minutes to several hours. We observed that many stress response genes were activated in response to antibiotics. As certain stress responses cross-protect bacteria from other stressors, we then asked whether cellular responses to antibiotics have a similar protective role in Chapter 2. Indeed, we found that the trimethoprim-induced acid stress response protects bacteria from subsequent acid stress. We combined microfluidics with time-lapse imaging to monitor survival, intracellular pH, and acid stress response in single cells. This approach revealed that the variable expression of the acid resistance operon gadBC strongly correlates with single-cell survival time. Cells with higher gadBC expression following trimethoprim maintain higher intracellular pH and survive the acid stress longer. Overall, we provide a way to identify single-cell cross-protection between antibiotics and environmental stressors from temporal gene expression data, and show how antibiotics can increase bacterial fitness in changing environments. While gene expression changes to antibiotics show a clear temporal structure at the population-level, it is unclear whether this clear temporal order is followed by every single cell. Using dual-reporter strains described in Chapter 3, we measured gene expression dynamics of promoter pairs in the same cells using microfluidics and microscopy. Chapter 4 shows that the oxidative stress response and the DNA stress response showed little timing variability and a clear temporal order under the antibiotic nitrofurantoin. In contrast, the acid stress response under trimethoprim ran independently from all other activated response programs including the DNA stress response, which showed particularly high timing variability in this stress condition. In summary, this approach provides insight into the temporal organization of gene expression programs at the single-cell level and suggests dependencies between response programs and the underlying variability-introducing mechanisms. Altogether, this work advances our understanding of the diverse effects that antibiotics have on bacteria. These results were obtained by taking into account gene expression dynamics, which allowed us to identify general principles, molecular mechanisms, and dependencies between genes. Our findings may have implications for infectious disease treatments, and microbial communities in the human body and in nature. },
  author       = {Mitosch, Karin},
  issn         = {2663-337X},
  pages        = {113},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics}},
  doi          = {10.15479/AT:ISTA:th_862},
  year         = {2017},
}

@article{666,
  abstract     = {Antibiotics elicit drastic changes in microbial gene expression, including the induction of stress response genes. While certain stress responses are known to “cross-protect” bacteria from other stressors, it is unclear whether cellular responses to antibiotics have a similar protective role. By measuring the genome-wide transcriptional response dynamics of Escherichia coli to four antibiotics, we found that trimethoprim induces a rapid acid stress response that protects bacteria from subsequent exposure to acid. Combining microfluidics with time-lapse imaging to monitor survival and acid stress response in single cells revealed that the noisy expression of the acid resistance operon gadBC correlates with single-cell survival. Cells with higher gadBC expression following trimethoprim maintain higher intracellular pH and survive the acid stress longer. The seemingly random single-cell survival under acid stress can therefore be predicted from gadBC expression and rationalized in terms of GadB/C molecular function. Overall, we provide a roadmap for identifying the molecular mechanisms of single-cell cross-protection between antibiotics and other stressors.},
  author       = {Mitosch, Karin and Rieckh, Georg and Bollenbach, Tobias},
  issn         = {2405-4712},
  journal      = {Cell Systems},
  number       = {4},
  pages        = {393 -- 403},
  publisher    = {Cell Press},
  title        = {{Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment}},
  doi          = {10.1016/j.cels.2017.03.001},
  volume       = {4},
  year         = {2017},
}

@phdthesis{821,
  abstract     = {This dissertation focuses on algorithmic aspects of program verification, and presents modeling and complexity advances on several problems related to the
static analysis of programs, the stateless model checking of concurrent programs, and the competitive analysis of real-time scheduling algorithms.
Our contributions can be broadly grouped into five categories.

Our first contribution is a set of new algorithms and data structures for the quantitative and data-flow analysis of programs, based on the graph-theoretic notion of treewidth.
It has been observed that the control-flow graphs of typical programs have special structure, and are characterized as graphs of small treewidth.
We utilize this structural property to provide faster algorithms for the quantitative and data-flow analysis of recursive and concurrent programs.
In most cases we make an algebraic treatment of the considered problem,
where several interesting analyses, such as the reachability, shortest path, and certain kind of data-flow analysis problems follow as special cases. 
We exploit the constant-treewidth property to obtain algorithmic improvements for on-demand versions of the problems, 
and provide data structures with various tradeoffs between the resources spent in the preprocessing and querying phase.
We also improve on the algorithmic complexity of quantitative problems outside the algebraic path framework,
namely of the minimum mean-payoff, minimum ratio, and minimum initial credit for energy problems.


Our second contribution is a set of algorithms for Dyck reachability with applications to data-dependence analysis and alias analysis.
In particular, we develop an optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous in context-insensitive, field-sensitive points-to analysis.
Additionally, we develop an efficient algorithm for context-sensitive data-dependence analysis via Dyck reachability,
where the task is to obtain analysis summaries of library code in the presence of callbacks.
Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is (i)~linear in the number of call sites and (ii)~only logarithmic in the size of the whole library, as opposed to linear in the size of the whole library.
Finally, we prove that Dyck reachability is Boolean Matrix Multiplication-hard in general, and the hardness also holds for graphs of constant treewidth.
This hardness result strongly indicates that there exist no combinatorial algorithms for Dyck reachability with truly subcubic complexity.


Our third contribution is the formalization and algorithmic treatment of the Quantitative Interprocedural Analysis framework.
In this framework, the transitions of a recursive program are annotated as good, bad or neutral, and receive a weight which measures
the magnitude of their respective effect.
The Quantitative Interprocedural Analysis problem asks to determine whether there exists an infinite run of the program where the long-run ratio of the bad weights over the good weights is above a given threshold.
We illustrate how several quantitative problems related to static analysis of recursive programs can be instantiated in this framework,
and present some case studies to this direction.


Our fourth contribution is a new dynamic partial-order reduction for the stateless model checking of concurrent programs. Traditional approaches rely on the standard Mazurkiewicz equivalence between  traces, by means of partitioning the trace space into equivalence classes, and attempting to explore a few representatives from each class.
We present a new dynamic partial-order reduction method  called the Data-centric Partial Order Reduction (DC-DPOR).
Our algorithm is based on a new equivalence between traces, called the observation equivalence.
DC-DPOR explores a coarser partitioning of the trace space than any exploration method based on the standard Mazurkiewicz equivalence.
Depending on the program, the new partitioning can be even exponentially coarser.
Additionally, DC-DPOR spends only polynomial time in each explored class.


Our fifth contribution is the use of automata and game-theoretic verification techniques in the competitive analysis and synthesis of real-time scheduling algorithms for firm-deadline tasks.
On the analysis side, we leverage automata on infinite words to compute the competitive ratio of real-time schedulers subject to various environmental constraints.
On the synthesis side, we introduce a new instance of two-player mean-payoff partial-information games, and show
how the synthesis of an optimal real-time scheduler can be reduced to computing winning strategies in this new type of games.},
  author       = {Pavlogiannis, Andreas},
  issn         = {2663-337X},
  pages        = {418},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Algorithmic advances in program analysis and their applications}},
  doi          = {10.15479/AT:ISTA:th_854},
  year         = {2017},
}

@phdthesis{1155,
  abstract     = {This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results.},
  author       = {Daca, Przemyslaw},
  issn         = {2663-337X},
  pages        = {163},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Statistical and logical methods for property checking}},
  doi          = {10.15479/AT:ISTA:TH_730},
  year         = {2017},
}

@inbook{649,
  abstract     = {We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani.},
  author       = {Maas, Jan},
  booktitle    = {Modern Approaches to Discrete Curvature},
  editor       = {Najman, Laurent and Romon, Pascal},
  isbn         = {9783319580012},
  pages        = {159 -- 174},
  publisher    = {Springer},
  title        = {{Entropic Ricci curvature for discrete spaces}},
  doi          = {10.1007/978-3-319-58002-9_5},
  volume       = {2184},
  year         = {2017},
}

@article{1336,
  abstract     = {Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse the runtimes of EAs on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrences of new mutations is much longer than the time it takes for a mutated genotype to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a stochastic process evolving one genotype by means of mutation and selection between the resident and the mutated genotype. The probability of accepting the mutated genotype then depends on the change in fitness. We study this process, SSWM, from an algorithmic perspective, quantifying its expected optimisation time for various parameters and investigating differences to a similar evolutionary algorithm, the well-known (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient.},
  author       = {Paixao, Tiago and Pérez Heredia, Jorge and Sudholt, Dirk and Trubenova, Barbora},
  issn         = {0178-4617},
  journal      = {Algorithmica},
  number       = {2},
  pages        = {681 -- 713},
  publisher    = {Springer},
  title        = {{Towards a runtime comparison of natural and artificial evolution}},
  doi          = {10.1007/s00453-016-0212-1},
  volume       = {78},
  year         = {2017},
}

@article{1337,
  abstract     = {We consider the local eigenvalue distribution of large self-adjoint N×N random matrices H=H∗ with centered independent entries. In contrast to previous works the matrix of variances sij=\mathbbmE|hij|2 is not assumed to be stochastic. Hence the density of states is not the Wigner semicircle law. Its possible shapes are described in the companion paper (Ajanki et al. in Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z)) solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We prove a local law down to the smallest spectral resolution scale, and bulk universality for both real symmetric and complex hermitian symmetry classes.},
  author       = {Ajanki, Oskari H and Erdös, László and Krüger, Torben H},
  issn         = {0178-8051},
  journal      = {Probability Theory and Related Fields},
  number       = {3-4},
  pages        = {667 -- 727},
  publisher    = {Springer},
  title        = {{Universality for general Wigner-type matrices}},
  doi          = {10.1007/s00440-016-0740-2},
  volume       = {169},
  year         = {2017},
}

@article{1163,
  abstract     = {We investigate the effect of the electron-hole (e-h) symmetry breaking on d-wave superconductivity induced by non-local effects of correlations in the generalized Hubbard model. The symmetry breaking is introduced in a two-fold manner: by the next-to-nearest neighbor hopping of electrons and by the charge-bond interaction - the off-diagonal term of the Coulomb potential. Both terms lead to a pronounced asymmetry of the superconducting order parameter. The next-to-nearest neighbor hopping enhances superconductivity for h-doping, while diminishes it for e-doping. The charge-bond interaction alone leads to the opposite effect and, additionally, to the kinetic-energy gain upon condensation in the underdoped regime. With both terms included, with similar amplitudes, the height of the superconducting dome and the critical doping remain in favor of h-doping. The influence of the charge-bond interaction on deviations from symmetry of the shape of the gap at the Fermi surface in the momentum space is briefly discussed.},
  author       = {Wysokiński, Marcin and Kaczmarczyk, Jan},
  issn         = {0953-8984},
  journal      = {Journal of Physics: Condensed Matter},
  number       = {8},
  publisher    = {IOP Publishing},
  title        = {{Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms}},
  doi          = {10.1088/1361-648X/aa532f},
  volume       = {29},
  year         = {2017},
}

@inproceedings{1116,
  abstract     = {Time-triggered switched networks are a deterministic communication infrastructure used by real-time distributed embedded systems. Due to the criticality of the applications running over them, developers need to ensure that end-to-end communication is dependable and predictable. Traditional approaches assume static networks that are not flexible to changes caused by reconfigurations or, more importantly, faults, which are dealt with in the application using redundancy. We adopt the concept of handling faults in the switches from non-real-time networks while maintaining the required predictability. 

We study a class of forwarding schemes that can handle various types of failures. We consider probabilistic failures. We study a class of forwarding schemes that can handle various types of failures. We consider probabilistic failures. For a given network with a forwarding scheme and a constant ℓ, we compute the {\em score} of the scheme, namely the probability (induced by faults) that at least ℓ messages arrive on time. We reduce the scoring problem to a reachability problem on a Markov chain with a &quot;product-like&quot; structure. Its special structure allows us to reason about it symbolically, and reduce the scoring problem to #SAT. Our solution is generic and can be adapted to different networks and other contexts. Also, we show the computational complexity of the scoring problem is #P-complete, and we study methods to estimate the score. We evaluate the effectiveness of our techniques with an implementation. },
  author       = {Avni, Guy and Goel, Shubham and Henzinger, Thomas A and Rodríguez Navas, Guillermo},
  issn         = {0302-9743},
  location     = {Uppsala, Sweden},
  pages        = {169 -- 187},
  publisher    = {Springer},
  title        = {{Computing scores of forwarding schemes in switched networks with probabilistic faults}},
  doi          = {10.1007/978-3-662-54580-5_10},
  volume       = {10206},
  year         = {2017},
}

@article{1528,
  abstract     = {We consider N×N Hermitian random matrices H consisting of blocks of size M≥N6/7. The matrix elements are i.i.d. within the blocks, close to a Gaussian in the four moment matching sense, but their distribution varies from block to block to form a block-band structure, with an essential band width M. We show that the entries of the Green’s function G(z)=(H−z)−1 satisfy the local semicircle law with spectral parameter z=E+iη down to the real axis for any η≫N−1, using a combination of the supersymmetry method inspired by Shcherbina (J Stat Phys 155(3): 466–499, 2014) and the Green’s function comparison strategy. Previous estimates were valid only for η≫M−1. The new estimate also implies that the eigenvectors in the middle of the spectrum are fully delocalized.},
  author       = {Bao, Zhigang and Erdös, László},
  issn         = {0178-8051},
  journal      = {Probability Theory and Related Fields},
  number       = {3-4},
  pages        = {673 -- 776},
  publisher    = {Springer},
  title        = {{Delocalization for a class of random block band matrices}},
  doi          = {10.1007/s00440-015-0692-y},
  volume       = {167},
  year         = {2017},
}

@article{1004,
  abstract     = {The fundamental tasks of the root system are, besides anchoring, mediating interactions between plant and soil and providing the plant with water and nutrients. The architecture of the root system is controlled by endogenous mechanisms that constantly integrate environmental signals, such as availability of nutrients and water. Extremely important for efficient soil exploitation and survival under less favorable conditions is the developmental flexibility of the root system that is largely determined by its postembryonic branching capacity. Modulation of initiation and outgrowth of lateral roots provides roots with an exceptional plasticity, allows optimal adjustment to underground heterogeneity, and enables effective soil exploitation and use of resources. Here we discuss recent advances in understanding the molecular mechanisms that shape the plant root system and integrate external cues to adapt to the changing environment.},
  author       = {Ötvös, Krisztina and Benková, Eva},
  issn         = {0959-437X},
  journal      = {Current Opinion in Genetics & Development},
  pages        = {82 -- 89},
  publisher    = {Elsevier},
  title        = {{Spatiotemporal mechanisms of root branching}},
  doi          = {10.1016/j.gde.2017.03.010},
  volume       = {45},
  year         = {2017},
}

@article{944,
  abstract     = {The concerted production of neurons and glia by neural stem cells (NSCs) is essential for neural circuit assembly. In the developing cerebral cortex, radial glia progenitors (RGPs) generate nearly all neocortical neurons and certain glia lineages. RGP proliferation behavior shows a high degree of non-stochasticity, thus a deterministic characteristic of neuron and glia production. However, the cellular and molecular mechanisms controlling RGP behavior and proliferation dynamics in neurogenesis and glia generation remain unknown. By using mosaic analysis with double markers (MADM)-based genetic paradigms enabling the sparse and global knockout with unprecedented single-cell resolution, we identified Lgl1 as a critical regulatory component. We uncover Lgl1-dependent tissue-wide community effects required for embryonic cortical neurogenesis and novel cell-autonomous Lgl1 functions controlling RGP-mediated glia genesis and postnatal NSC behavior. These results suggest that NSC-mediated neuron and glia production is tightly regulated through the concerted interplay of sequential Lgl1-dependent global and cell intrinsic mechanisms.},
  author       = {Beattie, Robert J and Postiglione, Maria P and Burnett, Laura and Laukoter, Susanne and Streicher, Carmen and Pauler, Florian and Xiao, Guanxi and Klezovitch, Olga and Vasioukhin, Valeri and Ghashghaei, Troy and Hippenmeyer, Simon},
  issn         = {0896-6273},
  journal      = {Neuron},
  number       = {3},
  pages        = {517 -- 533.e3},
  publisher    = {Cell Press},
  title        = {{Mosaic analysis with double markers reveals distinct sequential functions of Lgl1 in neural stem cells}},
  doi          = {10.1016/j.neuron.2017.04.012},
  volume       = {94},
  year         = {2017},
}

@article{1016,
  abstract     = {The integrity and dynamic properties of the microtubule cytoskeleton are indispensable for the development of the mammalian brain. Consequently, mutations in the genes that encode the structural component (the α/β-tubulin heterodimer) can give rise to severe, sporadic neurodevelopmental disorders. These are commonly referred to as the tubulinopathies. Here we report the addition of recessive quadrupedalism, also known as Uner Tan syndrome (UTS), to the growing list of diseases caused by tubulin variants. Analysis of a consanguineous UTS family identified a biallelic TUBB2B mutation, resulting in a p.R390Q amino acid substitution. In addition to the identifying quadrupedal locomotion, all three patients showed severe cerebellar hypoplasia. None, however, displayed the basal ganglia malformations typically associated with TUBB2B mutations. Functional analysis of the R390Q substitution revealed that it did not affect the ability of β-tubulin to fold or become assembled into the α/β-heterodimer, nor did it influence the incorporation of mutant-containing heterodimers into microtubule polymers. The 390Q mutation in S. cerevisiae TUB2 did not affect growth under basal conditions, but did result in increased sensitivity to microtubule-depolymerizing drugs, indicative of a mild impact of this mutation on microtubule function. The TUBB2B mutation described here represents an unusual recessive mode of inheritance for missense-mediated tubulinopathies and reinforces the sensitivity of the developing cerebellum to microtubule defects.},
  author       = {Breuss, Martin and Nguyen, Thai and Srivatsan, Anjana and Leca, Ines and Tian, Guoling and Fritz, Tanja and Hansen, Andi H and Musaev, Damir and Mcevoy Venneri, Jennifer and Kiely, James and Rosti, Rasim and Scott, Eric and Tan, Uner and Kolodner, Richard and Cowan, Nicholas and Keays, David and Gleeson, Joseph},
  issn         = {0964-6906},
  journal      = {Human Molecular Genetics},
  number       = {2},
  pages        = {258 -- 269},
  publisher    = {Oxford University Press},
  title        = {{Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability}},
  doi          = {10.1093/hmg/ddw383},
  volume       = {26},
  year         = {2017},
}

@article{1026,
  abstract     = {The optogenetic revolution enabled spatially-precise and temporally-precise control over protein function, signaling pathway activation, and animal behavior with tremendous success in the dissection of signaling networks and neural circuits. Very recently, optogenetic methods have been paired with optical reporters in novel drug screening platforms. In these all-optical platforms, light remotely activated ion channels and kinases thereby obviating the use of electrophysiology or reagents. Consequences were remarkable operational simplicity, throughput, and cost-effectiveness that culminated in the identification of new drug candidates. These blueprints for all-optical assays also revealed potential pitfalls and inspire all-optical variants of other screens, such as those that aim at better understanding dynamic drug action or orphan protein function.},
  author       = {Agus, Viviana and Janovjak, Harald L},
  issn         = {0958-1669},
  journal      = {Current Opinion in Biotechnology},
  pages        = {8 -- 14},
  publisher    = {Elsevier},
  title        = {{Optogenetic methods in drug screening: Technologies and applications}},
  doi          = {10.1016/j.copbio.2017.02.006},
  volume       = {48},
  year         = {2017},
}

@article{1084,
  abstract     = {BceRS and PsdRS are paralogous two-component systems in Bacillus subtilis controlling the response to antimicrobial peptides. In the presence of extracellular bacitracin and nisin, respectively, the two response regulators (RRs) bind their target promoters, PbceA or PpsdA, resulting in a strong up-regulation of target gene expression and ultimately antibiotic resistance. Despite high sequence similarity between the RRs BceR and PsdR and their known binding sites, no cross-regulation has been observed between them. We therefore investigated the specificity determinants of PbceA and PpsdA that ensure the insulation of these two paralogous pathways at the RR–promoter interface. In vivo and in vitro analyses demonstrate that the regulatory regions within these two promoters contain three important elements: in addition to the known (main) binding site, we identified a linker region and a secondary binding site that are crucial for functionality. Initial binding to the high-affinity, low-specificity main binding site is a prerequisite for the subsequent highly specific binding of a second RR dimer to the low-affinity secondary binding site. In addition to this hierarchical cooperative binding, discrimination requires a competition of the two RRs for their respective binding site mediated by only slight differences in binding affinities.},
  author       = {Fang, Chong and Nagy-Staron, Anna A and Grafe, Martin and Heermann, Ralf and Jung, Kirsten and Gebhard, Susanne and Mascher, Thorsten},
  issn         = { 0950-382X},
  journal      = {Molecular Microbiology},
  number       = {1},
  pages        = {16 -- 31},
  publisher    = {Wiley-Blackwell},
  title        = {{Insulation and wiring specificity of BceR like response regulators and their target promoters in Bacillus subtilis}},
  doi          = {10.1111/mmi.13597},
  volume       = {104},
  year         = {2017},
}

@article{793,
  abstract     = {Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c &gt; 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |). },
  author       = {Fulek, Radoslav and Mojarrad, Hossein and Naszódi, Márton and Solymosi, József and Stich, Sebastian and Szedlák, May},
  issn         = {0925-7721},
  journal      = {Computational Geometry: Theory and Applications},
  pages        = {28 -- 31},
  publisher    = {Elsevier},
  title        = {{On the existence of ordinary triangles}},
  doi          = {10.1016/j.comgeo.2017.07.002},
  volume       = {66},
  year         = {2017},
}

@article{945,
  abstract     = {While chromosome-wide dosage compensation of the X chromosome has been found in many species, studies in ZW clades have indicated that compensation of the Z is more localized and/or incomplete. In the ZW Lepidoptera, some species show complete compensation of the Z chromosome, while others lack full equalization, but what drives these inconsistencies is unclear. Here, we compare patterns of male and female gene expression on the Z chromosome of two closely related butterfly species, Papilio xuthus and Papilio machaon, and in multiple tissues of two moths species, Plodia interpunctella and Bombyx mori, which were previously found to differ in the extent to which they equalize Z-linked gene expression between the sexes. We find that, while some species and tissues seem to have incomplete dosage compensation, this is in fact due to the accumulation of male-biased genes and the depletion of female-biased genes on the Z chromosome. Once this is accounted for, the Z chromosome is fully compensated in all four species, through the up-regulation of Z expression in females and in some cases additional down-regulation in males. We further find that both sex-biased genes and Z-linked genes have increased rates of expression divergence in this clade, and that this can lead to fast shifts in patterns of gene expression even between closely related species. Taken together, these results show that the uneven distribution of sex-biased genes on sex chromosomes can confound conclusions about dosage compensation and that Z chromosome-wide dosage compensation is not only possible but ubiquitous among Lepidoptera.},
  author       = {Huylmans, Ann K and Macon, Ariana and Vicoso, Beatriz},
  issn         = {0737-4038},
  journal      = {Molecular Biology and Evolution},
  number       = {10},
  pages        = {2637 -- 2649},
  publisher    = {Oxford University Press},
  title        = {{Global dosage compensation is ubiquitous in Lepidoptera, but counteracted by the masculinization of the Z chromosome}},
  doi          = {10.1093/molbev/msx190},
  volume       = {34},
  year         = {2017},
}

@article{557,
  abstract     = {PURPOSE. Gene therapy of retinal ganglion cells (RGCs) has promise as a powerful therapeutic for the rescue and regeneration of these cells after optic nerve damage. However, early after damage, RGCs undergo atrophic changes, including gene silencing. It is not known if these changes will deleteriously affect transduction and transgene expression, or if the therapeutic protein can influence reactivation of the endogenous genome. METHODS. Double-transgenic mice carrying a Rosa26-(LoxP)-tdTomato reporter, and a mutant allele for the proapoptotic Bax gene were reared. The Bax mutant blocks apoptosis, but RGCs still exhibit nuclear atrophy and gene silencing. At times ranging from 1 hour to 4 weeks after optic nerve crush (ONC), eyes received an intravitreal injection of AAV2 virus carrying the Cre recombinase. Successful transduction was monitored by expression of the tdTomato reporter. Immunostaining was used to localize tdTomato expression in select cell types. RESULTS. Successful transduction of RGCs was achieved at all time points after ONC using AAV2 expressing Cre from the phosphoglycerate kinase (Pgk) promoter, but not the CMV promoter. ONC promoted an increase in the transduction of cell types in the inner nuclear layer, including Müller cells and rod bipolar neurons. There was minimal evidence of transduction of amacrine cells and astrocytes in the inner retina or optic nerve. CONCLUSIONS. Damaged RGCs can be transduced and at least some endogenous genes can be subsequently activated. Optic nerve damage may change retinal architecture to allow greater penetration of an AAV2 virus to transduce several additional cell types in the inner nuclear layer.},
  author       = {Nickells, Robert and Schmitt, Heather and Maes, Margaret E and Schlamp, Cassandra},
  issn         = {0146-0404},
  journal      = {Investigative Ophthalmology and Visual Science},
  number       = {14},
  pages        = {6091 -- 6104},
  publisher    = {Association for Research in Vision and Ophthalmology},
  title        = {{AAV2 mediated transduction of the mouse retina after optic nerve injury}},
  doi          = {10.1167/iovs.17-22634},
  volume       = {58},
  year         = {2017},
}

@article{470,
  abstract     = {This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.},
  author       = {Jeschke, Stefan and Wojtan, Christopher J},
  issn         = {0730-0301},
  journal      = {ACM Transactions on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{Water wave packets}},
  doi          = {10.1145/3072959.3073678},
  volume       = {36},
  year         = {2017},
}

@article{654,
  abstract     = {In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations.},
  author       = {Kicheva, Anna and Rivron, Nicolas},
  issn         = {0950-1991},
  journal      = {Development},
  number       = {5},
  pages        = {733 -- 736},
  publisher    = {Company of Biologists},
  title        = {{Creating to understand – developmental biology meets engineering in Paris}},
  doi          = {10.1242/dev.144915},
  volume       = {144},
  year         = {2017},
}

