Functional Analysis of MrpL55, Vig and Mat1 Acting at the Crossroad of Cell Cycle, Transcription and Metabolism Regulation

Cell proliferation, transcription and metabolism are regulated by complex partly overlapping signaling networks involving proteins in various subcellular compartments. The objective of this study was to increase our knowledge on such regulatory networks and their interrelationships through analysis of MrpL55, Vig, and Mat1 representing three gene products implicated in regulation of cell cycle, transcription, and metabolism. Genome-wide and biochemical in vitro studies have previously revealed MrpL55 as a component of the large subunit of the mitochondrial ribosome and demonstrated a possible role for the protein in cell cycle regulation. Vig has been implicated in heterochromatin formation and identified as a constituent of the RNAi-induced silencing complex (RISC) involved in cell cycle regulation and RNAi-directed transcriptional gene silencing (TGS) coupled to RNA polymerase II (RNAPII) transcription. Mat1 has been characterized as a regulatory subunit of cyclin-dependent kinase 7 (Cdk7) complex phosphorylating and regulating critical targets involved in cell cycle progression, energy metabolism and transcription by RNAPII. The first part of the study explored whether mRpL55 is required for cell viability or involved in a regulation of energy metabolism and cell proliferation. The results revealed a dynamic requirement of the essential Drosophila mRpL55 gene during development and suggested a function of MrpL55 in cell cycle control either at the G1/S or G2/M transition prior to cell differentiation. This first in vivo characterization of a metazoan-specific constituent of the large subunit of mitochondrial ribosome also demonstrated forth compelling evidence of the interconnection of nuclear and mitochondrial genomes as well as complex functions of the evolutionarily young metazoan-specific mitochondrial ribosomal proteins. In studies on the Drosophila RISC complex regulation, it was noted that Vig, a protein involved in heterochromatin formation, unlike other analyzed RISC associated proteins Argonaute2 and R2D2, is dynamically phosphorylated in a dsRNA-independent manner. Vig displays similarity with a known in vivo substrate for protein kinase C (PKC), human chromatin remodeling factor Ki-1/57, and is efficiently phosphorylated by PKC on multiple sites in vitro. These results suggest that function of the RISC complex protein Vig in RNAi-directed TGS and chromatin modification may be regulated through dsRNA-independent phosphorylation by PKC. In the third part of this study the role of Mat1 in regulating RNAPII transcription was investigated using cultured murine immortal fibroblasts with a conditional allele of Mat1. The results demonstrated that phosphorylation of the carboxy-terminal domain (CTD) of the large subunit of RNAPII in the heptapeptide YSPTSPS repeat in Mat-/- cells was over 10-fold reduced on Serine-5 and subsequently on Serine-2. Occupancy of the hypophosphorylated RNAPII in gene bodies was detectably decreased, whereas capping, splicing, histone methylation and mRNA levels were generally not affected. However, a subset of transcripts in absence of Mat1 was repressed and associated with decreased occupancy of RNAPII at promoters as well as defective capping. The results identify the Cdk7-CycH-Mat1 kinase submodule of TFIIH as a stimulatory non-essential regulator of transcriptional elongation and a genespecific essential factor for stable binding of RNAPII at the promoter region and capping. The results of these studies suggest important roles for both MrpL55 and Mat1 in cell cycle progression and their possible interplay at the G2/M stage in undifferentiated cells. The identified function of Mat1 and of TFIIH kinase complex in gene-specific transcriptional repression is challenging for further studies in regard to a possible link to Vig and RISC-mediated transcriptional gene silencing.

Time-driven life cycle cost estimation system for product family design

This research develops a design support system, which is able to estimate the life cycle cost of different product families at the early stage of product development. By implementing the system, a designer is able to develop various cost effective product families in a shorter lead-time and minimise the destructive impact of the product family on the environment.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

A novel DNA intercalator, butylamino-pyrimido[4',5':4,5]selenolo(2,3-b)quinoline, induces cell cycle arrest and apoptosis in leukemic cells

DNA intercalators are one of the most commonly used chemotherapeutic agents. Novel intercalating compounds of pyrimido[4',5':4,5]selenolo(2,3-b)quinoline series having a butylamino or piperazino group at fourth position (BPSQ and PPSQ, respectively) are studied. Our results showed that BPSQ induced cytotoxicity whereas PPSQ was cytostatic. The cytotoxicity induced by BPSQ was concentration- and time-dependent. Cell cycle analysis and tritiated thymidine assay revealed that BPSQ affects the cell cycle progression by arresting at S phase. The absence of p-histone H3 and reduction in the levels of PCNA in the cells treated with BPSQ further confirmed the cell cycle arrest. Further, annexin V staining, DNA fragmentation, nuclear condensation and changes in the expression levels of BCL2/BAD confirmed the activation of apoptosis. Activation of caspase 8 and lack of cleavage of caspase 9, caspase 3 and PARP suggest the possibility of BPSQ triggering extrinsic pathway for induction of apoptosis, which is discussed. Hence, we have identified a novel compound which would have clinical relevance in cancer chemotherapeutics.

Growth inhibition of human promonocytic leukaemic U937 cells by interferon gamma is irreversible and not cell cycle phase-specific.

