@inproceedings{11866,
  abstract     = {We present a deterministic (1+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here n is the number of nodes in the network and D is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+o(1))-approximation Õ(n1/2D1/4+D)-time algorithm of Nanongkai [STOC 2014] by a factor of as large as n1/8, and (ii) the O(є−1logє−1)-approximation factor of Lenzen and Patt-Shamir’s Õ(n1/2+є+D)-time algorithm [STOC 2013] within the same running time. Our running time matches the known time lower bound of Ω(n1/2/logn + D) [Das Sarma et al. STOC 2011] modulo some lower-order terms, thus essentially settling the status of this problem which was raised at least a decade ago [Elkin SIGACT News 2004]. It also implies a (2+o(1))-approximation O(n1/2+o(1)+D1+o(1))-time algorithm for approximating a network’s weighted diameter which almost matches the lower bound by Holzer et al. [PODC 2012].

In achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic, construction of an (no(1), o(1))-hop set of size O(n1+o(1)). We combine these techniques with many distributed algorithmic techniques, some of which from problems that are not directly related to shortest paths, e.g. ruling sets [Goldberg et al. STOC 1987], source detection [Lenzen, Peleg PODC 2013], and partial distance estimation [Lenzen, Patt-Shamir PODC 2015]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1+o(1))-approximation O(no(1))-time algorithm on congested cliques, and (ii) a (1+o(1))-approximation O(no(1)logW)-pass O(n1+o(1)logW)-space streaming algorithm, when edge weights are in {1, 2, …, W}. The first result answers an open problem in [Nanongkai, STOC 2014]. The second result partially answers an open problem raised by McGregor in 2006 [<pre>sublinear.info</pre>, Problem 14].},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {48th Annual ACM SIGACT Symposium on Theory of Computing},
  isbn         = {978-145034132-5},
  issn         = {0737-8017},
  location     = {Cambridge, MA, United States},
  pages        = {489 -- 498},
  publisher    = {Association for Computing Machinery},
  title        = {{A deterministic almost-tight distributed algorithm for approximating single-source shortest paths}},
  doi          = {10.1145/2897518.2897638},
  year         = {2016},
}

@inproceedings{11867,
  abstract     = {We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O(poly(logn, 1/є)) update time. (2) An algorithm that maintains an αK approximation of the value of the maximum matching with O(n2/K) update time in bipartite graphs, for every sufficiently large constant positive integer K. Here, 1≤ αK < 2 is a constant determined by the value of K. Result (1) is the first deterministic algorithm that can maintain an o(logn)-approximate maximum matching with polylogarithmic update time, improving the seminal result of Onak et al. [STOC 2010]. Its approximation guarantee almost matches the guarantee of the best randomized polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with arbitrarily small polynomial update time on bipartite graphs. Previously the best update time for this problem was O(m1/4) [Bernstein et al. ICALP 2015], where m is the current number of edges in the graph.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Nanongkai, Danupon},
  booktitle    = {48th Annual ACM SIGACT Symposium on Theory of Computing},
  isbn         = {978-145034132-5},
  issn         = {0737-8017},
  location     = {Cambridge, MA, United States},
  pages        = {398 -- 411},
  publisher    = {Association for Computing Machinery},
  title        = {{New deterministic approximation algorithms for fully dynamic matching}},
  doi          = {10.1145/2897518.2897568},
  year         = {2016},
}

@article{1188,
  abstract     = {We consider a population dynamics model coupling cell growth to a diffusion in the space of metabolic phenotypes as it can be obtained from realistic constraints-based modelling. 
In the asymptotic regime of slow
diffusion, that coincides with the relevant experimental range, the resulting
non-linear Fokker–Planck equation is solved for the steady state in the WKB
approximation that maps it into the ground state of a quantum particle in an
Airy potential plus a centrifugal term. We retrieve scaling laws for growth rate
fluctuations and time response with respect to the distance from the maximum
growth rate suggesting that suboptimal populations can have a faster response
to perturbations.},
  author       = {De Martino, Daniele and Masoero, Davide},
  journal      = { Journal of Statistical Mechanics: Theory and Experiment},
  number       = {12},
  publisher    = {IOP Publishing},
  title        = {{Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth}},
  doi          = {10.1088/1742-5468/aa4e8f},
  volume       = {2016},
  year         = {2016},
}

