@article{2023,
  abstract     = {Understanding the evolution of dispersal is essential for understanding and predicting the dynamics of natural populations. Two main factors are known to influence dispersal evolution: spatio-temporal variation in the environment and relatedness between individuals. However, the relation between these factors is still poorly understood, and they are usually treated separately. In this article, I present a theoretical framework that contains and connects effects of both environmental variation and relatedness, and reproduces and extends their known features. Spatial habitat variation selects for balanced dispersal strategies, whereby the population is kept at an ideal free distribution. Within this class of dispersal strategies, I explain how increased dispersal is promoted by perturbations to the dispersal type frequencies. An explicit formula shows the magnitude of the selective advantage of increased dispersal in terms of the spatial variability in the frequencies of the different dispersal strategies present. These variances are capable of capturing various sources of stochasticity and hence establish a common scale for their effects on the evolution of dispersal. The results furthermore indicate an alternative approach to identifying effects of relatedness on dispersal evolution.},
  author       = {Novak, Sebastian},
  journal      = {Ecology and Evolution},
  number       = {24},
  pages        = {4589 -- 4597},
  publisher    = {Wiley-Blackwell},
  title        = {{Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution}},
  doi          = {10.1002/ece3.1289},
  volume       = {4},
  year         = {2014},
}

@article{2024,
  abstract     = {The yeast Rab5 homologue, Vps21p, is known to be involved both in the vacuolar protein sorting (VPS) pathway from the trans-Golgi network to the vacuole, and in the endocytic pathway from the plasma membrane to the vacuole. However, the intracellular location at which these two pathways converge remains unclear. In addition, the endocytic pathway is not completely blocked in yeast cells lacking all Rab5 genes, suggesting the existence of an unidentified route that bypasses the Rab5-dependent endocytic pathway. Here we show that convergence of the endocytic and VPS pathways occurs upstream of the requirement for Vps21p in these pathways. We also identify a previously unidentified endocytic pathway mediated by the AP-3 complex. Importantly, the AP-3-mediated pathway appears mostly intact in Rab5-disrupted cells, and thus works as an alternative route to the vacuole/lysosome. We propose that the endocytic traffic branches into two routes to reach the vacuole: a Rab5-dependent VPS pathway and a Rab5-independent AP-3-mediated pathway.},
  author       = {Toshima, Junko and Nishinoaki, Show and Sato, Yoshifumi and Yamamoto, Wataru and Furukawa, Daiki and Siekhaus, Daria E and Sawaguchi, Akira and Toshima, Jiro},
  journal      = {Nature Communications},
  publisher    = {Nature Publishing Group},
  title        = {{Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole}},
  doi          = {10.1038/ncomms4498},
  volume       = {5},
  year         = {2014},
}

@inproceedings{2026,
  abstract     = {We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker PRISM; secondly, deterministic generalized Rabin automata, which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to PRISM and show that this leads to a significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.},
  author       = {Komárková, Zuzana and Kretinsky, Jan},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  editor       = {Cassez, Franck and Raskin, Jean-François},
  location     = {Sydney, Australia},
  pages        = {235 -- 241},
  publisher    = {Springer},
  title        = {{Rabinizer 3: Safraless translation of ltl to small deterministic automata}},
  doi          = {10.1007/978-3-319-11936-6_17},
  volume       = {8837},
  year         = {2014},
}