Growth of human promonocytic leukaemic U937 cells was found arrested within 24 h upon exposure to interferon gamma (IFN-gamma). Removal of the interferon did not result in the resumption of growth, as is evident from the absence of doubling of viable cell count and(3)H-thymidine incorporation. 5-Bromo-2'-deoxyuridine-based flow cytometric analysis of the growth-arrested cells, 24 h subsequent to the removal of IFN-gamma, showed absence of DNA synthesis, confirming the irreversible nature of the growth inhibition. Propidium iodide-based flow cytometric analysis of the growth-arrested cells showed a distribution which is typical of a growth inhibition without resulting in the accumulation of cells in any specific phase of the cell cycle. These results indicated that IFN-gamma arrested growth of U937 cells in an irreversible and cell cycle phase-independent manner. These observations were in contrast to our earlier report on the reversible and cell cycle phase-specific growth inhibition of human amniotic (fetal epithelial) WISH cells by the interferon. Copyright 1999 Academic Press.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, eta(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G square H of graphs. As the main result of this paper, we prove that eta(G(1) square G(2)) >= h root 1 (1 - o(1)) for any two graphs G(1) and G(2) with eta(G(1)) = h and eta(G(2)) = l. We show that the above lower bound is asymptotically best possible when h >= l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: 1. Let G be a connected graph. Let G = G(1) square G(2) square ... square G(k) be the ( unique) prime factorization of G. Then G satisfies Hadwiger's conjecture if k >= 2 log log chi(G) + c', where c' is a constant. This improves the 2 log chi(G) + 3 bound in [2] 2. Let G(1) and G(2) be two graphs such that chi(G1) >= chi(G2) >= clog(1.5)(chi(G(1))), where c is a constant. Then G1 square G2 satisfies Hadwiger's conjecture. 3. Hadwiger's conjecture is true for G(d) (Cartesian product of G taken d times) for every graph G and every d >= 2. This settles a question by Chandran and Sivadasan [2]. ( They had shown that the Hadiwger's conjecture is true for G(d) if d >= 3).

RECONNECT: A NoC for polymorphic ASICs using a low overhead single cycle router

A polymorphic ASIC is a runtime reconfigurable hardware substrate comprising compute and communication elements. It is a ldquofuture proofrdquo custom hardware solution for multiple applications and their derivatives in a domain. Interoperability between application derivatives at runtime is achieved through hardware reconfiguration. In this paper we present the design of a single cycle Network on Chip (NoC) router that is responsible for effecting runtime reconfiguration of the hardware substrate. The router design is optimized to avoid FIFO buffers at the input port and loop back at output crossbar. It provides virtual channels to emulate a non-blocking network and supports a simple X-Y relative addressing scheme to limit the control overhead to 9 bits per packet. The 8times8 honeycomb NoC (RECONNECT) implemented in 130 nm UMC CMOS standard cell library operates at 500 MHz and has a bisection bandwidth of 28.5 GBps. The network is characterized for random, self-similar and application specific traffic patterns that model the execution of multimedia and DSP kernels with varying network loads and virtual channels. Our implementation with 4 virtual channels has an average network latency of 24 clock cycles and throughput of 62.5% of the network capacity for random traffic. For application specific traffic the latency is 6 clock cycles and throughput is 87% of the network capacity.

CDCA3 regulates the cell cycle and modulates cisplatin sensitivity in non-small cell lung cancer

Cisplatin-based regimens are currently the most effective chemotherapy for non-small cell lung cancer (NSCLC). Cisplatin forms DNA crosslinks to stall DNA replication and induce apoptosis. However, intrinsic and acquired chemoresistance is a major therapeutic problem. We have identified ‘cell division cycle associated protein 3’ (CDCA3) as a novel protein that may prove useful in delaying or preventing cisplatin resistance in NSCLC. CDCA3 functions as part of an ubiquitin ligase complex to degrade the endogenous cell cycle inhibitors. While a role for CDCA3 in disease is emerging with elevated expression noted in oral squamous cell carcinoma, little else is known about CDCA3 or whether this protein may prove useful clinically.

The hype cycle model: A review and future directions

The hype cycle model traces the evolution of technological innovations as they pass through successive stages pronounced by the peak, disappointment, and recovery of expectations. Since its introduction by Gartner nearly two decades ago, the model has received growing interest from practitioners, and more recently from scholars. Given the model's proclaimed capacity to forecast technological development, an important consideration for organizations in formulating marketing strategies, this paper provides a critical review of the hype cycle model by seeking evidence from Gartner's own technology databases for the manifestation of hype cycles. The results of our empirical work show incongruences connected with the reports of Gartner, which motivates us to consider possible future directions, whereby the notion of hype or hyped dynamics (though not necessarily the hype cycle model itself) can be captured in existing life cycle models through the identification of peak, disappointment, and recovery patterns.

Boxicity and cubicity of asteroidal triple free graphs

The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection graph of a family of d-dimensional (axis-parallel) boxes. The cubicity, denoted cub(G), is the least dsuch that G is the intersection graph of a family of d-dimensional unit cubes. An independent set of three vertices is an asteroidal triple if any two are joined by a path avoiding the neighbourhood of the third. A graph is asteroidal triple free (AT-free) if it has no asteroidal triple. The claw number psi(G) is the number of edges in the largest star that is an induced subgraph of G. For an AT-free graph G with chromatic number chi(G) and claw number psi(G), we show that box(G) <= chi(C) and that this bound is sharp. We also show that cub(G) <= box(G)([log(2) psi(G)] + 2) <= chi(G)([log(2) psi(G)] + 2). If G is an AT-free graph having girth at least 5, then box(G) <= 2, and therefore cub(G) <= 2 [log(2) psi(G)] + 4. (c) 2010 Elsevier B.V. All rights reserved.