@phdthesis{1189,
  abstract     = {Within the scope of this thesis,  we show that a driven-dissipative system with
few ultracold atoms can exhibit dissipatively bound states, even if the atom-atom
interaction is purely repulsive.  This bond arises due to the dipole-dipole inter-
action, which is restricted to one of the lower electronic energy states, resulting
in the distance-dependent coherent population trapping.  The quality of this al-
ready established method of dissipative binding is improved and the application
is extended to higher dimensions and a larger number of atoms.  Here, we simu-
late two- and three-atom systems using an adapted approach to the Monte Carlo
wave-function  method  and  analyse  the  results.   Finally,  we  examine  the  possi-
bility  of  finding  a  setting  allowing  trimer  states  but  prohibiting  dimer  states.
In the context of open quantum systems, such a three-body bound states corre-
sponds to the driven-dissipative analogue of a Borromean state.  These states can
be detected in modern experiments with dipolar and Rydberg-dressed ultracold
atomic gases.
},
  author       = {Jochum, Clemens},
  pages        = {94},
  publisher    = {Technical University Vienna},
  title        = {{Dissipative Few-Body Quantum Systems}},
  year         = {2016},
}

@article{11891,
  abstract     = {We study dynamic (1+𝜖)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected 𝑛-node 𝑚-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and constant query time by Roditty and Zwick [SIAM J. Comput., 41 (2012), pp. 670--683]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [J. ACM, 28 (1981), pp. 1--4]; it has a total update time of 𝑂(𝑚𝑛2) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of 𝑂̃ (𝑛5/2/𝜖) and constant query time that has an additive error of 2 in addition to the 1+𝜖 multiplicative error. This beats the previous 𝑂̃ (𝑚𝑛/𝜖) time when 𝑚=Ω(𝑛3/2). Note that the additive error is unavoidable since, even in the static case, an 𝑂(𝑛3−𝛿)-time (a so-called truly subcubic) combinatorial algorithm with 1+𝜖 multiplicative error cannot have an additive error less than 2−𝜖, unless we make a major breakthrough for Boolean matrix multiplication [D. Dor, S. Halrepin, and U. Zwick, SIAM J. Comput., 29 (2000), pp. 1740--1759] and many other long-standing problems [V. Vassilevska Williams and R. Williams, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, pp. 645--654]. The algorithm can also be turned into a (2+𝜖)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3+𝜖)-approximation algorithm with 𝑂̃ (𝑛5/2+𝑂(log(1/𝜖)/log𝑛√)) running time of Bernstein and Roditty [Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 1355--1365] in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of 𝑂̃ (𝑚𝑛/𝜖) and a query time of 𝑂(loglog𝑛). The algorithm has a multiplicative error of 1+𝜖 and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in [Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, pp. 725--734]. The deterministic algorithm can be turned into a deterministic fully dynamic (1+𝜖)-approximation with an amortized update time of 𝑂̃ (𝑚𝑛/(𝜖𝑡)) and a query time of 𝑂̃ (𝑡) for every 𝑡≤𝑛√. In order to achieve our results, we introduce two new techniques: (i) A monotone Even--Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called a locally persevering emulator. (ii) A derandomization technique based on moving Even--Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  number       = {3},
  pages        = {947--1006},
  publisher    = {Society for Industrial & Applied Mathematics},
  title        = {{Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization}},
  doi          = {10.1137/140957299},
  volume       = {45},
  year         = {2016},
}