@inproceedings{2027,
  abstract     = {We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.},
  author       = {Brázdil, Tomáš and Chatterjee, Krishnendu and Chmelik, Martin and Forejt, Vojtěch and Kretinsky, Jan and Kwiatkowska, Marta and Parker, David and Ujma, Mateusz},
  booktitle    = { Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  editor       = {Cassez, Franck and Raskin, Jean-François},
  location     = {Sydney, Australia},
  pages        = {98 -- 114},
  publisher    = {Society of Industrial and Applied Mathematics},
  title        = {{Verification of markov decision processes using learning algorithms}},
  doi          = {10.1007/978-3-319-11936-6_8},
  volume       = {8837},
  year         = {2014},
}

@article{2028,
  abstract     = {Understanding the dynamics of noisy neurons remains an important challenge in neuroscience. Here, we describe a simple probabilistic model that accurately describes the firing behavior in a large class (type II) of neurons. To demonstrate the usefulness of this model, we show how it accurately predicts the interspike interval (ISI) distributions, bursting patterns and mean firing rates found by: (1) simulations of the classic Hodgkin-Huxley model with channel noise, (2) experimental data from squid giant axon with a noisy input current and (3) experimental data on noisy firing from a neuron within the suprachiasmatic nucleus (SCN). This simple model has 6 parameters, however, in some cases, two of these parameters are coupled and only 5 parameters account for much of the known behavior. From these parameters, many properties of spiking can be found through simple calculation. Thus, we show how the complex effects of noise can be understood through a simple and general probabilistic model.},
  author       = {Bodova, Katarina and Paydarfar, David and Forger, Daniel},
  journal      = { Journal of Theoretical Biology},
  pages        = {40 -- 54},
  publisher    = {Academic Press},
  title        = {{Characterizing spiking in noisy type II neurons}},
  doi          = {10.1016/j.jtbi.2014.09.041},
  volume       = {365},
  year         = {2014},
}

@article{2029,
  abstract     = {Spin-wave theory is a key ingredient in our comprehension of quantum spin systems, and is used successfully for understanding a wide range of magnetic phenomena, including magnon condensation and stability of patterns in dipolar systems. Nevertheless, several decades of research failed to establish the validity of spin-wave theory rigorously, even for the simplest models of quantum spins. A rigorous justification of the method for the three-dimensional quantum Heisenberg ferromagnet at low temperatures is presented here. We derive sharp bounds on its free energy by combining a bosonic formulation of the model introduced by Holstein and Primakoff with probabilistic estimates and operator inequalities.},
  author       = {Correggi, Michele and Giuliani, Alessandro and Seiringer, Robert},
  journal      = {EPL},
  number       = {2},
  publisher    = {IOP Publishing Ltd.},
  title        = {{Validity of spin-wave theory for the quantum Heisenberg model}},
  doi          = {10.1209/0295-5075/108/20003},
  volume       = {108},
  year         = {2014},
}

@article{2031,
  abstract     = {A puzzling property of synaptic transmission, originally established at the neuromuscular junction, is that the time course of transmitter release is independent of the extracellular Ca2+ concentration ([Ca2+]o), whereas the rate of release is highly [Ca2+]o-dependent. Here, we examine the time course of release at inhibitory basket cell-Purkinje cell synapses and show that it is independent of [Ca2+]o. Modeling of Ca2+-dependent transmitter release suggests that the invariant time course of release critically depends on tight coupling between Ca2+ channels and release sensors. Experiments with exogenous Ca2+ chelators reveal that channel-sensor coupling at basket cell-Purkinje cell synapses is very tight, with a mean distance of 10–20 nm. Thus, tight channel-sensor coupling provides a mechanistic explanation for the apparent [Ca2+]o independence of the time course of release.},
  author       = {Arai, Itaru and Jonas, Peter M},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse}},
  doi          = {10.7554/eLife.04057},
  volume       = {3},
  year         = {2014},
}

@article{2032,
  abstract     = {As light-based control of fundamental signaling pathways is becoming a reality, the field of optogenetics is rapidly moving beyond neuroscience. We have recently developed receptor tyrosine kinases that are activated by light and control cell proliferation, epithelial–mesenchymal transition, and angiogenic sprouting—cell behaviors central to cancer progression.},
  author       = {Inglés Prieto, Álvaro and Gschaider-Reichhart, Eva and Schelch, Karin and Janovjak, Harald L and Grusch, Michael},
  journal      = {Molecular and Cellular Oncology},
  number       = {4},
  publisher    = {Taylor & Francis},
  title        = {{The optogenetic promise for oncology: Episode I}},
  doi          = {10.4161/23723548.2014.964045},
  volume       = {1},
  year         = {2014},
}

