Heterologous promoter recognition leading to high-level expression of cloned foreign genes in Bombyx mori cell lines and larvae

The baculovirus expression system using the Autographa californica nuclear polyhedrosis virus (AcNPV) has been extensively utilized for high-level expression of cloned foreign genes, driven by the strong viral promoters of polyhedrin (polh) and p10 encoding genes. A parallel system using Bombyx mori nuclear polyhedrosis virus (BmNPV) is much less exploited because the choice and variety of BmNPV-based transfer vectors are limited. Using a transient expression assay, we have demonstrated here that the heterologous promoters of the very late genes polh and p10 from AcNPV function as efficiently in BmN cells as the BmNPV promoters. The location of the cloned foreign gene with respect to the promoter sequences was critical for achieving the highest levels of expression, following the order +35 > +1 > -3 > -8 nucleotides (nt) with respect to the polh or p10 start codons. We have successfully generated recombinant BmNPV harboring AcNPV promoters by homeologous recombination between AcNPV-based transfer vectors and BmNPV genomic DNA. Infection of BmN cell lines with recombinant BmNPV showed a temporal expression pattern, reaching very high levels in 60-72 h post infection. The recombinant BmNPV harboring the firefly luciferase-encoding gene under the control of AcNPV polh or p10 promoters, on infection of the silkworm larvae led to the synthesis of large quantities of luciferase. Such larvae emanated significant luminiscence instantaneously on administration of the substrate luciferin resulting in 'glowing silkworms'. The virus-infected larvae continued to glow for several hours and revealed the most abundant distribution of virus in the fat bodies. In larval expression also, the highest levels were achieved when the reporter gene was located at +35 nt of the polh.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Expression of microinjected foreign DNA in silkworm,bombyx mori

As a prelude to achieving transgenesis in Bombyx mori, conditions have been established for successful microinjection of cloned foreign genes into the silk worm eggs. A sharpened metallic needle is used to pierce the thick chorion layer of the eggsheil, approaching through a droplet of DNA solution deposited on its surface. The microinjection is carried out within 2-2.5 h after oviposition and the injected eggs show 3-5% hatchability and 80-90% survival. Such larvae continuously expressed the microinjected cloned reporter gene, beta-galactosidase, placed under the control of a constitutively expressed cytoplasmic actin A3 gene promoter from B. mori. The expression is seen in different tissues, viz. the fat body, tracheae and the silk glands, till the late larval instars. The microinjected DNA sequences are retained in the adult G(o) moths.

Algorithmic aspects of k-tuple total domination in graphs

For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V. E) is a subset T D-k of V such that every vertex in V is adjacent to at least k vertices of T Dk. In minimum k-tuple total dominating set problem (MIN k-TUPLE TOTAL DOM SET), it is required to find a k-tuple total dominating set of minimum cardinality and DECIDE MIN k-TUPLE TOTAL DOM SET is the decision version of MIN k-TUPLE TOTAL DOM SET problem. In this paper, we show that DECIDE MIN k-TUPLE TOTAL DOM SET is NP-complete for split graphs, doubly chordal graphs and bipartite graphs. For chordal bipartite graphs, we show that MIN k-TUPLE TOTAL DOM SET can be solved in polynomial time. We also propose some hardness results and approximation algorithms for MIN k-TUPLE TOTAL DOM SET problem. (c) 2012 Elsevier B.V. All rights reserved.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Long-Term Sustained Release of Salicylic Acid from Cross-Linked Biodegradable Polyester Induces a Reduced Foreign Body Response in Mice

There has been a continuous surge toward developing new biopolymers that exhibit better in vivo biocompatibility properties in terms of demonstrating a reduced foreign body response (FBR). One approach to mitigate the undesired FBR is to develop an implant capable of releasing anti-inflammatory molecules in a sustained manner over a long time period. Implants causing inflammation are also more susceptible to infection. In this article, the in vivo biocompatibility of a novel, biodegradable salicylic acid releasing polyester (SAP) has been investigated by subcutaneous implantation in a mouse model. The tissue response to SAP was compared with that of a widely used biodegradable polymer, poly(lactic acid-co-glycolic acid) (PLGA), as a control over three time points: 2, 4, and 16 weeks postimplantation. A long-term in vitro study illustrates a continuous, linear (zero order) release of salicylic acid with a cumulative mass percent release rate of 7.34 x 10(-4) h(-1) over similar to 1.5-17 months. On the basis of physicochemical analysis, surface erosion for SAP and bulk erosion for PLGA have been confirmed as their dominant degradation modes in vivo. On the basis of the histomorphometrical analysis of inflammatory cell densities and collagen distribution as well as quantification of proinflammatory cytokine levels (TNF-alpha and IL-1 beta), a reduced foreign body response toward SAP with respect to that generated by PLGA has been unambiguously established. The favorable in vivo tissue response to SAP, as manifest from the uniform and well-vascularized encapsulation around the implant, is consistent with the decrease in inflammatory cell density and increase in angiogenesis with time. The above observations, together with the demonstration of long-term and sustained release of salicylic acid, establish the potential use of SAP for applications in improved matrices for tissue engineering and chronic wound healing.