@inproceedings{1193,
  abstract     = {We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid &quot;bad features&quot;, or &quot;flaws&quot;. It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and &quot;resamples&quot; it using a &quot;resampling oracle&quot; provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new &quot;commutativity&quot; condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately.},
  author       = {Kolmogorov, Vladimir},
  booktitle    = {Proceedings - Annual IEEE Symposium on Foundations of Computer Science},
  location     = {New Brunswick, NJ, USA },
  publisher    = {IEEE},
  title        = {{Commutativity in the algorithmic Lovasz local lemma}},
  doi          = {10.1109/FOCS.2016.88},
  volume       = {2016-December},
  year         = {2016},
}

@article{1195,
  abstract     = {The genetic analysis of experimentally evolving populations typically relies on short reads from pooled individuals (Pool-Seq). While this method provides reliable allele frequency estimates, the underlying haplotype structure remains poorly characterized. With small population sizes and adaptive variants that start from low frequencies, the interpretation of selection signatures in most Evolve and Resequencing studies remains challenging. To facilitate the characterization of selection targets, we propose a new approach that reconstructs selected haplotypes from replicated time series, using Pool-Seq data. We identify selected haplotypes through the correlated frequencies of alleles carried by them. Computer simulations indicate that selected haplotype-blocks of several Mb can be reconstructed with high confidence and low error rates, even when allele frequencies change only by 20% across three replicates. Applying this method to real data from D. melanogaster populations adapting to a hot environment, we identify a selected haplotype-block of 6.93 Mb. We confirm the presence of this haplotype-block in evolved populations by experimental haplotyping, demonstrating the power and accuracy of our haplotype reconstruction from Pool-Seq data. We propose that the combination of allele frequency estimates with haplotype information will provide the key to understanding the dynamics of adaptive alleles. },
  author       = {Franssen, Susan and Barton, Nicholas H and Schlötterer, Christian},
  journal      = {Molecular Biology and Evolution},
  number       = {1},
  pages        = {174 -- 184},
  publisher    = {Oxford University Press},
  title        = {{Reconstruction of haplotype-blocks selected during experimental evolution.}},
  doi          = {10.1093/molbev/msw210},
  volume       = {34},
  year         = {2016},
}

@article{1197,
  abstract     = {Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina.},
  author       = {Prentice, Jason and Marre, Olivier and Ioffe, Mark and Loback, Adrianna and Tkacik, Gasper and Berry, Michael},
  journal      = {PLoS Computational Biology},
  number       = {11},
  publisher    = {Public Library of Science},
  title        = {{Error-robust modes of the retinal population code}},
  doi          = {10.1371/journal.pcbi.1005148},
  volume       = {12},
  year         = {2016},
}

@article{11983,
  abstract     = {A continuous process for the synthesis and inline separation of anhydrous trifluoromethyl diazomethane in a single continuous flow process is presented. The diazo building block is generated from the corresponding amine and NaNO2 under acidic, aqueous conditions and subsequently diffuses through a gas-permeable membrane into an organic stream. To avoid storage and transportation of the hazardous compound, a representative downstream process in a packed-bed reactor yielding highly functionalized building blocks was developed.},
  author       = {Pieber, Bartholomäus and Kappe, C. Oliver},
  issn         = {1523-7052},
  journal      = {Organic Letters},
  number       = {5},
  pages        = {1076--1079},
  publisher    = {American Chemical Society},
  title        = {{Generation and synthetic application of trifluoromethyl diazomethane utilizing continuous flow technologies}},
  doi          = {10.1021/acs.orglett.6b00194},
  volume       = {18},
  year         = {2016},
}

