7 results on '"Standley, Dm"'
Search Results
2. A novel unbiased measure for motif co-occurrence predicts combinatorial regulation of transcription.
- Author
-
Vandenbon A, Kumagai Y, Akira S, and Standley DM
- Subjects
- Animals, Binding Sites, CCAAT-Enhancer-Binding Protein-alpha genetics, CCAAT-Enhancer-Binding Protein-alpha metabolism, CpG Islands, Forkhead Transcription Factors genetics, Forkhead Transcription Factors metabolism, Genome, Hepatocyte Nuclear Factor 1-alpha genetics, Hepatocyte Nuclear Factor 1-alpha metabolism, Humans, Kidney metabolism, Liver metabolism, Mice, NF-kappa B genetics, NF-kappa B metabolism, Promoter Regions, Genetic, Repressor Proteins genetics, Repressor Proteins metabolism, Toll-Like Receptors genetics, Toll-Like Receptors metabolism, Transcription Factors metabolism, Algorithms, Transcription Factors genetics, Transcription, Genetic genetics
- Abstract
Background: Multiple transcription factors (TFs) are involved in the generation of gene expression patterns, such as tissue-specific gene expression and pleiotropic immune responses. However, how combinations of TFs orchestrate diverse gene expression patterns is poorly understood. Here we propose a new measure for regulatory motif co-occurrence and a new methodology to systematically identify TF pairs significantly co-occurring in a set of promoter sequences., Results: Initial analyses suggest that non-CpG promoters have a higher potential for combinatorial regulation than CpG island-associated promoters, and that co-occurrences are strongly influenced by motif similarity. We applied our method to large-scale gene expression data from various tissues, and showed how our measure for motif co-occurrence is not biased by motif over-representation. Our method identified, amongst others, the binding motifs of HNF1 and FOXP1 to be significantly co-occurring in promoters of liver/kidney specific genes. Binding sites tend to be positioned proximally to each other, suggesting interactions exist between this pair of transcription factors. Moreover, the binding sites of several TFs were found to co-occur with NF-κB and IRF sites in sets of genes with similar expression patterns in dendritic cells after Toll-like receptor stimulation. Of these, we experimentally verified that CCAAT enhancer binding protein alpha positively regulates its target promoters synergistically with NF-κB., Conclusions: Both computational and experimental results indicate that the proposed method can clarify TF interactions that could not be observed by currently available prediction methods.
- Published
- 2012
- Full Text
- View/download PDF
3. EPSVR and EPMeta: prediction of antigenic epitopes using support vector regression and multiple server results.
- Author
-
Liang S, Zheng D, Standley DM, Yao B, Zacharias M, and Zhang C
- Subjects
- Antigen-Antibody Complex chemistry, Antigen-Antibody Complex immunology, Epitope Mapping, Humans, ROC Curve, Regression Analysis, Algorithms, Computational Biology methods, Epitopes, B-Lymphocyte chemistry, Epitopes, B-Lymphocyte immunology
- Abstract
Background: Accurate prediction of antigenic epitopes is important for immunologic research and medical applications, but it is still an open problem in bioinformatics. The case for discontinuous epitopes is even worse - currently there are only a few discontinuous epitope prediction servers available, though discontinuous peptides constitute the majority of all B-cell antigenic epitopes. The small number of structures for antigen-antibody complexes limits the development of reliable discontinuous epitope prediction methods and an unbiased benchmark to evaluate developed methods., Results: In this work, we present two novel server applications for discontinuous epitope prediction: EPSVR and EPMeta, where EPMeta is a meta server. EPSVR, EPMeta, and datasets are available at http://sysbio.unl.edu/services., Conclusion: The server application for discontinuous epitope prediction, EPSVR, uses a Support Vector Regression (SVR) method to integrate six scoring terms. Furthermore, we combined EPSVR with five existing epitope prediction servers to construct EPMeta. All methods were benchmarked by our curated independent test set, in which all antigens had no complex structures with the antibody, and their epitopes were identified by various biochemical experiments. The area under the receiver operating characteristic curve (AUC) of EPSVR was 0.597, higher than that of any other existing single server, and EPMeta had a better performance than any single server - with an AUC of 0.638, significantly higher than PEPITO and Disctope (p-value < 0.05).
- Published
- 2010
- Full Text
- View/download PDF
4. ASH structure alignment package: sensitivity and selectivity in domain classification.
- Author
-
Standley DM, Toh H, and Nakamura H
- Subjects
- Amino Acid Sequence, Conserved Sequence, Molecular Sequence Data, Protein Structure, Tertiary, Proteins classification, Sensitivity and Specificity, Sequence Homology, Amino Acid, Algorithms, Proteins chemistry, Sequence Alignment methods, Sequence Analysis, Protein methods, Software
- Abstract
Background: Structure alignment methods offer the possibility of measuring distant evolutionary relationships between proteins that are not visible by sequence-based analysis. However, the question of how structural differences and similarities ought to be quantified in this regard remains open. In this study we construct a training set of sequence-unique CATH and SCOP domains, from which we develop a scoring function that can reliably identify domains with the same CATH topology and SCOP fold classification. The score is implemented in the ASH structure alignment package, for which the source code and a web service are freely available from the PDBj website http://www.pdbj.org/ASH/., Results: The new ASH score shows increased selectivity and sensitivity compared with values reported for several popular programs using the same test set of 4,298,905 structure pairs, yielding an area of .96 under the receiver operating characteristic (ROC) curve. In addition, weak sequence homologies between similar domains are revealed that could not be detected by BLAST sequence alignment. Also, a subset of domain pairs is identified that exhibit high similarity, even though their CATH and SCOP classification differs. Finally, we show that the ranking of alignment programs based solely on geometric measures depends on the choice of the quality measure., Conclusion: ASH shows high selectivity and sensitivity with regard to domain classification, an important step in defining distantly related protein sequence families. Moreover, the CPU cost per alignment is competitive with the fastest programs, making ASH a practical option for large-scale structure classification studies.
- Published
- 2007
- Full Text
- View/download PDF
5. GASH: an improved algorithm for maximizing the number of equivalent residues between two protein structures.
- Author
-
Standley DM, Toh H, and Nakamura H
- Subjects
- Algorithms, Proteins chemistry, Sequence Alignment methods, Software
- Abstract
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a quantitative measure of structural similarity that can be applied to any structural alignment method. Multiple alignments are optimized by conjugate gradient maximization of the NER score within the genetic algorithm framework. Initial alignments are generated by the program Local ASH, and can be supplemented by alignments from any other program., Results: We compare GASH to DaliLite, CE, and to our earlier program Global ASH on a difficult test set consisting of 3,102 structure pairs, as well as a smaller set derived from the Fischer-Eisenberg set. The extent of alignment crossover, as well as the completeness of the initial set of alignments are examined. The quality of the superpositions is evaluated both by NER and by the number of aligned residues under three different RMSD cutoffs (2,4, and 6A). In addition to the numerical assessment, the alignments for several biologically related structural pairs are discussed in detail., Conclusion: Regardless of which criteria is used to judge the superposition accuracy, GASH achieves the best overall performance, followed by DaliLite, Global ASH, and CE. In terms of CPU usage, DaliLite CE and GASH perform similarly for query proteins under 500 residues, but for larger proteins DaliLite is faster than GASH or CE. Both an http interface and a simple object application protocol (SOAP) interface to the GASH program are available at http://www.pdbj.org/GASH/.
- Published
- 2005
- Full Text
- View/download PDF
6. Protein tertiary structure prediction using a branch and bound algorithm.
- Author
-
Eyrich VA, Standley DM, Felts AK, and Friesner RA
- Subjects
- Computer Simulation, Models, Chemical, Monte Carlo Method, Protein Folding, Algorithms, Protein Structure, Tertiary
- Abstract
We report a new method for predicting protein tertiary structure from sequence and secondary structure information. The predictions result from global optimization of a potential energy function, including van der Waals, hydrophobic, and excluded volume terms. The optimization algorithm, which is based on the alphaBB method developed by Floudas and coworkers (Costas and Floudas, J Chem Phys 1994;100:1247-1261), uses a reduced model of the protein and is implemented in both distance and dihedral angle space, enabling a side-by-side comparison of methodologies. For a set of eight small proteins, representing the three basic types--all alpha, all beta, and mixed alpha/beta--the algorithm locates low-energy native-like structures (less than 6A root mean square deviation from the native coordinates) starting from an unfolded state. Serial and parallel implementations of this methodology are discussed.
- Published
- 1999
7. A branch and bound algorithm for protein structure refinement from sparse NMR data sets.
- Author
-
Standley DM, Eyrich VA, Felts AK, Friesner RA, and McDermott AE
- Subjects
- Databases, Factual, Disulfides chemistry, Models, Molecular, Protein Conformation, Thermodynamics, Algorithms, Magnetic Resonance Spectroscopy, Proteins chemistry
- Abstract
We describe new methods for predicting protein tertiary structures to low resolution given the specification of secondary structure and a limited set of long-range NMR distance constraints. The NMR data sets are derived from a realistic protocol involving completely deuterated 15N and 13C-labeled samples. A global optimization method, based upon a modification of the alphaBB (branch and bound) algorithm of Floudas and co-workers, is employed to minimize an objective function combining the NMR distance restraints with a residue-based protein folding potential containing hydrophobicity, excluded volume, and van der Waals interactions. To assess the efficacy of the new methodology, results are compared with benchmark calculations performed via the X-PLOR program of Brünger and co-workers using standard distance geometry/molecular dynamics (DGMD) calculations. Seven mixed alpha/beta proteins are examined, up to a size of 183 residues, which our methods are able to treat with a relatively modest computational effort, considering the size of the conformational space. In all cases, our new approach provides substantial improvement in root-mean-square deviation from the native structure over the DGMD results; in many cases, the DGMD results are qualitatively in error, whereas the new method uniformly produces high quality low-resolution structures. The DGMD structures, for example, are systematically non-compact, which probably results from the lack of a hydrophobic term in the X-PLOR energy function. These results are highly encouraging as to the possibility of developing computational/NMR protocols for accelerating structure determination in larger proteins, where data sets are often underconstrained., (Copyright 1999 Academic Press.)
- Published
- 1999
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.