@inproceedings{772, abstract = {Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most non-blocking commercial code is only lock-free. This paper suggests a simple solution to this problem. We show that, for a large class of lock-free algorithms, under scheduling conditions which approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can keep on designing simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes with the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1, but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. To the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst case adversary, in a stochastic model capturing their expected asymptotic behavior.}, author = {Alistarh, Dan-Adrian and Censor Hillel, Keren and Shavit, Nir}, booktitle = {Proceedings of the forty-sixth annual ACM symposium on Theory of computing}, isbn = {9781450327107}, location = {New York, NY, United States}, pages = {714 -- 723}, publisher = {ACM}, title = {{Are lock-free concurrent algorithms practically wait-free?}}, doi = {10.1145/2591796.2591836}, year = {2014}, } @article{809, abstract = {The assembly of HIV-1 is mediated by oligomerization of the major structural polyprotein, Gag, into a hexameric protein lattice at the plasma membrane of the infected cell. This leads to budding and release of progeny immature virus particles. Subsequent proteolytic cleavage of Gag triggers rearrangement of the particles to form mature infectious virions. Obtaining a structural model of the assembled lattice of Gag within immature virus particles is necessary to understand the interactions that mediate assembly of HIV-1 particles in the infected cell, and to describe the substrate that is subsequently cleaved by the viral protease. An 8-Å resolution structure of an immature virus-like tubular array assembled from a Gag-derived protein of the related retrovirus Mason-Pfizer monkey virus (M-PMV) has previously been reported, and a model for the arrangement of the HIV-1 capsid (CA) domains has been generated based on homology to this structure. Here we have assembled tubular arrays of a HIV-1 Gag-derived protein with an immature-like arrangement of the C-terminal CA domains and have solved their structure by using hybrid cryo-EM and tomography analysis. The structure reveals the arrangement of the C-terminal domain of CA within an immature-like HIV-1 Gag lattice, and provides, to our knowledge, the first high-resolution view of the region immediately downstream of CA, which is essential for assembly, and is significantly different from the respective region in M-PMV. Our results reveal a hollow column of density for this region in HIV-1 that is compatible with the presence of a six-helix bundle at this position.}, author = {Bharata, Tanmay and Menendez, Luis and Hagena, Wim and Luxd, Vanda and Igonete, Sebastien and Schorba, Martin and Schur, Florian and Kraüsslich, Hans and Briggsa, John}, issn = {1091-6490}, journal = {PNAS}, number = {22}, pages = {8233 -- 8238}, publisher = {National Academy of Sciences}, title = {{Cryo electron microscopy of tubular arrays of HIV-1 Gag resolves structures essential for immature virus assembly}}, doi = {10.1073/pnas.1401455111}, volume = {111}, year = {2014}, } @inproceedings{771, abstract = {We consider the following natural problem: n failure-prone servers, communicating synchronously through message passing, must assign themselves one-to-one to n distinct items. Existing literature suggests two possible approaches to this problem. First, model it as an instance of tight renaming in synchronous message-passing systems; for deterministic solutions, a tight bound of ©(logn) communication rounds is known. Second, model the scenario as an instance of randomized load-balancing, for which elegant sub-logarithmic solutions exist. However, careful examination reveals that known load-balancing schemes do not apply to our scenario, because they either do not tolerate faults or do not ensure one-to-one allocation. It is thus natural to ask if sublogarithmic solutions exist for this apparently simple but intriguing problem. In this paper, we combine the two approaches to provide a new randomized solution for tight renaming, which terminates in O (log log n) communication rounds with high probability, against a strong adaptive adversary. Our solution, called Balls-into-Leaves, combines the deterministic approach with a new randomized scheme to obtain perfectly balanced allocations. The algorithm arranges the items as leaves of a tree, and participants repeatedly perform random choices among the leaves. The algorithm exchanges information in each round to split the participants into progressively smaller groups whose random choices do not conflict. We then extend the algorithm to terminate early in O(log log) rounds w.h.p., where is the actual number of failures. These results imply an exponential separation between deterministic and randomized algorithms for the tight renaming problem in message-passing systems.}, author = {Alistarh, Dan-Adrian and Denysyuk, Oksana and Rodrígues, Luís and Shavit, Nir}, booktitle = {Proceedings of the 2014 ACM symposium on Principles of distributed computing}, isbn = {9781450329446}, location = {Paris, France}, pages = {232 -- 241}, publisher = {ACM}, title = {{Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems}}, doi = {10.1145/2611462.2611499}, year = {2014}, } @inproceedings{774, abstract = {Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers would prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is in general a complex undertaking, and the resulting algorithms are not always efficient, so most non-blocking commercial code is only lock-free, and the design of efficient wait-free algorithms has been left to the academic community. In [2], we suggest a solution to this problem. We show that, for a large class of lock-free algorithms, under scheduling conditions which approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can keep on designing simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes with the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1, but that in fact a broad subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes.}, author = {Alistarh, Dan-Adrian and Censor Hille, Keren and Shavit, Nir}, booktitle = {Proceedings of the 2014 ACM symposium on Principles of distributed computing}, isbn = {9781450329446}, location = {Paris, France}, pages = {50 -- 52}, publisher = {ACM}, title = {{Brief announcement: Are lock-free concurrent algorithms practically wait-free?}}, doi = {10.1145/2611462.2611502}, year = {2014}, } @inproceedings{768, abstract = {Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation, and we prove that our solution is optimal within logarithmic factors. The main algorithmic idea is a randomized concurrent data structure called a dynamic to-do tree, which allows processes to pick new tasks to perform at random from the set of available tasks, and to insert tasks at random empty locations in the data structure. Our analysis shows that these properties avoid duplicating work unnecessarily. On the other hand, since the adversary controls the input as well the scheduling, it can induce executions where lots of processes contend for a few available tasks, which is inefficient. However, we prove that every algorithm has the same problem: given an arbitrary input, if OPT is the worst-case complexity of the optimal algorithm on that input, then the expected work complexity of our algorithm on the same input is O(OPT log3 m), where m is an upper bound on the number of tasks that are present in the system at any given time.}, author = {Alistarh, Dan-Adrian and Aspnes, James and Bender, Michael and Gelashvili, Rati and Gilbert, Seth}, booktitle = {Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms}, isbn = {9781611973389}, location = {Portland, OR, United States}, pages = {416 -- 435}, publisher = {SIAM}, title = {{Dynamic task allocation in asynchronous shared memory}}, doi = {10.1137/1.9781611973402.31}, year = {2014}, } @inproceedings{770, abstract = {Dynamic memory reclamation is arguably the biggest open problem in concurrent data structure design: All known solutions induce high overhead, or must be customized to the specific data structure by the programmer, or both. This paper presents StackTrack, the first concurrent memory reclamation scheme that can be applied automatically by a compiler, while maintaining efficiency. StackTrack eliminates most of the expensive bookkeeping required for memory reclamation by leveraging the power of hardware transactional memory (HTM) in a new way: it tracks thread variables dynamically, and in an atomic fashion. This effectively makes all memory references visible without having threads pay the overhead of writing out this information. Our empirical results show that this new approach matches or outperforms prior, non-automated, techniques.}, author = {Alistarh, Dan-Adrian and Eugster, Patrick and Herlihy, Maurice and Matveev, Alexander and Shavit, Nir}, booktitle = {Proceedings of the Ninth European Conference on Computer Systems}, isbn = {9781450327046}, location = {Amsterdam, The Netherlands}, publisher = {ACM}, title = {{StackTrack: An automated transactional approach to concurrent memory reclamation}}, doi = {10.1145/2592798.2592808}, year = {2014}, } @article{769, abstract = {This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual lower bound of ω(k) process steps for deterministic renaming into any namespace of size subexponential in k, where k is the number of participants. The bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic concurrent fetch-and-increment counters, queues, and stacks. The proof is based on a new reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement this individual bound with a global lower bound of ω(klog(k/c)) on the total step complexity of renaming into a namespace of size ck, for any c = 1. This result applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter implementations, that are tight within logarithmic factors. On the algorithmic side, we give a protocol that transforms any sorting network into a randomized strong adaptive renaming algorithm, with expected cost equal to the depth of the sorting network. This gives a tight adaptive renaming algorithm with expected step complexity O(log k), where k is the contention in the current execution. This algorithm is the first to achieve sublinear time, and it is time-optimal as per our randomized lower bound. Finally, we use this renaming protocol to build monotone-consistent counters with logarithmic step complexity and linearizable fetch-and-increment registers with polylogarithmic cost.}, author = {Alistarh, Dan-Adrian and Aspnes, James and Censor Hillel, Keren and Gilbert, Seth and Guerraoui, Rachid}, journal = {Journal of the ACM}, number = {3}, pages = {1--51}, publisher = {ACM}, title = {{Tight bounds for asynchronous renaming}}, doi = {10.1145/2597630}, volume = {61}, year = {2014}, } @article{451, abstract = {We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, using the technique based on a chain contraction from the original chain complex to a reduced one that represents its homology. This work is based on previous results for simplicial complexes, and uses Serre’s diagonalization for cubical cells. An implementation in C++ of the introduced algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with some examples. The paper is self-contained as much as possible, and is written at a very elementary level, so that basic knowledge of algebraic topology should be sufficient to follow it.}, author = {Pilarczyk, Pawel and Real, Pedro}, issn = {1572-9044}, journal = {Advances in Computational Mathematics}, number = {1}, pages = {253 -- 275}, publisher = {Kluwer}, title = {{Computation of cubical homology, cohomology, and (co)homological operations via chain contraction}}, doi = {10.1007/s10444-014-9356-1}, volume = {41}, year = {2014}, } @article{589, abstract = {We demonstrate a many-atom-cavity system with a high-finesse dual-wavelength standing wave cavity in which all participating rubidium atoms are nearly identically coupled to a 780-nm cavity mode. This homogeneous coupling is enforced by a one-dimensional optical lattice formed by the field of a 1560-nm cavity mode.}, author = {Lee, Jongmin and Vrijsen, Geert and Teper, Igor and Hosten, Onur and Kasevich, Mark}, issn = {1539-4794}, journal = {Optics Letters}, number = {13}, pages = {4005 -- 4008}, publisher = {OSA}, title = {{Many-atom-cavity QED system with homogeneous atom-cavity coupling}}, doi = {10.1364/OL.39.004005}, volume = {39}, year = {2014}, } @article{355, abstract = {We report on the photocatalytic hydrogen evolution under full-arc light irradiation of CuIn1-xGaxS2 wurtzite nanocrystals in the presence of SO3 2- and S2- as sacrificial reagents. We analyzed the hydrogen generation rate as a function of the Ga content and associated it with the energy band positions. For photocatalytic water splitting, the CuInS2 bandgap is slightly too low to efficiently overcome the reaction over-potential. The presence of Ga shifts up the CuInS2 conduction band edge providing a larger driving force for photogenerated carriers to activate the water splitting reduction reaction. The larger the Ga content, the more energetically favorable the electron injection, and thus a more efficient use of the photogenerated carriers is reached. However, the band gap increase associated with the Ga incorporation reduces the concentration of photogenerated carriers available for water splitting, and consequently a lower hydrogen conversion rate is obtained for very high Ga contents. The optimum Ga concentration was experimentally found at CuIn0.3Ga0.7S2. }, author = {Yu, Xuelian and An, Xiaoqiang and Shavel, Alexey and Ibáñez, Maria and Cabot, Andreu}, issn = {2050-7496}, journal = {Journal of Materials Chemistry A}, number = {31}, pages = {12317 -- 12322}, publisher = {Royal Society of Chemistry}, title = {{The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals}}, doi = {10.1039/c4ta01315h}, volume = {2}, year = {2014}, } @article{332, abstract = {Cu2ZnSnS4, based on abundant and environmental friendly elements and with a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion through both photovoltaics and photocatalysis. We detail here the synthesis of quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions. We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured nanoparticles. Such heterostructured nanoparticles are shown to have excellent photocatalytic properties toward degradation of Rhodamine B and hydrogen generation by water splitting. }, author = {Yu, Xuelian and Shavel, Alexey and An, Xiaoqiang and Luo, Zhishan and Ibáñez, Maria and Cabot, Andreu}, issn = {1520-5126}, journal = {Journal of the American Chemical Society}, number = {26}, pages = {9236 -- 9239}, publisher = {ACS}, title = {{Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting and pollutant degradation}}, doi = {10.1021/ja502076b}, volume = {136}, year = {2014}, } @article{357, abstract = {Near-resonant Raman scattering measurements of zinc sulfide nanoparticles and thin films have been made and correlated to grain and particle size, respectively, using a 325 nm wavelength excitation source. The area ratios between the first, second, and third order peaks of ZnS identified as the T 2(LO) mode decrease with increasing ZnS grain size. This is an effect attributed to changes in the bandgap energy from quantum confinement due to the varying grain size between the films/particles, as noted by a shift in the room temperature photoluminescence emission corresponding to the free exciton emission energy. While Raman scattering spectroscopy is typically limited to identification of phases and their crystalline properties, it is possible to attain more than such straightforward information by calibrating the spectral features to variations between sets of samples. These results open the possibility of making a quantitative grain size estimation in ZnS thin films and nanostructures, as well as in other material systems where ZnS may be expected as a secondary phase, such as Cu2ZnSnS4. Additionally, more commonly used excitation wavelengths for Raman scattering, such as 514 and 532 nm, are shown to be of limited use in characterizing ZnS thin films due to the extremely low Raman scattering efficiency of ZnS in films with sub-micron thicknesses. }, author = {Fairbrother, Andrew and Izquierdo Roca, Victor and Fontané, Xavier and Ibáñez, Maria and Cabot, Andreu and Saucedo, Edgardo and Pérez Rodríguez, Alejandro}, issn = {1466-8033}, journal = {CrystEngComm}, number = {20}, pages = {4120 -- 4125}, publisher = {Royal Society of Chemistry}, title = {{ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive grain size estimation}}, doi = {10.1039/c3ce42578a}, volume = {16}, year = {2014}, } @article{1999, abstract = {Selection for disease control is believed to have contributed to shape the organisation of insect societies — leading to interaction patterns that mitigate disease transmission risk within colonies, conferring them ‘organisational immunity’. Recent studies combining epidemiological models with social network analysis have identified general properties of interaction networks that may hinder propagation of infection within groups. These can be prophylactic and/or induced upon pathogen exposure. Here we review empirical evidence for these two types of organisational immunity in social insects and describe the individual-level behaviours that underlie it. We highlight areas requiring further investigation, and emphasise the need for tighter links between theory and empirical research and between individual-level and collective-level analyses.}, author = {Stroeymeyt, Nathalie and Casillas Perez, Barbara E and Cremer, Sylvia}, journal = {Current Opinion in Insect Science}, number = {1}, pages = {1 -- 15}, publisher = {Elsevier}, title = {{Organisational immunity in social insects}}, doi = {10.1016/j.cois.2014.09.001}, volume = {5}, year = {2014}, } @article{10895, abstract = {Due to their sessile lifestyles, plants need to deal with the limitations and stresses imposed by the changing environment. Plants cope with these by a remarkable developmental flexibility, which is embedded in their strategy to survive. Plants can adjust their size, shape and number of organs, bend according to gravity and light, and regenerate tissues that were damaged, utilizing a coordinating, intercellular signal, the plant hormone, auxin. Another versatile signal is the cation, Ca2+, which is a crucial second messenger for many rapid cellular processes during responses to a wide range of endogenous and environmental signals, such as hormones, light, drought stress and others. Auxin is a good candidate for one of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling is poorly understood. Here, we will provide an overview of possible developmental and physiological roles, as well as mechanisms underlying the interconnection of Ca2+ and auxin signaling. }, author = {Vanneste, Steffen and Friml, Jiří}, issn = {2223-7747}, journal = {Plants}, keywords = {Plant Science, Ecology, Ecology, Evolution, Behavior and Systematics}, number = {4}, pages = {650--675}, publisher = {MDPI}, title = {{Calcium: The missing link in auxin action}}, doi = {10.3390/plants2040650}, volume = {2}, year = {2013}, } @inproceedings{10897, abstract = {Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing.}, author = {Edelsbrunner, Herbert}, booktitle = {Graph-Based Representations in Pattern Recognition}, isbn = {9783642382208}, issn = {1611-3349}, location = {Vienna, Austria}, pages = {182--183}, publisher = {Springer Nature}, title = {{Persistent homology in image processing}}, doi = {10.1007/978-3-642-38221-5_19}, volume = {7877}, year = {2013}, } @inproceedings{10898, abstract = {A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.}, author = {Haas, Andreas and Lippautz, Michael and Henzinger, Thomas A and Payer, Hannes and Sokolova, Ana and Kirsch, Christoph M. and Sezgin, Ali}, booktitle = {Proceedings of the ACM International Conference on Computing Frontiers - CF '13}, isbn = {978-145032053-5}, location = {Ischia, Italy}, number = {5}, publisher = {ACM}, title = {{Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation}}, doi = {10.1145/2482767.2482789}, year = {2013}, } @inbook{10899, author = {Barton, Nicholas H}, booktitle = {Encyclopedia of Biodiversity}, isbn = {978-0-12-384720-1}, keywords = {Adaptive landscape, Cline, Coalescent process, Gene flow, Hybrid zone, Local adaptation, Natural selection, Neutral theory, Population structure, Speciation}, pages = {508--515}, publisher = {Elsevier}, title = {{Differentiation}}, doi = {10.1016/b978-0-12-384719-5.00031-9}, year = {2013}, } @inbook{10900, abstract = {Leukocyte migration through the interstitial space is crucial for the maintenance of tolerance and immunity. The main cues for leukocyte trafficking are chemokines thought to directionally guide these cells towards their targets. However, model systems that facilitate quantification of chemokine-guided leukocyte migration in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted mouse ears that allows the visualization of chemokine-dependent dendritic cell (DC) motility in the dermal interstitium in real time. We present methods for the preparation of mouse ear sheets and their use in multidimensional confocal imaging experiments to monitor and analyze the directional migration of fluorescently labelled DCs through the dermis and into afferent lymphatic vessels. The assay provides a more physiological approach to study leukocyte migration than in vitro three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen gels and transwell assays.}, author = {Weber, Michele and Sixt, Michael K}, booktitle = {Chemokines}, editor = {Cardona, Astrid and Ubogu, Eroboghene}, isbn = {9781627034258}, issn = {1940-6029}, pages = {215--226}, publisher = {Humana Press}, title = {{Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations}}, doi = {10.1007/978-1-62703-426-5_14}, volume = {1013}, year = {2013}, } @inproceedings{10902, abstract = {We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language.}, author = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Rubin, Sasha}, booktitle = {7th International Conference on Language and Automata Theory and Applications}, isbn = {9783642370632}, issn = {1611-3349}, location = {Bilbao, Spain}, pages = {214--225}, publisher = {Springer Nature}, title = {{How to travel between languages}}, doi = {10.1007/978-3-642-37064-9_20}, volume = {7810}, year = {2013}, } @article{11083, abstract = {Nuclear pore complex (NPC) proteins are known for their critical roles in regulating nucleocytoplasmic traffic of macromolecules across the nuclear envelope. However, recent findings suggest that some nucleoporins (Nups), including Nup98, have additional functions in developmental gene regulation. Nup98, which exhibits transcription-dependent mobility at the NPC but can also bind chromatin away from the nuclear envelope, is frequently involved in chromosomal translocations in a subset of patients suffering from acute myeloid leukemia (AML). A common paradigm suggests that Nup98 translocations cause aberrant transcription when they are recuited to aberrant genomic loci. Importantly, this model fails to account for the potential loss of wild type (WT) Nup98 function in the presence of Nup98 translocation mutants. Here we examine how the cell might regulate Nup98 nucleoplasmic protein levels to control transcription in healthy cells. In addition, we discuss the possibility that dominant negative Nup98 fusion proteins disrupt the transcriptional activity of WT Nup98 in the nucleoplasm to drive AML.}, author = {Franks, Tobias M. and HETZER, Martin W}, issn = {0962-8924}, journal = {Trends in Cell Biology}, keywords = {Cell Biology}, number = {3}, pages = {112--117}, publisher = {Elsevier}, title = {{The role of Nup98 in transcription regulation in healthy and diseased cells}}, doi = {10.1016/j.tcb.2012.10.013}, volume = {23}, year = {2013}, }