@article{11985,
  abstract     = {Hydrocodone, a high value active pharmaceutical ingredient (API), is usually produced in a semisynthetic pathway from morphine, codeine or thebaine. The latter alkaloid is an attractive precursor as it is not used as a remedy itself. The key step in this production route is a selective olefin reduction forming 8,14-dihydrothebaine which can be subsequently hydrolyzed to yield hydrocodone. Unfortunately, standard hydrogenation procedures cannot be applied due to severe selectivity problems. A transfer hydrogenation using in situ generated diimide is the only known alternative to achieve a selective transformation. The most (atom) economic generation of this highly unstable reducing agent is by oxidizing hydrazine hydrate (N2H4·H2O) with O2. In the past, this route was “forbidden” on an industrial scale due to its enormous explosion potential in batch. A continuous high-temperature/high-pressure methodology allows an efficient, safe, and scalable processing of the hazardous reaction mixture. The industrially relevant reduction was achieved by using four consecutive liquid feeds (of N2H4·H2O) and residence time units, resulting in a highly selective reduction within less than 1 h.},
  author       = {Pieber, Bartholomäus and Cox, D. Phillip and Kappe, C. Oliver},
  issn         = {1520-586X},
  journal      = {Organic Process Research and Development},
  number       = {2},
  pages        = {376--385},
  publisher    = {American Chemical Society},
  title        = {{Selective olefin reduction in thebaine using hydrazine hydrate and O₂ under intensified continuous flow conditions}},
  doi          = {10.1021/acs.oprd.5b00370},
  volume       = {20},
  year         = {2016},
}

@article{11988,
  abstract     = {A continuous Bucherer–Bergs hydantoin synthesis utilizing intensified conditions is reported. The methodology is characterized by a two-feed flow approach to independently feed the organic substrate and the aqueous reagent solution. The increased interfacial area of the biphasic reaction mixture and the lack of headspace enabled almost quantitative conversions within ca. 30 minutes at 120 °C and 20 bar even for unpolar starting materials. In addition, a selective N(3)-monoalkylation of the resulting heterocycles under batch microwave conditions is reported yielding potential acetylcholinesterase inhibitors.},
  author       = {Kappe, C. and Monteiro, Julia and Pieber, Bartholomäus and Corrêa, Arlene},
  issn         = {1437-2096},
  journal      = {Synlett},
  number       = {01},
  pages        = {83--87},
  publisher    = {Georg Thieme Verlag},
  title        = {{Continuous synthesis of hydantoins: Intensifying the Bucherer–Bergs reaction}},
  doi          = {10.1055/s-0035-1560317},
  volume       = {27},
  year         = {2016},
}

@article{1200,
  author       = {Hilbe, Christian and Traulsen, Arne},
  journal      = {Physics of Life Reviews},
  pages        = {29 -- 31},
  publisher    = {Elsevier},
  title        = {{Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze}},
  doi          = {10.1016/j.plrev.2016.10.004},
  volume       = {19},
  year         = {2016},
}

@article{1201,
  abstract     = {In this issue of Cell, Skau et al. show that the formin FMN2 organizes a perinuclear actin cytoskeleton that protects the nucleus and its genomic content of migrating cells squeezing through small spaces.},
  author       = {Renkawitz, Jörg and Sixt, Michael K},
  journal      = {Cell},
  number       = {6},
  pages        = {1448 -- 1449},
  publisher    = {Cell Press},
  title        = {{Formin’ a nuclear protection}},
  doi          = {10.1016/j.cell.2016.11.024},
  volume       = {167},
  year         = {2016},
}

@article{1202,
  author       = {Milutinovic, Barbara and Peuß, Robert and Ferro, Kevin and Kurtz, Joachim},
  journal      = {Zoology },
  number       = {4},
  pages        = {254 -- 261},
  publisher    = {Elsevier},
  title        = {{Immune priming in arthropods: an update focusing on the red flour beetle}},
  doi          = {10.1016/j.zool.2016.03.006},
  volume       = {119},
  year         = {2016},
}

