Conformational studies of the triphenylphosphazenyl side chain in cyclophosphazenes. II. Crystal and molecular structure of 2,4,4,6,6,8,8-heptachloro-2-triphenylphosphazenylcyclotetra(phosphazene), N4P4Cl7(NPPh3)

Abstract is not available.

Synthesis and Evaluation of a Novel Class of G-Quadruplex-Stabilizing Small Molecules Based on the 1,3-Phenylene-Bis(piperazinyl benzimidazole) System

Achieving stabilization of telomeric DNA in G-quadruplex conformation by Various organic compounds has been an important goal for the medicinal chemists seeking to develop new anticancer agents. Several compounds are known to stabilize G-quadruplexes. However, relatively few are known to induce their formation and/or alter the topology, of the preformed quadruplex DNA. Herein, four compounds having the 1,3-phenylene-bis(piperazinyl benzimidazole) unit as a basic skeleton have been synthesized, and their interactions with the 24-mer telomeric DNA sequences from Tetrahymena thermophilia d(T(2)G(4))(4) have been investigated using high-resolution techniques Such as circular dichroism (CD) spectropolarimetry, CD melting, emission spectroscopy, and polyacrylamide gel electrophoresis. The data obtained, in the presence of one of three ions (Li+, Na+, or K+), indicate that all the new compounds have a high affinity for G-quadruplex DNA, and the strength of the binding with G-quadruplex depends on (1) phenyl ring substitution, (ii) the piperazinyl side chain, and (iii) the type of monovalent cation present in the buffer. Results further Suggest that these compounds are able to abet the conversion of the Intramolecular quadruplex into parallel stranded intermolecular G-quadruplex DNA. Notably, these compounds are also capable of inducing and stabilizing the parallel stranded quadruplex from randomly structured DNA in the absence of any stabilizing cation. The kinetics of the structural changes Induced by these compounds could be followed by recording the changes in the CD signal as a function of time. The implications of the findings mentioned above are discussed in this paper.

Simple repetitive sequences in the genome: structure and functional significance

The current explosion of DNA sequence information has generated increasing evidence for the claim that noncoding repetitive DNA sequences present within and around different genes could play an important role in genetic control processes, although the precise role and mechanism by which these sequences function are poorly understood. Several of the simple repetitive sequences which occur in a large number of loci throughout the human and other eukaryotic genomes satisfy the sequence criteria for forming non-B DNA structures in vitro. We have summarized some of the features of three different types of simple repeats that highlight the importance of repetitive DNA in the control of gene expression and chromatin organization. (i) (TG/CA)n repeats are widespread and conserved in many loci. These sequences are associated with nucleosomes of varying linker length and may play a role in chromatin organization. These Z-potential sequences can help absorb superhelical stress during transcription and aid in recombination. (ii) Human telomeric repeat (TTAGGG)n adopts a novel quadruplex structure and exhibits unusual chromatin organization. This unusual structural motif could explain chromosome pairing and stability. (iii) Intragenic amplification of (CTG)n/(CAG)n trinucleotide repeat, which is now known to be associated with several genetic disorders, could down-regulate gene expression in vivo. The overall implications of these findings vis-à-vis repetitive sequences in the genome are summarized.

A Search for Energy Minimized Sequences of Proteins

In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.

SSMBS: a web server to locate sequentially separated motifs in biological sequences

The identification of sequence (amino acids or nucleotides) motifs in a particular order in biological sequences has proved to be of interest. This paper describes a computing server, SSMBS, which can locate anddisplay the occurrences of user-defined biologically important sequence motifs (a maximum of five) present in a specific order in protein and nucleotide sequences. While the server can efficiently locate motifs specified using regular expressions, it can also find occurrences of long and complex motifs. The computation is carried out by an algorithm developed using the concepts of quantifiers in regular expressions. The web server is available to users around the clock at http://dicsoft1.physics.iisc.ernet.in/ssmbs/.

Recognition and alignment of homologous DNA sequences between minichromosomes and single-stranded DNA promoted by RecA protein

