The mean geometry of the peptide unit from crystal structure data

The average dimensions of the peptide unit have been obtained from the data reported in recent crystal structure analyses of di- and tripeptides. The bond lengths and bond angles agree with those in common use, except for the bond angle C---N---H, which is about 4° less than the accepted value, and the angle C2α---N---H which is about 4° more. The angle τ (Cα) has a mean value of 114° for glycyl residues and 110° for non-glycyl residues. Attention is directed to these mean values as observed in crystal structures, as they are relevant for model building of peptide chain structures.

The non-planar peptide unit II. Comparison of theory with crystal structure datastar, open

The theoretical results derived in Part I (Ramachandran, G.N., Lakshminarayan, A.V. and Kolaskar, A.S. (1973) Biochim. Biophys. Acta 303, 8–13) that the three bonds of the peptide unit meeting at N can have a pyramidal structure is confirmed by an analysis of 14 published crystal structures of small peptides. It is shown that the dihedral angles θN and Δω are correlated, while θC, is small and is uncorrelated with Δω, showing that the non-planar distortion at C′ is generally small.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

Composition operators, Aleksandrov measures and value distribution of analytic maps in the unit disc

A composition operator is a linear operator that precomposes any given function with another function, which is held fixed and called the symbol of the composition operator. This dissertation studies such operators and questions related to their theory in the case when the functions to be composed are analytic in the unit disc of the complex plane. Thus the subject of the dissertation lies at the intersection of analytic function theory and operator theory. The work contains three research articles. The first article is concerned with the value distribution of analytic functions. In the literature there are two different conditions which characterize when a composition operator is compact on the Hardy spaces of the unit disc. One condition is in terms of the classical Nevanlinna counting function, defined inside the disc, and the other condition involves a family of certain measures called the Aleksandrov (or Clark) measures and supported on the boundary of the disc. The article explains the connection between these two approaches from a function-theoretic point of view. It is shown that the Aleksandrov measures can be interpreted as kinds of boundary limits of the Nevanlinna counting function as one approaches the boundary from within the disc. The other two articles investigate the compactness properties of the difference of two composition operators, which is beneficial for understanding the structure of the set of all composition operators. The second article considers this question on the Hardy and related spaces of the disc, and employs Aleksandrov measures as its main tool. The results obtained generalize those existing for the case of a single composition operator. However, there are some peculiarities which do not occur in the theory of a single operator. The third article studies the compactness of the difference operator on the Bloch and Lipschitz spaces, improving and extending results given in the previous literature. Moreover, in this connection one obtains a general result which characterizes the compactness and weak compactness of the difference of two weighted composition operators on certain weighted Hardy-type spaces.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

The nonplanar peptide unit III. Quantum chemical calculations for related compounds and experimental X-ray diffraction data

The possible nonplanar distortions of the amide group in formamide, acetamide, N-methylacetamide, and N-ethylacetamide have been examined using CNDO/2 and INDO methods. The predictions from these methods are compared with the results obtained from X-ray and neutron diffraction studies on crystals of small open peptides, cyclic peptides, and amides. It is shown that the INDO results are in good agreement with observations, and that the dihedral angles N and defining the nonplanarity of the amide unit are correlated approximately by the relation N = -2, while C is small and uncorrelated with . The present study indicates that the nonplanar distortions at the nitrogen atom of the peptide unit may have to be taken into consideration, in addition to the variation in the dihedral angles (,), in working out polypeptide and protein structures.

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.

[B4O9H2] Cyclic Borate Units as the Building Unit in a Family of Zinc Borate Structures

A solvothermal reaction of ZnO, boric acid (B(OH)(3)), and aliphatic airlines in a water-pyridine mixture gave four zinc borate phases of different dimensionalities: [Zn(B4O8H2)(C3H10N2)], I (one-dimensional); [Zn(B4O8H2)(C3H10N2)] H2O, II (two-dimensional); [Zn(B5O10H3)(C10H24N4)]center dot H2O, III (two-dimensional): and [Zn-2(B8O15H2)(C3H10N2)(2)], IV (three-dimensional). The structures are formed by the connectivity involving polyborate chains and layers with Zn2+ species. In all the compounds, the amine molecules act its file ligand binding either the same or different zn centers. The formation of two different structures, II and IV, from the same amine by varying the reaction time is noteworthy. Transformation studies on II indicate that the formation of IV. from II, is facile and has been investigated for the first time. Two of file compounds, I and III, exhibit activity for second-order nonlinear optical behavior. The UV exposure of the sample indicates the absorption of all the UV radiation suggesting that the zinc borate compounds could be exploited for UV-blocking applications. The compounds have been characterized by powder X-ray diffraction, infrared spectroscopy, thermogravimetric analysis, UV-vis, photoluminescence, and NMR studies.