@article{1203,
  abstract     = {Haemophilus haemolyticus has been recently discovered to have the potential to cause invasive disease. It is closely related to nontypeable Haemophilus influenzae (NT H. influenzae). NT H. influenzae and H. haemolyticus are often misidentified because none of the existing tests targeting the known phenotypes of H. haemolyticus are able to specifically identify H. haemolyticus. Through comparative genomic analysis of H. haemolyticus and NT H. influenzae, we identified genes unique to H. haemolyticus that can be used as targets for the identification of H. haemolyticus. A real-time PCR targeting purT (encoding phosphoribosylglycinamide formyltransferase 2 in the purine synthesis pathway) was developed and evaluated. The lower limit of detection was 40 genomes/PCR; the sensitivity and specificity in detecting H. haemolyticus were 98.9% and 97%, respectively. To improve the discrimination of H. haemolyticus and NT H. influenzae, a testing scheme combining two targets (H. haemolyticus purT and H. influenzae hpd, encoding protein D lipoprotein) was also evaluated and showed 96.7% sensitivity and 98.2% specificity for the identification of H. haemolyticus and 92.8% sensitivity and 100% specificity for the identification of H. influenzae, respectively. The dual-target testing scheme can be used for the diagnosis and surveillance of infection and disease caused by H. haemolyticus and NT H. influenzae.},
  author       = {Hu, Fang and Rishishwar, Lavanya and Sivadas, Ambily and Mitchell, Gabriel and King, Jordan and Murphy, Timothy and Gilsdorf, Janet and Mayer, Leonard and Wang, Xin},
  journal      = {Journal of Clinical Microbiology},
  number       = {12},
  pages        = {3010 -- 3017},
  publisher    = {American Society for Microbiology},
  title        = {{Comparative genomic analysis of Haemophilus haemolyticus and nontypeable Haemophilus influenzae and a new testing scheme for their discrimination}},
  doi          = {10.1128/JCM.01511-16},
  volume       = {54},
  year         = {2016},
}

@article{1204,
  abstract     = {In science, as in life, &quot;surprises&quot; can be adequately appreciated only in the presence of a null model, what we expect a priori. In physics, theories sometimes express the values of dimensionless physical constants as combinations of mathematical constants like π or e. The inverse problem also arises, whereby the measured value of a physical constant admits a &quot;surprisingly&quot; simple approximation in terms of well-known mathematical constants. Can we estimate the probability for this to be a mere coincidence, rather than an inkling of some theory? We answer the question in the most naive form.},
  author       = {Amir, Ariel and Lemeshko, Mikhail and Tokieda, Tadashi},
  journal      = {American Mathematical Monthly},
  number       = {6},
  pages        = {609 -- 612},
  publisher    = {Mathematical Association of America},
  title        = {{Surprises in numerical expressions of physical constants}},
  doi          = {10.4169/amer.math.monthly.123.6.609},
  volume       = {123},
  year         = {2016},
}

@inproceedings{1205,
  abstract     = {In this paper, we present a formal model-driven engineering approach to establishing a safety-assured implementation of Multifunction vehicle bus controller (MVBC) based on the generic reference models and requirements described in the International Electrotechnical Commission (IEC) standard IEC-61375. First, the generic models described in IEC-61375 are translated into a network of timed automata, and some safety requirements tested in IEC-61375 are formalized as timed computation tree logic (TCTL) formulas. With the help of Uppaal, we check and debug whether the timed automata satisfy the formulas or not. Within this step, several logic inconsistencies in the original standard are detected and corrected. Then, we apply the tool Times to generate C code from the verified model, which was later synthesized into a real MVBC chip. Finally, the runtime verification tool RMOR is applied to verify some safety requirements at the implementation level. We set up a real platform with worldwide mostly used MVBC D113, and verify the correctness and the scalability of the synthesized MVBC chip more comprehensively. The errors in the standard has been confirmed and the resulted MVBC has been deployed in real train communication network.},
  author       = {Jiang, Yu and Liu, Han and Song, Houbing and Kong, Hui and Gu, Ming and Sun, Jiaguang and Sha, Lui},
  location     = {Limassol, Cyprus},
  pages        = {757 -- 763},
  publisher    = {Springer},
  title        = {{Safety assured formal model driven design of the multifunction vehicle bus controller}},
  doi          = {10.1007/978-3-319-48989-6_47},
  volume       = {9995},
  year         = {2016},
}

