252 research outputs found
CHO microRNA engineering is growing up : recent successes and future challenges
microRNAs with their ability to regulate complex pathways that control cellular behavior and phenotype have been proposed as potential targets for cell engineering in the context of optimization of biopharmaceutical production cell lines, specifically of Chinese Hamster Ovary cells. However, until recently, research was limited by a lack of genomic sequence information on this industrially important cell line. With the publication of the genomic sequence and other relevant data sets for CHO cells since 2011, the doors have been opened for an improved understanding of CHO cell physiology and for the development of the necessary tools for novel engineering strategies. In the present review we discuss both knowledge on the regulatory mechanisms of microRNAs obtained from other biological models and proof of concepts already performed on CHO cells, thus providing an outlook of potential applications of microRNA engineering in production cell lines
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
There has been significant recent interest in parallel graph processing due
to the need to quickly analyze the large graphs available today. Many graph
codes have been designed for distributed memory or external memory. However,
today even the largest publicly-available real-world graph (the Hyperlink Web
graph with over 3.5 billion vertices and 128 billion edges) can fit in the
memory of a single commodity multicore server. Nevertheless, most experimental
work in the literature report results on much smaller graphs, and the ones for
the Hyperlink graph use distributed or external memory. Therefore, it is
natural to ask whether we can efficiently solve a broad class of graph problems
on this graph in memory.
This paper shows that theoretically-efficient parallel graph algorithms can
scale to the largest publicly-available graphs using a single machine with a
terabyte of RAM, processing them in minutes. We give implementations of
theoretically-efficient parallel algorithms for 20 important graph problems. We
also present the optimizations and techniques that we used in our
implementations, which were crucial in enabling us to process these large
graphs quickly. We show that the running times of our implementations
outperform existing state-of-the-art implementations on the largest real-world
graphs. For many of the problems that we consider, this is the first time they
have been solved on graphs at this scale. We have made the implementations
developed in this work publicly-available as the Graph-Based Benchmark Suite
(GBBS).Comment: This is the full version of the paper appearing in the ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 201
Haloes gone MAD: The Halo-Finder Comparison Project
[abridged] We present a detailed comparison of fundamental dark matter halo
properties retrieved by a substantial number of different halo finders. These
codes span a wide range of techniques including friends-of-friends (FOF),
spherical-overdensity (SO) and phase-space based algorithms. We further
introduce a robust (and publicly available) suite of test scenarios that allows
halo finder developers to compare the performance of their codes against those
presented here. This set includes mock haloes containing various levels and
distributions of substructure at a range of resolutions as well as a
cosmological simulation of the large-scale structure of the universe. All the
halo finding codes tested could successfully recover the spatial location of
our mock haloes. They further returned lists of particles (potentially)
belonging to the object that led to coinciding values for the maximum of the
circular velocity profile and the radius where it is reached. All the finders
based in configuration space struggled to recover substructure that was located
close to the centre of the host halo and the radial dependence of the mass
recovered varies from finder to finder. Those finders based in phase space
could resolve central substructure although they found difficulties in
accurately recovering its properties. Via a resolution study we found that most
of the finders could not reliably recover substructure containing fewer than
30-40 particles. However, also here the phase space finders excelled by
resolving substructure down to 10-20 particles. By comparing the halo finders
using a high resolution cosmological volume we found that they agree remarkably
well on fundamental properties of astrophysical significance (e.g. mass,
position, velocity, and peak of the rotation curve).Comment: 27 interesting pages, 20 beautiful figures, and 4 informative tables
accepted for publication in MNRAS. The high-resolution version of the paper
as well as all the test cases and analysis can be found at the web site
http://popia.ft.uam.es/HaloesGoingMA
The genome sequence of E. coli W (ATCC 9637): comparative genome analysis and an improved genome-scale reconstruction of E. coli
Background: Escherichia coli is a model prokaryote, an important pathogen, and a key organism for industrial biotechnology. E. coli W (ATCC 9637), one of four strains designated as safe for laboratory purposes, has not been sequenced. E. coli W is a fast-growing strain and is the only safe strain that can utilize sucrose as a carbon source. Lifecycle analysis has demonstrated that sucrose from sugarcane is a preferred carbon source for industrial bioprocesses
- …