Random network behaviour of protein structures

Geometric and structural constraints greatly restrict the selection of folds adapted by protein backbones, and yet, folded proteins show an astounding diversity in functionality. For structure to have any bearing on function, it is thus imperative that, apart from the protein backbone, other tunable degrees of freedom be accountable. Here, we focus on side-chain interactions, which non-covalently link amino acids in folded proteins to form a network structure. At a coarse-grained level, we show that the network conforms remarkably well to realizations of random graphs and displays associated percolation behavior. Thus, within the rigid framework of the protein backbone that restricts the structure space, the side-chain interactions exhibit an element of randomness, which account for the functional flexibility and diversity shown by proteins. However, at a finer level, the network exhibits deviations from these random graphs which, as we demonstrate for a few specific examples, reflect the intrinsic uniqueness in the structure and stability, and perhaps specificity in the functioning of biological proteins.

Interactions and turnover of the muscular dystrophy protein myotilin

The striated muscle sarcomere is a force generating and transducing unit as well as an important sensor of extracellular cues and a coordinator of cellular signals. The borders of individual sarcomeres are formed by the Z-disks. The Z-disk component myotilin interacts with Z-disk core structural proteins and with regulators of signaling cascades. Missense mutations in the gene encoding myotilin cause dominantly inherited muscle disorders, myotilinopathies, by an unknown mechanism. In this thesis the functions of myotilin were further characterized to clarify the molecular biological basis and the pathogenetic mechanisms of inherited muscle disorders, mainly caused by mutated myotilin. Myotilin has an important function in the assembly and maintenance of the Z-disks probably through its actin-organizing properties. Our results show that the Ig-domains of myotilin are needed for both binding and bundling actin and define the Ig domains as actin-binding modules. The disease-causing mutations appear not to change the interplay between actin and myotilin. Interactions between Z-disk proteins regulate muscle functions and disruption of these interactions results in muscle disorders. Mutations in Z-disk components myotilin, ZASP/Cypher and FATZ-2 (calsarcin-1/myozenin-2) are associated with myopathies. We showed that proteins from the myotilin and FATZ families interact via a novel and unique type of class III PDZ binding motif with the PDZ domains of ZASP and other Enigma family members and that the interactions can be modulated by phosphorylation. The morphological findings typical of myotilinopathies include Z-disk alterations and aggregation of dense filamentous material. The causes and mechanisms of protein aggregation in myotilinopathy patients are unknown, but impaired degradation might explain in part the abnormal protein accumulation. We showed that myotilin is degraded by the calcium-dependent, non-lysosomal cysteine protease calpain and by the proteasome pathway, and that wild type and mutant myotilin differ in their sensitivity to degradation. These studies identify the first functional difference between mutated and wild type myotilin. Furthermore, if degradation of myotilin is disturbed, it accumulates in cells in a manner resembling that seen in myotilinopathy patients. Based on the results, we propose a model where mutant myotilin escapes proteolytic breakdown and forms protein aggregates, leading to disruption of myofibrils and muscular dystrophy. In conclusion, the main results of this study demonstrate that myotilin is a Z-disk structural protein interacting with several Z-disk components. The turnover of myotilin is regulated by calpain and the ubiquitin proteasome system and mutations in myotilin seem to affect the degradation of myotilin, leading to protein accumulations in cells. These findings are important for understanding myotilin-linked muscle diseases and designing treatments for these disorders.

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.

Hydrothermal synthesis and structural characterization of novel alpha-Keggin unit-supported Cu(II)- and Mn(II)-bipyridine complexes from a tri-lacunary precursor

Blue [{Cu(2,2'-bipy)(2)}(2){alpha-SiW12O40}] (bipy = bipyridyl) (1) and pale yellow [Mn(2,2'-bipy)(3)](2)[alpha-SiW12O40] (2) have been synthesized hydrothermally and characterized by IR spectroscopy and single crystal X-ray structure analysis. In 1, the [alpha-SiW12O40](4-) ion acts as a bridge between the two [{Cu(2,2'-bipy)(2)](2+) moieties via coordination through the terminal oxygen atoms, while in 2, the [Mn(2,2'-bipy)(3)](2+) ion balances the charge on the polyoxo anion without forming any covalent bond. To the best of our knowledge, this is the first example of transition metal-mediated transformation of [alpha-SiW9O34](10-) to [alpha-SiW12O40](4-).