@article{1206,
  abstract     = {We study a polar molecule immersed in a superfluid environment, such as a helium nanodroplet or a Bose–Einstein condensate, in the presence of a strong electrostatic field. We show that coupling of the molecular pendular motion, induced by the field, to the fluctuating bath leads to formation of pendulons—spherical harmonic librators dressed by a field of many-particle excitations. We study the behavior of the pendulon in a broad range of molecule–bath and molecule–field interaction strengths, and reveal that its spectrum features a series of instabilities which are absent in the field-free case of the angulon quasiparticle. Furthermore, we show that an external field allows to fine-tune the positions of these instabilities in the molecular rotational spectrum. This opens the door to detailed experimental studies of redistribution of orbital angular momentum in many-particle systems. © 2016 Wiley-VCH Verlag GmbH &amp; Co. KGaA, Weinheim},
  author       = {Redchenko, Elena and Lemeshko, Mikhail},
  journal      = {ChemPhysChem},
  number       = {22},
  pages        = {3649 -- 3654},
  publisher    = {Wiley-Blackwell},
  title        = {{Libration of strongly oriented polar molecules inside a superfluid}},
  doi          = {10.1002/cphc.201601042},
  volume       = {17},
  year         = {2016},
}

@article{1209,
  abstract     = {NADH-ubiquinone oxidoreductase (complex I) is the largest (∼1 MDa) and the least characterized complex of the mitochondrial electron transport chain. Because of the ease of sample availability, previous work has focused almost exclusively on bovine complex I. However, only medium resolution structural analyses of this complex have been reported. Working with other mammalian complex I homologues is a potential approach for overcoming these limitations. Due to the inherent difficulty of expressing large membrane protein complexes, screening of complex I homologues is limited to large mammals reared for human consumption. The high sequence identity among these available sources may preclude the benefits of screening. Here, we report the characterization of complex I purified from Ovis aries (ovine) heart mitochondria. All 44 unique subunits of the intact complex were identified by mass spectrometry. We identified differences in the subunit composition of subcomplexes of ovine complex I as compared with bovine, suggesting differential stability of inter-subunit interactions within the complex. Furthermore, the 42-kDa subunit, which is easily lost from the bovine enzyme, remains tightly bound to ovine complex I. Additionally, we developed a novel purification protocol for highly active and stable mitochondrial complex I using the branched-chain detergent lauryl maltose neopentyl glycol. Our data demonstrate that, although closely related, significant differences exist between the biochemical properties of complex I prepared from ovine and bovine mitochondria and that ovine complex I represents a suitable alternative target for further structural studies. },
  author       = {Letts, James A and Degliesposti, Gianluca and Fiedorczuk, Karol and Skehel, Mark and Sazanov, Leonid A},
  journal      = {Journal of Biological Chemistry},
  number       = {47},
  pages        = {24657 -- 24675},
  publisher    = {American Society for Biochemistry and Molecular Biology},
  title        = {{Purification of ovine respiratory complex i results in a highly active and stable preparation}},
  doi          = {10.1074/jbc.M116.735142},
  volume       = {291},
  year         = {2016},
}

@inbook{1210,
  abstract     = {Mechanisms for cell protection are essential for survival of multicellular organisms. In plants, the apical hook, which is transiently formed in darkness when the germinating seedling penetrates towards the soil surface, plays such protective role and shields the vitally important shoot apical meristem and cotyledons from damage. The apical hook is formed by bending of the upper hypocotyl soon after germination, and it is maintained in a closed stage while the hypocotyl continues to penetrate through the soil and rapidly opens when exposed to light in proximity of the soil surface. To uncover the complex molecular network orchestrating this spatiotemporally tightly coordinated process, monitoring of the apical hook development in real time is indispensable. Here we describe an imaging platform that enables high-resolution kinetic analysis of this dynamic developmental process. © Springer Science+Business Media New York 2017.},
  author       = {Zhu, Qiang and Žádníková, Petra and Smet, Dajo and Van Der Straeten, Dominique and Benková, Eva},
  booktitle    = {Plant Hormones},
  pages        = {1 -- 8},
  publisher    = {Humana Press},
  title        = {{Real time analysis of the apical hook development}},
  doi          = {10.1007/978-1-4939-6469-7_1},
  volume       = {1497},
  year         = {2016},
}