skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A deterministic algorithm for constrained enumeration of transmembrane protein folds.

Abstract

A deterministic algorithm for enumeration of transmembrane protein folds is presented. Using a set of sparse pairwise atomic distance constraints (such as those obtained from chemical cross-linking, FRET, or dipolar EPR experiments), the algorithm performs an exhaustive search of secondary structure element packing conformations distributed throughout the entire conformational space. The end result is a set of distinct protein conformations, which can be scored and refined as part of a process designed for computational elucidation of transmembrane protein structures.

Authors:
;  [1];  [1]; ;  [1]
  1. (Sandia National Laboratories, Livermore, California)
Publication Date:
Research Org.:
Sandia National Laboratories
Sponsoring Org.:
USDOE
OSTI Identifier:
959090
Report Number(s):
SAND2004-3702C
TRN: US201001%%152
DOE Contract Number:
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the Pacific Symposium on Biocomputing held January 4-8, 2005 in Fairmont Orchid, HI.
Country of Publication:
United States
Language:
English
Subject:
59 BASIC BIOLOGICAL SCIENCES; ALGORITHMS; PROTEIN STRUCTURE; PROTEINS

Citation Formats

Brown, William Michael, Young, Malin M., Sale, Kenneth L., Faulon, Jean-Loup Michel, and Schoeniger, Joseph S. A deterministic algorithm for constrained enumeration of transmembrane protein folds.. United States: N. p., 2004. Web.
Brown, William Michael, Young, Malin M., Sale, Kenneth L., Faulon, Jean-Loup Michel, & Schoeniger, Joseph S. A deterministic algorithm for constrained enumeration of transmembrane protein folds.. United States.
Brown, William Michael, Young, Malin M., Sale, Kenneth L., Faulon, Jean-Loup Michel, and Schoeniger, Joseph S. Thu . "A deterministic algorithm for constrained enumeration of transmembrane protein folds.". United States. doi:.
@article{osti_959090,
title = {A deterministic algorithm for constrained enumeration of transmembrane protein folds.},
author = {Brown, William Michael and Young, Malin M. and Sale, Kenneth L. and Faulon, Jean-Loup Michel and Schoeniger, Joseph S.},
abstractNote = {A deterministic algorithm for enumeration of transmembrane protein folds is presented. Using a set of sparse pairwise atomic distance constraints (such as those obtained from chemical cross-linking, FRET, or dipolar EPR experiments), the algorithm performs an exhaustive search of secondary structure element packing conformations distributed throughout the entire conformational space. The end result is a set of distinct protein conformations, which can be scored and refined as part of a process designed for computational elucidation of transmembrane protein structures.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Jul 01 00:00:00 EDT 2004},
month = {Thu Jul 01 00:00:00 EDT 2004}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Costas sequences are special permutations which are important in sonar and radar applications. Common backtracking algorithms add terms to a single side of the sequence, but we have developed an algorithm that enumerates all Costas sequences more efficiently by performing backtracking adding terms to both sides of the sequence. This novel technique is combined with the fact that Costas sequences are invariant under the symmetries of the rectangle to reduce efficiently the computation time by not repeating a searched pattern as subpattern in a different branch of the search. We have adapted this method for its implementation on parallel MIMDmore » computers by the use of the manager-worker technique obtaining almost perfect efficiency on the time distribution.« less
  • We present two new sets of energy functions for protein structure recognition. The first set of potentials is based on the positions of alpha- and the second on positions of beta-carbon atoms of amino acid residues. The potentials are derived using a theory of Boltzmann-like statistics of protein structure by Finkelstein et al. The energy terms incorporate both long-range interactions between residues remote along a chain and short-range interactions between near neighbors. Distance-dependence is approximated by a piecewise constant function defined on intervals of equal size. The size of this interval is optimized. A database of 222 non-homologous proteins wasmore » used both for the derivation of the potentials, and for the {open_quotes}threading{close_quotes} test originally suggested by Hendlich et al. For threading, we used 102 non-homologous protein chains of 60 to 200 residues. The energy of each of the native structures was compared with the energy of 45 to 20 thousand alternative structures generated by threading. Of these 102 native structures 94 have the lowest energy with alpha-carbon-based potentials, and even more, 100 of these 102 structures, have the lowest energy with the beta-carbon-based potentials. 17 refs., 1 fig., 5 tabs.« less
  • An algorithm was developed for beam envelope matching with fixed geometry, taking into account the full order behavior of the quadrupoles and their compounded effects. The algebraic complexity of the system has hitherto defied attempts to obtain global solutions in any deterministic manner. In the present approach an algorithm to systematically reduce the overall system of equations has resulted in a system of two 8th order equations in only two variables in the thin lens approximation, and a system of two 12th order equations in two variables in the semi-thin lens approximation. The former displays a high degree of robustnessmore » in providing true global solutions, while the latter can be deterministically iterated to approach the exact thick lens solution to very high accuracy, and can be applied to configurations with arbitrary non-dispersive intervening optics. At the numerical level these 2 reduced systems are input to an equation solver in Mathematica 4.0 based on Grobner-basis techniques, capable of providing global solutions to such algebraic systems. The combined application of these 2 systems of equations has resulted in a very robust and effective algorithm for on-line optical beam envelope matching. The global nature of the algorithm also may point to possible deficiencies in the optical system configuration when no solution in real numbers exists. This affords a higher degree of insight and confidence than is possible with local-root-searching algorithms. An on-line high precision transfer matrix measurement program was developed in conjunction to provide input to this algorithm. Preliminary on-line testing on the CEBAF accelerator at the Thomas Jefferson National Accelerator Facility has positively demonstrated the effectiveness of this method. Direction for further enhancement of the algorithm will also be discussed.« less
  • An active and passive computed tomographic technique (A&PCT) has been developed at the Lawrence Livermore National Laboratory (LLNL). The technique uses an external radioactive source and active tomography to map the attenuation within a waste drum as a function of mono-energetic gamma-ray energy. Passive tomography is used to localize and identify specific radioactive waste within the same container. The passive data is corrected for attenuation using the active data and this yields a quantitative assay of drum activity. A&PCT involves the development of a detailed system model that combines the data from the active scans with the geometry of themore » imaging system. Using the system model, iterative optimization techniques are used to reconstruct the image from the passive data. Requirements for high throughput yield measured emission levels in waste barrels that are too low to apply optimization techniques involving the usual Gaussian statistics. In this situation a Poisson distribution, typically used for cases with low counting statistics, is used to create an effective maximum likelihood estimation function. An optimization algorithm, Constrained Conjugate Gradient (CCG), is used to determine a solution for A&PCT quantitative assay. CCG, which was developed at LLNL, has proven to be an efficient and effective optimization method to solve limited-data problems. A detailed explanation of the algorithms used in developing the model and optimization codes is given.« less