900 research outputs found
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let be a plane straight-line graph on a finite point set
in general position. The incident angles of a vertex
of are the angles between any two edges of that appear consecutively in
the circular order of the edges incident to .
A plane straight-line graph is called -open if each vertex has an
incident angle of size at least . In this paper we study the following
type of question: What is the maximum angle such that for any finite set
of points in general position we can find a graph from a certain
class of graphs on that is -open? In particular, we consider the
classes of triangulations, spanning trees, and paths on and give tight
bounds in most cases.Comment: 15 pages, 14 figures. Apart of minor corrections, some proofs that
were omitted in the previous version are now include
Approximation Algorithms for Generalized MST and TSP in Grid Clusters
We consider a special case of the generalized minimum spanning tree problem
(GMST) and the generalized travelling salesman problem (GTSP) where we are
given a set of points inside the integer grid (in Euclidean plane) where each
grid cell is . In the MST version of the problem, the goal is to
find a minimum tree that contains exactly one point from each non-empty grid
cell (cluster). Similarly, in the TSP version of the problem, the goal is to
find a minimum weight cycle containing one point from each non-empty grid cell.
We give a and -approximation
algorithm for these two problems in the described setting, respectively.
Our motivation is based on the problem posed in [7] for a constant
approximation algorithm. The authors designed a PTAS for the more special case
of the GMST where non-empty cells are connected end dense enough. However,
their algorithm heavily relies on this connectivity restriction and is
unpractical. Our results develop the topic further
WIST: toolkit for rapid, customized LIMS development
Summary: Workflow Information Storage Toolkit (WIST) is a set of application programming interfaces and web applications that allow for the rapid development of customized laboratory information management systems (LIMS). WIST provides common LIMS input components, and allows them to be arranged and configured using a flexible language that specifies each component's visual and semantic characteristics. WIST includes a complete set of web applications for adding, editing and viewing data, as well as a powerful setup tool that can build new LIMS modules by analyzing existing database schema
On the Complexity of Searching in Trees: Average-case Minimization
We focus on the average-case analysis: A function w : V -> Z+ is given which
defines the likelihood for a node to be the one marked, and we want the
strategy that minimizes the expected number of queries. Prior to this paper,
very little was known about this natural question and the complexity of the
problem had remained so far an open question.
We close this question and prove that the above tree search problem is
NP-complete even for the class of trees with diameter at most 4. This results
in a complete characterization of the complexity of the problem with respect to
the diameter size. In fact, for diameter not larger than 3 the problem can be
shown to be polynomially solvable using a dynamic programming approach.
In addition we prove that the problem is NP-complete even for the class of
trees of maximum degree at most 16. To the best of our knowledge, the only
known result in this direction is that the tree search problem is solvable in
O(|V| log|V|) time for trees with degree at most 2 (paths).
We match the above complexity results with a tight algorithmic analysis. We
first show that a natural greedy algorithm attains a 2-approximation.
Furthermore, for the bounded degree instances, we show that any optimal
strategy (i.e., one that minimizes the expected number of queries) performs at
most O(\Delta(T) (log |V| + log w(T))) queries in the worst case, where w(T) is
the sum of the likelihoods of the nodes of T and \Delta(T) is the maximum
degree of T. We combine this result with a non-trivial exponential time
algorithm to provide an FPTAS for trees with bounded degree
Experimental Biological Protocols with Formal Semantics
Both experimental and computational biology is becoming increasingly
automated. Laboratory experiments are now performed automatically on
high-throughput machinery, while computational models are synthesized or
inferred automatically from data. However, integration between automated tasks
in the process of biological discovery is still lacking, largely due to
incompatible or missing formal representations. While theories are expressed
formally as computational models, existing languages for encoding and
automating experimental protocols often lack formal semantics. This makes it
challenging to extract novel understanding by identifying when theory and
experimental evidence disagree due to errors in the models or the protocols
used to validate them. To address this, we formalize the syntax of a core
protocol language, which provides a unified description for the models of
biochemical systems being experimented on, together with the discrete events
representing the liquid-handling steps of biological protocols. We present both
a deterministic and a stochastic semantics to this language, both defined in
terms of hybrid processes. In particular, the stochastic semantics captures
uncertainties in equipment tolerances, making it a suitable tool for both
experimental and computational biologists. We illustrate how the proposed
protocol language can be used for automated verification and synthesis of
laboratory experiments on case studies from the fields of chemistry and
molecular programming
The Life-Cycle of Operons
Operons are a major feature of all prokaryotic genomes, but how and why operon structures vary is not well understood. To elucidate the life-cycle of operons, we compared gene order between Escherichia coli K12 and its relatives and identified the recently formed and destroyed operons in E. coli. This allowed us to determine how operons form, how they become closely spaced, and how they die. Our findings suggest that operon evolution may be driven by selection on gene expression patterns. First, both operon creation and operon destruction lead to large changes in gene expression patterns. For example, the removal of lysA and ruvA from ancestral operons that contained essential genes allowed their expression to respond to lysine levels and DNA damage, respectively. Second, some operons have undergone accelerated evolution, with multiple new genes being added during a brief period. Third, although genes within operons are usually closely spaced because of a neutral bias toward deletion and because of selection against large overlaps, genes in highly expressed operons tend to be widely spaced because of regulatory fine-tuning by intervening sequences. Although operon evolution may be adaptive, it need not be optimal: new operons often comprise functionally unrelated genes that were already in proximity before the operon formed
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Disposition of Federally Owned Surpluses
PDZ domains are scaffolding modules in protein-protein interactions that mediate numerous physiological functions by interacting canonically with the C-terminus or non-canonically with an internal motif of protein ligands. A conserved carboxylate-binding site in the PDZ domain facilitates binding via backbone hydrogen bonds; however, little is known about the role of these hydrogen bonds due to experimental challenges with backbone mutations. Here we address this interaction by generating semisynthetic PDZ domains containing backbone amide-to-ester mutations and evaluating the importance of individual hydrogen bonds for ligand binding. We observe substantial and differential effects upon amide-to-ester mutation in PDZ2 of postsynaptic density protein 95 and other PDZ domains, suggesting that hydrogen bonding at the carboxylate-binding site contributes to both affinity and selectivity. In particular, the hydrogen-bonding pattern is surprisingly different between the non-canonical and canonical interaction. Our data provide a detailed understanding of the role of hydrogen bonds in protein-protein interactions
- …