Synthesis and Cytotoxic Evaluation of Novel 2-(4-(2,2,2-Trifluoroethoxy)-3-methylpyridin-2-ylthio)-1H-benzo[d]imid azole Derivatives

The present work deals with the anticancer effect of benzimidazole derivatives associated with the pyridine framework. By varying the functional group at N-terminal of the benzimidazole by different L-amino acids, several 2-(4-(2,2,2-trifluoroethoxy)-3-methylpyridin-2-ylthio)-1H-benzo[d]imid azole derivatives 9(a-j) were synthesized. Their chemical structures were confirmed by H-1 NMR, IR and mass spectroscopic techniques. The synthesized compounds were examined for their antiproliferative effects against human leukemia cell lines, K562 and CEM. The preliminary results showed most of the derivatives had moderate antitumor activity. Compound 9j containing cysteine residue exhibited good inhibition compared to other amino acid resides. In addition DNA fragmentation results suggest that 9j is more cytotoxic and able to induce apoptosis.

Limiting the Extent of the RDN1 Heterochromatin Domain by a Silencing Barrier and Sir2 Protein Levels in Saccharomyces cerevisiae

In Saccharomyces cerevisiae, transcriptional silencing occurs at the cryptic mating-type loci (HML and HMR), telomeres, and ribosomal DNA ( rDNA; RDN1). Silencing in the rDNA is unusual in that polymerase II (Pol II) promoters within RDN1 are repressed by Sir2 but not Sir3 or Sir4. rDNA silencing unidirectionally spreads leftward, but the mechanism of limiting its spreading is unclear. We searched for silencing barriers flanking the left end of RDN1 by using an established assay for detecting barriers to HMR silencing. Unexpectedly, the unique sequence immediately adjacent to RDN1, which overlaps a prominent cohesin binding site (CARL2), did not have appreciable barrier activity. Instead, a fragment located 2.4 kb to the left, containing a tRNA(Gln) gene and the Ty1 long terminal repeat, had robust barrier activity. The barrier activity was dependent on Pol III transcription of tRNA(Gln), the cohesin protein Smc1, and the SAS1 and Gcn5 histone acetyltransferases. The location of the barrier correlates with the detectable limit of rDNA silencing when SIR2 is overexpressed, where it blocks the spreading of rDNA heterochromatin. We propose a model in which normal Sir2 activity results in termination of silencing near the physical rDNA boundary, while tRNA(Gln) blocks silencing from spreading too far when nucleolar Sir2 pools become elevated.

Energy efficient change detection over a MAC using physical layer fusion

We propose a simple and energy efficient distributed change detection scheme for sensor networks based on Page's parametric CUSUM algorithm. The sensor observations are IID over time and across the sensors conditioned on the change variable. Each sensor runs CUSUM and transmits only when the CUSUM is above some threshold. The transmissions from the sensors are fused at the physical layer. The channel is modeled as a multiple access channel (MAC) corrupted with IID noise. The fusion center which is the global decision maker, performs another CUSUM to detect the change. We provide the analysis and simulation results for our scheme and compare the performance with an existing scheme which ensures energy efficiency via optimal power selection.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

On a Special Co-cycle Basis of Graphs

In this paper we consider the problems of computing a minimum co-cycle basis and a minimum weakly fundamental co-cycle basis of a directed graph G. A co-cycle in G corresponds to a vertex partition (S,V ∖ S) and a { − 1,0,1} edge incidence vector is associated with each co-cycle. The vector space over ℚ generated by these vectors is the co-cycle space of G. Alternately, the co-cycle space is the orthogonal complement of the cycle space of G. The minimum co-cycle basis problem asks for a set of co-cycles that span the co-cycle space of G and whose sum of weights is minimum. Weakly fundamental co-cycle bases are a special class of co-cycle bases, these form a natural superclass of strictly fundamental co-cycle bases and it is known that computing a minimum weight strictly fundamental co-cycle basis is NP-hard. We show that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co-cycle basis of G and it is also weakly fundamental.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Replication of Japanese encephalitis virus in mouse brain induces alterations in lymphocyte response

The experimental model using intracerebral (i.c.) challenge was employed in many studies evaluating the protection against disease induced by Japanese encephalitis virus (JEV). We investigated alterations in peripheral lymphocyte response caused by i.c. infection of mice with JEV. Splenocytes from the i.c.-infected mice showed suppressed proliferative response to concanavalin A (con A) and anti-CD3 antibody stimulation. At the same time, the expression of CD25 (IL-2R) and production of IL-2 was inhibited. Addition of anti-CD28 antibody restored the decreased anti-CD3 antibody-mediated proliferation in the splenocytes. Moreover, the number of con A-stimulated cells secreting IL-4 was significantly reduced in splenocytes from i.c.-infected mice. These studies suggested that the i.c. infection with JEV might involve additional immune modulation effects due to massive virus replication in the brain.