The incorporation of DNA into nucleosomes and higher-order forms of chromatin in vivo creates difficulties with respect to its accessibility for cellular functions such as transcription, replication, repair and recombination. To understand the role of chromatin structure in the process of homologous recombination, we have studied the interaction of nucleoprotein filaments, comprised of RecA protein and ssDNA, with minichromosomes. Using this paradigm, we have addressed how chromatin structure affects the search for homologous DNA sequences, and attempted to distinguish between two mutually exclusive models of DNA-DNA pairing mechanisms. Paradoxically, we found that the search for homologous sequences, as monitored by unwinding of homologous or heterologous duplex DNA, was facilitated by nucleosomes, with no discernible effect on homologous pairing. More importantly, unwinding of minichromosomes required the interaction of nucleoprotein filaments and led to the accumulation of circular duplex DNA sensitive to nuclease P1. Competition experiments indicated that chromatin templates and naked DNA served as equally efficient targets for homologous pairing. These and other findings suggest that nucleosomes do not impede but rather facilitate the search for homologous sequences and establish, in accordance with one proposed model, that unwinding of duplex DNA precedes alignment of homologous sequences at the level of chromatin. The potential application of this model to investigate the role of chromosomal proteins in the alignment of homologous sequences in the context of cellular recombination is considered.

A Method to Find Sequentially Separated Motifs in Biological Sequences (SSMBS)

Sequence motifs occurring in a particular order in proteins or DNA have been proved to be of biological interest. In this paper, a new method to locate the occurrences of up to five user-defined motifs in a specified order in large proteins and in nucleotide sequence databases is proposed. It has been designed using the concept of quantifiers in regular expressions and linked lists for data storage. The application of this method includes the extraction of relevant consensus regions from biological sequences. This might be useful in clustering of protein families as well as to study the correlation between positions of motifs and their functional sites in DNA sequences.

A Model of Anomalous Chain Translocation Dynamics

A model of polymer translocation based on the stochastic dynamics of the number of monomers on one side of a pore-containing surface is formulated in terms of a one-dimensional generalized Langevin equation, in which the random force is assumed to be characterized by long-ranged temporal correlations. The model is introduced to rationalize anomalies in measured and simulated values of the average time of passage through the pore, which in general cannot be satisfactorily accounted for by simple Brownian diffusion mechanisms. Calculations are presented of the mean first passage time for barrier crossing and of the mean square displacement of a monomeric segment, in the limits of strong and weak diffusive bias. The calculations produce estimates of the exponents in various scaling relations that are in satisfactory agreement with available data.

A Bayesian incentive compatible mechanism for decentralized supply chain formation

In this paper we consider a decentralized supply chain formation problem for linear multi-echelon supply chains when the managers of the individual echelons are autonomous, rational, and intelligent. At each echelon, there is a choice of service providers and the specific problem we solve is that of determining a cost-optimal mix of service providers so as to achieve a desired level of end-to-end delivery performance. The problem can be broken up into two sub-problems following a mechanism design approach: (1) Design of an incentive compatible mechanism to elicit the true cost functions from the echelon managers; (2) Formulation and solution of an appropriate optimization problem using the true cost information. In this paper we propose a novel Bayesian incentive compatible mechanism for eliciting the true cost functions. This improves upon existing solutions in the literature which are all based on the classical Vickrey-Clarke-Groves mechanisms, requiring significant incentives to be paid to the echelon managers for achieving dominant strategy incentive compatibility. The proposed solution, which we call SCF-BIC (Supply Chain Formation with Bayesian Incentive Compatibility), significantly reduces the cost of supply chain formation. We illustrate the efficacy of the proposed methodology using the example of a three echelon manufacturing supply chain.

Expanding the Peptide beta-Turn in alpha gamma Hybrid Sequences: 12 Atom Hydrogen Bonded Helical and Hairpin Turns

Hybrid peptide segments containing contiguous alpha and gamma amino acid residues can form C-12 hydrogen bonded turns which may be considered as backbone expanded analogues of C-10 beta-turns) found in alpha alpha segments. Exploration of the regular hydrogen bonded conformations accessible for hybrid alpha gamma sequences is facilitated by the use of a stereochemically constrained gamma amino acid residue gabapentin (1-aminomethylcyclohexaneacetic acid, Gpn), in which the two torsion angles about C-gamma-C-beta (theta(1)) and C-beta-C-alpha (theta(2)) are predominantly restricted to gauche conformations. The crystal structures of the octapeptides Boc-Gpn-Aib-Gpn-Aib-Gpn-Aib-Gpn-Aib-OMe (1) and Boc-Leu-Phe-Val-Aib-Gpn-Leu-Phe-Val-OMe (2) reveal two distinct conformations for the Aib-Gpn segment. Peptide 1 forms a continuous helix over the Aib(2)-Aib(6) segment, while the peptide 2 forms beta-hairpin structure stabilized by four cross-strand hydrogen bonds with the Aib-Gpn segment forming a nonhelical C-12 turn. The robustness of the helix in peptide 1 in solution is demonstrated by NMR methods. Peptide 2 is conformationally fragile in solution with evidence of beta-hairpin conformations being obtained in methanol. Theoretical calculations permit delineation of the various C-12 hydrogen bonded structures which are energetically feasible in alpha gamma and gamma alpha sequences.