@inproceedings{2033,
  abstract     = {The learning with privileged information setting has recently attracted a lot of attention within the machine learning community, as it allows the integration of additional knowledge into the training process of a classifier, even when this comes in the form of a data modality that is not available at test time. Here, we show that privileged information can naturally be treated as noise in the latent function of a Gaussian process classifier (GPC). That is, in contrast to the standard GPC setting, the latent function is not just a nuisance but a feature: it becomes a natural measure of confidence about the training data by modulating the slope of the GPC probit likelihood function. Extensive experiments on public datasets show that the proposed GPC method using privileged noise, called GPC+, improves over a standard GPC without privileged knowledge, and also over the current state-of-the-art SVM-based method, SVM+. Moreover, we show that advanced neural networks and deep learning methods can be compressed as privileged information.},
  author       = {Hernandez Lobato, Daniel and Sharmanska, Viktoriia and Kersting, Kristian and Lampert, Christoph and Quadrianto, Novi},
  booktitle    = {Advances in Neural Information Processing Systems},
  location     = {Montreal, Canada},
  number       = {January},
  pages        = {837--845},
  publisher    = {Neural Information Processing Systems},
  title        = {{Mind the nuisance: Gaussian process classification using privileged noise}},
  volume       = {1},
  year         = {2014},
}

@article{2036,
  abstract     = { In rapidly changing environments, selection history may impact the dynamics of adaptation. Mutations selected in one environment may result in pleiotropic fitness trade-offs in subsequent novel environments, slowing the rates of adaptation. Epistatic interactions between mutations selected in sequential stressful environments may slow or accelerate subsequent rates of adaptation, depending on the nature of that interaction. We explored the dynamics of adaptation during sequential exposure to herbicides with different modes of action in Chlamydomonas reinhardtii. Evolution of resistance to two of the herbicides was largely independent of selection history. For carbetamide, previous adaptation to other herbicide modes of action positively impacted the likelihood of adaptation to this herbicide. Furthermore, while adaptation to all individual herbicides was associated with pleiotropic fitness costs in stress-free environments, we observed that accumulation of resistance mechanisms was accompanied by a reduction in overall fitness costs. We suggest that antagonistic epistasis may be a driving mechanism that enables populations to more readily adapt in novel environments. These findings highlight the potential for sequences of xenobiotics to facilitate the rapid evolution of multiple-drug and -pesticide resistance, as well as the potential for epistatic interactions between adaptive mutations to facilitate evolutionary rescue in rapidly changing environments. },
  author       = {Lagator, Mato and Colegrave, Nick and Neve, Paul},
  journal      = {Proceedings of the Royal Society of London Series B Biological Sciences},
  number       = {1794},
  publisher    = {Royal Society, The},
  title        = {{Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses}},
  doi          = {10.1098/rspb.2014.1679},
  volume       = {281},
  year         = {2014},
}

@article{2038,
  abstract     = {Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.},
  author       = {Boker, Udi and Chatterjee, Krishnendu and Henzinger, Thomas A and Kupferman, Orna},
  journal      = {ACM Transactions on Computational Logic (TOCL)},
  number       = {4},
  publisher    = {ACM},
  title        = {{Temporal specifications with accumulative values}},
  doi          = {10.1145/2629686},
  volume       = {15},
  year         = {2014},
}

@article{2039,
  abstract     = {A fundamental question in biology is the following: what is the time scale that is needed for evolutionary innovations? There are many results that characterize single steps in terms of the fixation time of new mutants arising in populations of certain size and structure. But here we ask a different question, which is concerned with the much longer time scale of evolutionary trajectories: how long does it take for a population exploring a fitness landscape to find target sequences that encode new biological functions? Our key variable is the length, (Formula presented.) of the genetic sequence that undergoes adaptation. In computer science there is a crucial distinction between problems that require algorithms which take polynomial or exponential time. The latter are considered to be intractable. Here we develop a theoretical approach that allows us to estimate the time of evolution as function of (Formula presented.) We show that adaptation on many fitness landscapes takes time that is exponential in (Formula presented.) even if there are broad selection gradients and many targets uniformly distributed in sequence space. These negative results lead us to search for specific mechanisms that allow evolution to work on polynomial time scales. We study a regeneration process and show that it enables evolution to work in polynomial time.},
  author       = {Chatterjee, Krishnendu and Pavlogiannis, Andreas and Adlam, Ben and Nowak, Martin},
  journal      = {PLoS Computational Biology},
  number       = {9},
  publisher    = {Public Library of Science},
  title        = {{The time scale of evolutionary innovation}},
  doi          = {10.1371/journal.pcbi.1003818},
  volume       = {10},
  year         = {2014},
}

