995 research outputs found
All the shapes of spaces: a census of small 3-manifolds
In this work we present a complete (no misses, no duplicates) census for
closed, connected, orientable and prime 3-manifolds induced by plane graphs
with a bipartition of its edge set (blinks) up to edges. Blinks form a
universal encoding for such manifolds. In fact, each such a manifold is a
subtle class of blinks, \cite{lins2013B}. Blinks are in 1-1 correpondence with
{\em blackboard framed links}, \cite {kauffman1991knots, kauffman1994tlr} We
hope that this census becomes as useful for the study of concrete examples of
3-manifolds as the tables of knots are in the study of knots and links.Comment: 31 pages, 17 figures, 38 references. In this version we introduce
some new material concerning composite manifold
Basic and applied uses of genome-scale metabolic network reconstructions of Escherichia coli.
The genome-scale model (GEM) of metabolism in the bacterium Escherichia coli K-12 has been in development for over a decade and is now in wide use. GEM-enabled studies of E. coli have been primarily focused on six applications: (1) metabolic engineering, (2) model-driven discovery, (3) prediction of cellular phenotypes, (4) analysis of biological network properties, (5) studies of evolutionary processes, and (6) models of interspecies interactions. In this review, we provide an overview of these applications along with a critical assessment of their successes and limitations, and a perspective on likely future developments in the field. Taken together, the studies performed over the past decade have established a genome-scale mechanistic understanding of genotypeâphenotype relationships in E. coli metabolism that forms the basis for similar efforts for other microbial species. Future challenges include the expansion of GEMs by integrating additional cellular processes beyond metabolism, the identification of key constraints based on emerging data types, and the development of computational methods able to handle such large-scale network models with sufficient accuracy
A nearly-mlogn time solver for SDD linear systems
We present an improved algorithm for solving symmetrically diagonally
dominant linear systems. On input of an symmetric diagonally
dominant matrix with non-zero entries and a vector such that
for some (unknown) vector , our algorithm computes a
vector such that
{ denotes the A-norm} in time
The solver utilizes in a standard way a `preconditioning' chain of
progressively sparser graphs. To claim the faster running time we make a
two-fold improvement in the algorithm for constructing the chain. The new chain
exploits previously unknown properties of the graph sparsification algorithm
given in [Koutis,Miller,Peng, FOCS 2010], allowing for stronger preconditioning
properties. We also present an algorithm of independent interest that
constructs nearly-tight low-stretch spanning trees in time
, a factor of faster than the algorithm in
[Abraham,Bartal,Neiman, FOCS 2008]. This speedup directly reflects on the
construction time of the preconditioning chain.Comment: to appear in FOCS1
Edge Intersection Graphs of L-Shaped Paths in Grids
In this paper we continue the study of the edge intersection graphs of one
(or zero) bend paths on a rectangular grid. That is, the edge intersection
graphs where each vertex is represented by one of the following shapes:
,, , , and we consider zero bend
paths (i.e., | and ) to be degenerate s. These graphs, called
-EPG graphs, were first introduced by Golumbic et al (2009). We consider
the natural subclasses of -EPG formed by the subsets of the four single
bend shapes (i.e., {}, {,},
{,}, and {,,}) and we
denote the classes by [], [,],
[,], and [,,]
respectively. Note: all other subsets are isomorphic to these up to 90 degree
rotation. We show that testing for membership in each of these classes is
NP-complete and observe the expected strict inclusions and incomparability
(i.e., [] [,],
[,] [,,]
-EPG; also, [,] is incomparable with
[,]). Additionally, we give characterizations and
polytime recognition algorithms for special subclasses of Split
[].Comment: 14 pages, to appear in DAM special issue for LAGOS'1
Meneco, a Topology-Based Gap-Filling Tool Applicable to Degraded Genome-Wide Metabolic Networks
International audienceIncreasing amounts of sequence data are becoming available for a wide range of non-model organisms. Investigating and modelling the metabolic behaviour of those organisms is highly relevant to understand their biology and ecology. As sequences are often incomplete and poorly annotated, draft networks of their metabolism largely suffer from incompleteness. Appropriate gap-filling methods to identify and add missing reactions are therefore required to address this issue. However, current tools rely on phenotypic or taxonomic information, or are very sensitive to the stoichiometric balance of metabolic reactions, especially concerning the co-factors. This type of information is often not available or at least prone to errors for newly-explored organisms. Here we introduce Meneco, a tool dedicated to the topological gap-filling of genome-scale draft metabolic networks. Meneco reformulates gap-filling as a qualitative combinatorial optimization problem, omitting constraints raised by the stoichiometry of a metabolic network considered in other methods, and solves this problem using Answer Set Programming. Run on several artificial test sets gathering 10,800 degraded Escherichia coli networks Meneco was able to efficiently identify essential reactions missing in networks at high degradation rates, outperforming the stoichiometry-based tools in scalability. To demonstrate the utility of Meneco we applied it to two case studies. Its application to recent metabolic networks reconstructed for the brown algal model Ectocarpus siliculosus and an associated bacterium Candidatus Phaeomarinobacter ectocarpi revealed several candidate metabolic pathways for algal-bacterial interactions. Then Meneco was used to reconstruct, from transcriptomic and metabolomic data, the first metabolic network for the microalga Euglena mutabilis. These two case studies show that Meneco is a versatile tool to complete draft genome-scale metabolic networks produced from heterogeneous data, and to suggest relevant reactions that explain the metabolic capacity of a biological system
Optimal iso-surfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of iso-surfaces.
Most approaches divide the 3D space into cubes that each occupies the space between eight neighboring samples of a regular lattice. The portion of the iso-surface inside a cube may be computed independently of what happens in the other cubes, provided that the constructions for each pair of neighboring cubes agree along their common face. The portion of the iso-surface associated with a cube may consist of one or more connected components, which we call sheets. We distinguish three types of decisions in the construction of the iso-surface connectivity: (1) how to split the X-faces, which have alternating in/out samples, (2) how many sheets to use in a cube, and (3) how to triangulate each sheet. Previously reported techniques make these decisions based on local criteria, often using pre-computed look-up tables or simple construction rules. Instead, we propose global strategies for optimizing several topological and combinatorial measures of the isosurfaces: triangle count, genus, and number of shells. We describe efficient implementations of these optimizations and the auxiliary data structures developed to support them.Postprint (updated version
- âŠ