Inter-helical Interactions in Membrane Proteins: Analysis Based on the Local Backbone Geometry and the Side Chain Interactions

The availability of a significant number of the Structures of helical membrane proteins has prompted us to investigate the mode of helix-helix packing. In the present study, we have considered a dataset of alpha-helical membrane proteins representing Structures solved from all the known superfamilies. We have described the geometry of all the helical residues in terms of local coordinate axis at the backbone level. Significant inter-helical interactions have been considered as contacts by weighing the number of atom-atom contacts, including all the side-chain atoms. Such a definition of local axis and the contact criterion has allowed us to investigate the inter-helical interaction in a systematic and quantitative manner. We show that a single parameter (designated as alpha), which is derived from the parameters representing the Mutual orientation of local axes, is able to accurately Capture the details of helix-helix interaction. The analysis has been carried Out by dividing the dataset into parallel, anti-parallel, and perpendicular orientation of helices. The study indicates that a specific range of alpha value is preferred for interactions among the anti-parallel helices. Such a preference is also seen among interacting residues of parallel helices, however to a lesser extent. No such preference is seen in the case of perpendicular helices, the contacts that arise mainly due to the interaction Of Surface helices with the end of the trans-membrane helices. The Study Supports the prevailing view that the anti-parallel helices are well packed. However, the interactions between helices of parallel orientation are non-trivial. The packing in alpha-helical membrane proteins, which is systematically and rigorously investigated in this study, may prove to be useful in modeling of helical membrane proteins.

Boson-fermion duality in SU(m vertical bar n) supersymmetric Haldane-Shastry spin chain

By using the Y(gl(m|n)) super Yangian symmetry of the SU(m|n) supersymmetric Haldane-Shastry spin chain, we show that the partition function of this model satisfies a duality relation under the exchange of bosonic and fermionic spin degrees of freedom. As a byproduct of this study of the duality relation, we find a novel combinatorial formula for the super Schur polynomials associated with some irreducible representations of the Y(gl(m|n)) Yangian algebra. Finally, we reveal an intimate connection between the global SU(m|n) symmetry of a spin chain and the boson-fermion duality relation. (C) 2007 Elsevier B.V. All rights reserved.

Low correlation sequences over AM-PSK and QAM alphabets

A construction for a family of sequences over the 8-ary AM-PSK constellation that has maximum nontrivial correlation magnitude bounded as theta(max) less than or similar to root N is presented here. The famfly is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM with theta(max) less than or similar to root 2 root N. These families are constructed by interleaving sets of sequences. A construction for a famBy of low-correlation sequences over QAM alphabet of size 2(2m) is presented with maximum nontrivial normalized correlation parameter bounded above by less than or similar to a root N, where N is the period of the sequences in the family and where a ranges from 1.61 in the case of 16-QAM modulation to 2.76 for large m. When used in a CDMA setting, the family will permit each user to modulate the code sequence with 2m bits of data. Interestingly, the construction permits users on the reverse link of the CDMA channel to communicate using varying data rates by switching between sequence famflies; associated to different values of the parameter m. Other features of the sequence families are improved Euclidean distance between different data symbols in comparison with PSK signaling and compatibility of the QAM sequence families with sequences belonging to the large quaternary sequence families {S(p)}.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Low energy properties of the SU(m|n) supersymmetric Haldane–Shastry spin chain

The ground state and low energy excitations of the SU(m|n) supersymmetric Haldane–Shastry spin chain are analyzed. In the thermodynamic limit, it is found that the ground state degeneracy is finite only for the SU(m|0) and SU(m|1) spin chains, while the dispersion relation for the low energy and low momentum excitations is linear for all values of m and n. We show that the low energy excitations of the SU(m|1) spin chain are described by a conformal field theory of m non-interacting Dirac fermions which have only positive energies; the central charge of this theory is m/2. Finally, for ngreater-or-equal, slanted1, the partition functions of the SU(m|n) Haldane–Shastry spin chain and the SU(m|n) Polychronakos spin chain are shown to be related in a simple way in the thermodynamic limit at low temperatures.