@article{2040,
  abstract     = {Development requires tissue growth as well as cell diversification. To address how these processes are coordinated, we analyzed the development of molecularly distinct domains of neural progenitors in the mouse and chick neural tube. We show that during development, these domains undergo changes in size that do not scale with changes in overall tissue size. Our data show that domain proportions are first established by opposing morphogen gradients and subsequently controlled by domain-specific regulation of differentiation rate but not differences in proliferation rate. Regulation of differentiation rate is key to maintaining domain proportions while accommodating both intra- and interspecies variations in size. Thus, the sequential control of progenitor specification and differentiation elaborates pattern without requiring that signaling gradients grow as tissues expand. },
  author       = {Kicheva, Anna and Bollenbach, Mark Tobias and Ribeiro, Ana and Pérez Valle, Helena and Lovell Badge, Robin and Episkopou, Vasso and Briscoe, James},
  journal      = {Science},
  number       = {6204},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Coordination of progenitor specification and growth in mouse and chick spinal cord}},
  doi          = {10.1126/science.1254927},
  volume       = {345},
  year         = {2014},
}

@article{2041,
  abstract     = {The hippocampus mediates several higher brain functions, such as learning, memory, and spatial coding. The input region of the hippocampus, the dentate gyrus, plays a critical role in these processes. Several lines of evidence suggest that the dentate gyrus acts as a preprocessor of incoming information, preparing it for subsequent processing in CA3. For example, the dentate gyrus converts input from the entorhinal cortex, where cells have multiple spatial fields, into the spatially more specific place cell activity characteristic of the CA3 region. Furthermore, the dentate gyrus is involved in pattern separation, transforming relatively similar input patterns into substantially different output patterns. Finally, the dentate gyrus produces a very sparse coding scheme in which only a very small fraction of neurons are active at any one time.},
  author       = {Jonas, Peter M and Lisman, John},
  journal      = {Frontiers in Neural Circuits},
  publisher    = {Frontiers Research Foundation},
  title        = {{Structure, function and plasticity of hippocampal dentate gyrus microcircuits}},
  doi          = {10.3389/fncir.2014.00107},
  volume       = {8},
  year         = {2014},
}

@article{2042,
  abstract     = {Background: CRISPR is a microbial immune system likely to be involved in host-parasite coevolution. It functions using target sequences encoded by the bacterial genome, which interfere with invading nucleic acids using a homology-dependent system. The system also requires protospacer associated motifs (PAMs), short motifs close to the target sequence that are required for interference in CRISPR types I and II. Here, we investigate whether PAMs are depleted in phage genomes due to selection pressure to escape recognition.Results: To this end, we analyzed two data sets. Phages infecting all bacterial hosts were analyzed first, followed by a detailed analysis of phages infecting the genus Streptococcus, where PAMs are best understood. We use two different measures of motif underrepresentation that control for codon bias and the frequency of submotifs. We compare phages infecting species with a particular CRISPR type to those infecting species without that type. Since only known PAMs were investigated, the analysis is restricted to CRISPR types I-C and I-E and in Streptococcus to types I-C and II. We found evidence for PAM depletion in Streptococcus phages infecting hosts with CRISPR type I-C, in Vibrio phages infecting hosts with CRISPR type I-E and in Streptococcus thermopilus phages infecting hosts with type II-A, known as CRISPR3.Conclusions: The observed motif depletion in phages with hosts having CRISPR can be attributed to selection rather than to mutational bias, as mutational bias should affect the phages of all hosts. This observation implies that the CRISPR system has been efficient in the groups discussed here.},
  author       = {Kupczok, Anne and Bollback, Jonathan P},
  journal      = {BMC Genomics},
  number       = {1},
  publisher    = {BioMed Central},
  title        = {{Motif depletion in bacteriophages infecting hosts with CRISPR systems}},
  doi          = {10.1186/1471-2164-15-663},
  volume       = {15},
  year         = {2014},
}

@inproceedings{2043,
  abstract     = {Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems [1], we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (109) elements within seconds on a cluster with 32 nodes using less than 6GB of memory per node.},
  author       = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan},
  booktitle    = {Proceedings of the Workshop on Algorithm Engineering and Experiments},
  editor       = { McGeoch, Catherine and Meyer, Ulrich},
  location     = {Portland, USA},
  pages        = {31 -- 38},
  publisher    = {Society of Industrial and Applied Mathematics},
  title        = {{Distributed computation of persistent homology}},
  doi          = {10.1137/1.9781611973198.4},
  year         = {2014},
}

