PubMed HealthSearch

PubMed · 9135125

PDB-based protein loop prediction: parameters for selection and methods for optimization.

Abstract

An approach to loop prediction that starts with a database search is presented and analyzed. To obtain meaningful statistics, 130 loops from 21 proteins were studied. The correlation between the internal conformation of the loop and the conformation of the neighboring stem residues was examined. Distances between C(alpha) and C(beta) of the immediate neighbor residues at each end select template loops as well as more complex (e.g. three residues on either side) matching criteria. To have a high probability that the best possible loop candidate in the database is included in the set, relatively large cutoffs for matching the interatomic distances of the stem residues have to be used in the template loop selection procedure; for loops of length 5, this results in an average of 1000 loops and for loops of length 9, the number is about 1500. The required number increases only slowly with loop length, in contrast to the exponential time increase involved in direct searches of the conformational space. The best loops among the large number of candidates can be determined by ranking them with the standard CHARMM non-bonded energy function (without electrostatics) applied to the backbone and C(beta) atoms. The same representation (backbone plus C(beta)) can be used to optimize the loop orientations relative to the rest of the protein by constrained energy minimization. Target loops that have many non-bonded contacts with the protein yield better results so that analysis of the non-bonded contacts of the selected template loops is useful in determining the expected accuracy of a prediction. The method for loop selection and optimization predicted eight (out of 18) loops of up to nine residues to an RMSD better than 1.07 A relative to the crystal structure; for 17 of the 18 loops, one of the three lowest energy template loops had an RMSD of less than 1.79 A. The prediction of antibody loops from a database search is more effective than that for non-antibody loops. Provided that they belong to one of the canonical classes, very similar antibody loops are certain to exist in the database. Superposition of the stem residues for antibody loops also results in a better orientation than with arbitrary target loops because the neighboring residues tend to have a more similar beta-strand structure. Two H3 loops (for which no canonical structures have been proposed) were predicted with reasonable accuracy (RMSD of 0.49 A and 1.07 A) even though no corresponding antibody loops were in the database.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

H W van Vlijmen, M Karplus. 1997-04-11. PDB-based protein loop prediction: parameters for selection and methods for optimization.. https://doi.org/10.1006/jmbi.1996.0857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms