Inhibition of protein interactions with the beta(2) sliding clamp of Escherichia coli DNA polymerase III by peptides from beta(2)-binding proteins

The sliding clamp of the Escherichia coli replisome is now understood to interact with many proteins involved in DNA synthesis and repair. A universal interaction motif is proposed to be one mechanism by which those proteins bind the E. coli sliding clamp, a homodimer of the beta subunit, at a single site on the dimer. The numerous beta(2)-binding proteins have various versions of the consensus interaction motif, including a related hexameric sequence. To determine if the variants of the motif could contribute to the competition of the beta-binding proteins for the beta(2) site, synthetic peptides derived from the putative beta(2)-binding motifs were assessed for their abilities to inhibit protein-beta(2) interactions, to bind directly to beta(2), and to inhibit DNA synthesis in vitro. A hierarchy emerged, which was consistent with sequence similarity to the pentameric consensus motif, QL(S/D)LF, and peptides containing proposed hexameric motifs were shown to have activities comparable to those containing the consensus sequence. The hierarchy of peptide binding may be indicative of a competitive hierarchy for the binding of proteins to beta(2) in various stages or circumstances of DNA replication and repair.

A Taxonomy of Big Data for Optimal Predictive Machine Learning and Data Mining

Big data comes in various ways, types, shapes, forms and sizes. Indeed, almost all areas of science, technology, medicine, public health, economics, business, linguistics and social science are bombarded by ever increasing flows of data begging to be analyzed efficiently and effectively. In this paper, we propose a rough idea of a possible taxonomy of big data, along with some of the most commonly used tools for handling each particular category of bigness. The dimensionality p of the input space and the sample size n are usually the main ingredients in the characterization of data bigness. The specific statistical machine learning technique used to handle a particular big data set will depend on which category it falls in within the bigness taxonomy. Large p small n data sets for instance require a different set of tools from the large n small p variety. Among other tools, we discuss Preprocessing, Standardization, Imputation, Projection, Regularization, Penalization, Compression, Reduction, Selection, Kernelization, Hybridization, Parallelization, Aggregation, Randomization, Replication, Sequentialization. Indeed, it is important to emphasize right away that the so-called no free lunch theorem applies here, in the sense that there is no universally superior method that outperforms all other methods on all categories of bigness. It is also important to stress the fact that simplicity in the sense of Ockham’s razor non-plurality principle of parsimony tends to reign supreme when it comes to massive data. We conclude with a comparison of the predictive performance of some of the most commonly used methods on a few data sets.

Identifying DNA-binding proteins by combining support vector machine and PSSM distance transformation

Background: DNA-binding proteins play a pivotal role in various intra- and extra-cellular activities ranging from DNA replication to gene expression control. Identification of DNA-binding proteins is one of the major challenges in the field of genome annotation. There have been several computational methods proposed in the literature to deal with the DNA-binding protein identification. However, most of them can't provide an invaluable knowledge base for our understanding of DNA-protein interactions. Results: We firstly presented a new protein sequence encoding method called PSSM Distance Transformation, and then constructed a DNA-binding protein identification method (SVM-PSSM-DT) by combining PSSM Distance Transformation with support vector machine (SVM). First, the PSSM profiles are generated by using the PSI-BLAST program to search the non-redundant (NR) database. Next, the PSSM profiles are transformed into uniform numeric representations appropriately by distance transformation scheme. Lastly, the resulting uniform numeric representations are inputted into a SVM classifier for prediction. Thus whether a sequence can bind to DNA or not can be determined. In benchmark test on 525 DNA-binding and 550 non DNA-binding proteins using jackknife validation, the present model achieved an ACC of 79.96%, MCC of 0.622 and AUC of 86.50%. This performance is considerably better than most of the existing state-of-the-art predictive methods. When tested on a recently constructed independent dataset PDB186, SVM-PSSM-DT also achieved the best performance with ACC of 80.00%, MCC of 0.647 and AUC of 87.40%, and outperformed some existing state-of-the-art methods. Conclusions: The experiment results demonstrate that PSSM Distance Transformation is an available protein sequence encoding method and SVM-PSSM-DT is a useful tool for identifying the DNA-binding proteins. A user-friendly web-server of SVM-PSSM-DT was constructed, which is freely accessible to the public at the web-site on http://bioinformatics.hitsz.edu.cn/PSSM-DT/.

Studies of CMS data access patterns with machine learning techniques

This thesis presents a study of the Grid data access patterns in distributed analysis in the CMS experiment at the LHC accelerator. This study ranges from the deep analysis of the historical patterns of access to the most relevant data types in CMS, to the exploitation of a supervised Machine Learning classification system to set-up a machinery able to eventually predict future data access patterns - i.e. the so-called dataset “popularity” of the CMS datasets on the Grid - with focus on specific data types. All the CMS workflows run on the Worldwide LHC Computing Grid (WCG) computing centers (Tiers), and in particular the distributed analysis systems sustains hundreds of users and applications submitted every day. These applications (or “jobs”) access different data types hosted on disk storage systems at a large set of WLCG Tiers. The detailed study of how this data is accessed, in terms of data types, hosting Tiers, and different time periods, allows to gain precious insight on storage occupancy over time and different access patterns, and ultimately to extract suggested actions based on this information (e.g. targetted disk clean-up and/or data replication). In this sense, the application of Machine Learning techniques allows to learn from past data and to gain predictability potential for the future CMS data access patterns. Chapter 1 provides an introduction to High Energy Physics at the LHC. Chapter 2 describes the CMS Computing Model, with special focus on the data management sector, also discussing the concept of dataset popularity. Chapter 3 describes the study of CMS data access patterns with different depth levels. Chapter 4 offers a brief introduction to basic machine learning concepts and gives an introduction to its application in CMS and discuss the results obtained by using this approach in the context of this thesis.

Sensitivity and specificity of machine learning classifiers for glaucoma diagnosis using Spectral Domain OCT and standard automated perimetry

PURPOSE: To evaluate the sensitivity and specificity of machine learning classifiers (MLCs) for glaucoma diagnosis using Spectral Domain OCT (SD-OCT) and standard automated perimetry (SAP). METHODS: Observational cross-sectional study. Sixty two glaucoma patients and 48 healthy individuals were included. All patients underwent a complete ophthalmologic examination, achromatic standard automated perimetry (SAP) and retinal nerve fiber layer (RNFL) imaging with SD-OCT (Cirrus HD-OCT; Carl Zeiss Meditec Inc., Dublin, California). Receiver operating characteristic (ROC) curves were obtained for all SD-OCT parameters and global indices of SAP. Subsequently, the following MLCs were tested using parameters from the SD-OCT and SAP: Bagging (BAG), Naive-Bayes (NB), Multilayer Perceptron (MLP), Radial Basis Function (RBF), Random Forest (RAN), Ensemble Selection (ENS), Classification Tree (CTREE), Ada Boost M1(ADA),Support Vector Machine Linear (SVML) and Support Vector Machine Gaussian (SVMG). Areas under the receiver operating characteristic curves (aROC) obtained for isolated SAP and OCT parameters were compared with MLCs using OCT+SAP data. RESULTS: Combining OCT and SAP data, MLCs' aROCs varied from 0.777(CTREE) to 0.946 (RAN).The best OCT+SAP aROC obtained with RAN (0.946) was significantly larger the best single OCT parameter (p<0.05), but was not significantly different from the aROC obtained with the best single SAP parameter (p=0.19). CONCLUSION: Machine learning classifiers trained on OCT and SAP data can successfully discriminate between healthy and glaucomatous eyes. The combination of OCT and SAP measurements improved the diagnostic accuracy compared with OCT data alone.

Classification of breast masses using a committee machine of artificial neural networks

This work proposes a new approach using a committee machine of artificial neural networks to classify masses found in mammograms as benign or malignant. Three shape factors, three edge-sharpness measures, and 14 texture measures are used for the classification of 20 regions of interest (ROIs) related to malignant tumors and 37 ROIs related to benign masses. A group of multilayer perceptrons (MLPs) is employed as a committee machine of neural network classifiers. The classification results are reached by combining the responses of the individual classifiers. Experiments involving changes in the learning algorithm of the committee machine are conducted. The classification accuracy is evaluated using the area A. under the receiver operating characteristics (ROC) curve. The A, result for the committee machine is compared with the A, results obtained using MLPs and single-layer perceptrons (SLPs), as well as a linear discriminant analysis (LDA) classifier Tests are carried out using the student's t-distribution. The committee machine classifier outperforms the MLP SLP, and LDA classifiers in the following cases: with the shape measure of spiculation index, the A, values of the four methods are, in order 0.93, 0.84, 0.75, and 0.76; and with the edge-sharpness measure of acutance, the values are 0.79, 0.70, 0.69, and 0.74. Although the features with which improvement is obtained with the committee machines are not the same as those that provided the maximal value of A(z) (A(z) = 0.99 with some shape features, with or without the committee machine), they correspond to features that are not critically dependent on the accuracy of the boundaries of the masses, which is an important result. (c) 2008 SPIE and IS&T.

Unexpected Diversity of Cellular Immune Responses against Nef and Vif in HIV-1-Infected Patients Who Spontaneously Control Viral Replication

Background: HIV-1-infected individuals who spontaneously control viral replication represent an example of successful containment of the AIDS virus. Understanding the anti-viral immune responses in these individuals may help in vaccine design. However, immune responses against HIV-1 are normally analyzed using HIV-1 consensus B 15-mers that overlap by 11 amino acids. Unfortunately, this method may underestimate the real breadth of the cellular immune responses against the autologous sequence of the infecting virus. Methodology and Principal Findings: Here we compared cellular immune responses against nef and vif-encoded consensus B 15-mer peptides to responses against HLA class I-predicted minimal optimal epitopes from consensus B and autologous sequences in six patients who have controlled HIV-1 replication. Interestingly, our analysis revealed that three of our patients had broader cellular immune responses against HLA class I-predicted minimal optimal epitopes from either autologous viruses or from the HIV-1 consensus B sequence, when compared to responses against the 15-mer HIV-1 type B consensus peptides. Conclusion and Significance: This suggests that the cellular immune responses against HIV-1 in controller patients may be broader than we had previously anticipated.

Thermal error evaluation and modelling of a CNC cylindrical grinding machine

With the relentless quest for improved performance driving ever tighter tolerances for manufacturing, machine tools are sometimes unable to meet the desired requirements. One option to improve the tolerances of machine tools is to compensate for their errors. Among all possible sources of machine tool error, thermally induced errors are, in general for newer machines, the most important. The present work demonstrates the evaluation and modelling of the behaviour of the thermal errors of a CNC cylindrical grinding machine during its warm-up period.

Hygroexpansivity profiles on a commercial paper machine

Paper products show dimensional changes when subjected to moisture content modification. Hygroexpansivity was investigated in a commercial paper machine operating at 1256 m/min by a set of measurements on 75 g/m(2) reprographic bleached eucalyptus pulp paper samples. The present work shows hygroexpansivity development in different sections of the paper machine along the manufacturing direction. The measurement results demonstrate the effects of papermaking process operations on paper hygroexpansivity and lead to the confirmation of fiber orientation degree, drying restraint and shrinkage and paper tension as significant influencing factors. Structural, strength and elastic properties of paper were also measured as a function of machine direction position and presented for discussion purposes.

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule fora given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs. (C) 2007 Elsevier Ltd. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Wolbachia replication and host cell division in Aedes albopictus

Wolbachia pipientis is an obligate intracellular endosymbiont of a range of arthropod species. The microbe is best known for its manipulations of host reproduction that include inducing cytoplasmic incompatibility, parthenogenesis, feminization, and male-killing. Like other vertically transmitted intracellular symbionts, Wolbachiarsquos replication rate must not outpace that of its host cells if it is to remain benign. The mosquito Aedes albopictus is naturally infected both singly and doubly with different strains of Wolbachia pipientis. During diapause in mosquito eggs, no host cell division is believed to occur. Further development is triggered only by subsequent exposure of the egg to water. This study uses diapause in Wolbachia-infected Aedes albopictus eggs to determine whether symbiont replication slows or stops when host cell division ceases or whether it continues at a low but constant rate. We have shown that Wolbachia densities in eggs are greatest during embryonation and then decline throughout diapause, suggesting that Wolbachia replication is dependent on host cell replication.

Site-directed mutants of RTP of Bacillus subtilis and the mechanism of replication fork arrest

DNA replication fork arrest during the termination phase of chromosome replication in Bacillus subtilis is brought about by the replication terminator protein (RTP) bound to specific DNA terminator sequences (Tev sites) distributed throughout the terminus region. An attractive suggestion by others was that crucial to the functioning of the RTP-Ter complex is a specific interaction between RTP positioned on the DNA and the helicase associated with the approaching replication fork. Ln support of this was the behaviour of two site-directed mutants of RTP. They appeared to bind Ter DNA normally but were ineffective in fork arrest as ascertained by in vitro Escherichia coli DnaB helicase and replication assays. We describe here a system for assessing the fork-arrest behaviour of RTP mutants in a bona fide in vivo assay in B. subtilis. One of the previously studied mutants, RTP.Y33N, was non-functional in fork arrest in vivo, as predicted. But through extensive analyses, this RTP mutant was shown to be severely defective in binding to Ter DNA, contrary to expectation. Taken in conjunction with recent findings on the other mutant (RTP.E30K), it is concluded that there is as yet no substantive evidence from the behaviour of RTP mutants to support the Rm-helicase interaction model for fork arrest. In an extension of the present work on RTP.Y33N, we determined the dissociation rates of complexes formed by wild-type (wt) RTP and another RTP mutant with various terminator sequences. The functional wtRTP-TerI complex was quite stable (half-life of 182 minutes), reminiscent of the great stability of the E. coli Tus-Ter complex. More significant were the exceptional stabilities of complexes comprising wtRTP and an RTP double-mutant (E39K.R42Q) bound to some particular terminator sequences. From the measurement of in vivo fork-arrest activities of the various complexes, it is concluded that the stability (half-life) of the whole RTP-Ter complex is not the overriding determinant of arrest, and that the RTP-Ter complex must be actively disrupted, or RTP removed, by the action of the approaching replication fork. (C) 1999 Academic Press.