@inbook{2044,
  abstract     = {We present a parallel algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques, which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we further improve the performance through parallel computation.},
  author       = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan},
  booktitle    = {Topological Methods in Data Analysis and Visualization III},
  editor       = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald},
  pages        = {103 -- 117},
  publisher    = {Springer},
  title        = {{Clear and Compress: Computing Persistent Homology in Chunks}},
  doi          = {10.1007/978-3-319-04099-8_7},
  year         = {2014},
}

@inproceedings{2045,
  abstract     = {We introduce and study a new notion of enhanced chosen-ciphertext security (ECCA) for public-key encryption. Loosely speaking, in the ECCA security experiment, the decryption oracle provided to the adversary is augmented to return not only the output of the decryption algorithm on a queried ciphertext but also of a randomness-recovery algorithm associated to the scheme. Our results mainly concern the case where the randomness-recovery algorithm is efficient. We provide constructions of ECCA-secure encryption from adaptive trapdoor functions as defined by Kiltz et al. (EUROCRYPT 2010), resulting in ECCA encryption from standard number-theoretic assumptions. We then give two applications of ECCA-secure encryption: (1) We use it as a unifying concept in showing equivalence of adaptive trapdoor functions and tag-based adaptive trapdoor functions, resolving an open question of Kiltz et al. (2) We show that ECCA-secure encryption can be used to securely realize an approach to public-key encryption with non-interactive opening (PKENO) originally suggested by Damgård and Thorbek (EUROCRYPT 2007), resulting in new and practical PKENO schemes quite different from those in prior work. Our results demonstrate that ECCA security is of both practical and theoretical interest.},
  author       = {Dachman Soled, Dana and Fuchsbauer, Georg and Mohassel, Payman and O’Neill, Adam},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  editor       = {Krawczyk, Hugo},
  location     = {Buenos Aires, Argentina},
  pages        = {329 -- 344},
  publisher    = {Springer},
  title        = {{Enhanced chosen-ciphertext security and applications}},
  doi          = {10.1007/978-3-642-54631-0_19},
  volume       = {8383},
  year         = {2014},
}

@inproceedings{2046,
  abstract     = {We introduce policy-based signatures (PBS), where a signer can only sign messages conforming to some authority-specified policy. The main requirements are unforgeability and privacy, the latter meaning that signatures not reveal the policy. PBS offers value along two fronts: (1) On the practical side, they allow a corporation to control what messages its employees can sign under the corporate key. (2) On the theoretical side, they unify existing work, capturing other forms of signatures as special cases or allowing them to be easily built. Our work focuses on definitions of PBS, proofs that this challenging primitive is realizable for arbitrary policies, efficient constructions for specific policies, and a few representative applications.},
  author       = {Bellare, Mihir and Fuchsbauer, Georg},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  editor       = {Krawczyk, Hugo},
  location     = {Buenos Aires, Argentina},
  pages        = {520 -- 537},
  publisher    = {Springer},
  title        = {{Policy-based signatures}},
  doi          = {10.1007/978-3-642-54631-0_30},
  volume       = {8383},
  year         = {2014},
}

@inproceedings{2047,
  abstract     = {Following the publication of an attack on genome-wide association studies (GWAS) data proposed by Homer et al., considerable attention has been given to developing methods for releasing GWAS data in a privacy-preserving way. Here, we develop an end-to-end differentially private method for solving regression problems with convex penalty functions and selecting the penalty parameters by cross-validation. In particular, we focus on penalized logistic regression with elastic-net regularization, a method widely used to in GWAS analyses to identify disease-causing genes. We show how a differentially private procedure for penalized logistic regression with elastic-net regularization can be applied to the analysis of GWAS data and evaluate our method’s performance.},
  author       = {Yu, Fei and Rybar, Michal and Uhler, Caroline and Fienberg, Stephen},
  booktitle    = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  editor       = {Domingo Ferrer, Josep},
  location     = {Ibiza, Spain},
  pages        = {170 -- 184},
  publisher    = {Springer},
  title        = {{Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases}},
  doi          = {10.1007/978-3-319-11257-2_14},
  volume       = {8744},
  year         = {2014},
}