Synthesis and identification of a new class of (S)-2,6-diamino-4,5,6,7-tetrahydrobenzo[d]thiazole derivatives as potent antileukemic agents

Benzothiazoles are multitarget agents with broad spectrum of biological activity. Among the antitumor agents discovered in recent years, the identification of various 2-(4-aminophenyl) benzothiazoles as potent and selective antitumor drugs against different cancer cell lines has stimulated remarkable interest. Some of the benzothiazoles are known to induce cell cycle arrest, activation of caspases and interaction with DNA molecule. Based on these interesting properties of benzothiazoles and to obtain new biologically active agents, a series of novel 4,5,6,7-tetrahydrobenzo[d]thiazole derivatives 5(a-i) were synthesized and evaluated for their efficacy as antileukemic agents in human leukemia cells (K562 and Reh). The chemical structures of the synthesized compounds were confirmed by H-1 NMR, LCMS and IR analysis. The cytotoxicity of these compounds were determined using trypan blue exclusion, 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide (MTT) and lactate dehydrogenase (LDH) assays. Results showed that, these compounds mediate a significant cytotoxic response to cancer cell lines tested. We found that the compounds having electron withdrawing groups at different positions of the phenyl ring of the thiourea moiety displayed significant cytotoxic effect with IC50 value less than 60 mu M. To rationalize the role of electron withdrawing group in the induction of cytotoxicity, we have chosen molecule 5g (IC50 similar to 15 mu M) which is having chloro substitution at ortho and para positions. Flow cytometric analysis of annexin V-FITC/ propidium iodide (PI) double staining and DNA fragmentation suggest that 5g can induce apoptosis.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.

Deposition of ZnO Films by Combustion Flame Pyrolysis of Solution Precursors

The structural features,including preferred orientation and surface morphology of zinc oxide (ZnO) films deposited by combustion flame pyrolysis were investigated as a function of process parameters, which include precursor solution concentration, substrate-nozzle (S-N) distance, gas flow rate, and duration of deposition. In this technique, the precursor droplets react within the flame and form a coating on an amorphous silica substrate held in or near the flame. Depending on the process parameters, the state of decomposition at which the precursor arrives on the substrate varies substantially and this in turn dictates the orientation and microstructure of the films.

Synthesis and Antileukemic Activity of 1-((S)-2-Amino-4,5,6,7-tetrahydrobenzo[d]thiazol-6-yl)-3-(substituted phenyl)urea Derivatives

Heterocyclic urea derivatives play an important role as anticancer agents because of their good inhibitory activity against receptor tyrosine kinases (RTKs), raf kinases, protein tyrosine kinases (PTKs), and NADH oxidase, which play critical roles in many aspects of tumorigenesis. Benzothiazole moiety constitutes an important scaffold of drugs, possessing several pharmacological functions, mainly the anticancer activity. Based on these interesting properties of benzothiazoles and urea moiety to obtain new biologically active agents, we synthesized a series of novel 1-((S)-2-amino-4,5,6.7-tetrahydrobenzo[d]thiazol-6-yl)-3-(substituted phenyl)urea derivatives and evaluated for their efficacy as antileukemic agents against two human leukemic cell lines (K562 and Reh). These compounds showed good and moderate cytotoxic effect to cancer cell lines tested. Compounds with electron-withdrawing chloro and fluoro substituents on phenyl ring showed good activity and compounds with electron-donating methoxy group showed moderate activity. Compound with electron-withdrawing dichloro substitution on phenyl ring of aryl urea showed good activity. Further, lactate dehydrogenase (LDH) assay, flow cytometric analysis of annexin V-FITC/propidium iodide (PI) double staining and DNA fragmentation studies showed that compound with dichloro substitution on phenyl ring of aryl urea can induce apoptosis.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Differential regulation of MRN (Mre11-Rad50-Nbs1) complex subunits and telomerase activity in cancer cells

Several lines of evidence suggest that cancer progression is associated with up-regulation or reactivation of telomerase and the underlying mechanism remains an active area of research. The heterotrimeric MRN complex, consisting of Mre11, Rad50 and Nbs1, which is required for the repair of double-strand breaks, plays a key role in telomere length maintenance. In this study, we show significant differences in the levels of expression of MRN complex subunits among various cancer cells and somatic cells. Notably, siRNA-mediated depletion of any of the subunits of MRN complex led to complete ablation of other subunits of the complex. Treatment of leukemia and prostate cancer cells with etoposide lead to increased expression of MRN complex subunits, with concomitant decrease in the levels of telomerase activity, compared to breast cancer cells. These studies raise the possibility of developing anti-cancer drugs targeting MRN complex subunits to sensitize a subset of cancer cells to radio- and/or chemotherapy. (C) 2010 Elsevier Inc. All rights reserved.