Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

MINRMS: an efficient algorithm for determining protein structure similarity using root-mean-squared-distance.

Andrew I Jewett1, Conrad C Huang, Thomas E Ferrin

  • 1Computer Graphics Laboratory, Department of Pharmaceutical Chemistry, University of California at San Fransisco, San Fransisco, CA 94143-0446, USA.

Bioinformatics (Oxford, England)
|March 26, 2003
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

IHMCIF: An Extension of the PDBx/mmCIF Data Standard for Integrative Structure Determination Methods.

Journal of molecular biology·2024
Same author

UCSF ChimeraX: Tools for structure building and analysis.

Protein science : a publication of the Protein Society·2023
Same author

Integrative structural modelling and visualisation of a cellular organelle.

QRB discovery·2023
Same author

Bdellovibrio predation cycle characterized at nanometre-scale resolution with cryo-electron tomography.

Nature microbiology·2023
Same author

The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information.

Bioinformatics (Oxford, England)·2023
Same author

Moltemplate: A Tool for Coarse-Grained Modeling of Complex Biological Matter and Soft Condensed Matter Physics.

Journal of molecular biology·2021
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

A new algorithm improves protein structure alignment by limiting search spaces and calculating minimal root-mean-squared-distance (RMSD) alignments. This method offers a faster, more interpretable way to analyze protein shape similarities.

Area of Science:

  • Computational Biology
  • Structural Bioinformatics
  • Biophysics

Background:

  • Automated protein structure alignment algorithms often yield conflicting and difficult-to-interpret results.
  • A need exists for algorithms that provide context for alignment interpretation and employ simple methods for characterizing protein structure similarity.

Purpose of the Study:

  • To develop a novel algorithm for protein structure alignment that addresses limitations of existing methods.
  • To provide a systematic analysis of plausible shape similarities between proteins using a standard metric.

Main Methods:

  • A heuristic approach is introduced to reduce the search space for structure alignment comparisons.
  • An algorithm calculates minimal root-mean-squared-distance (RMSD) alignments based on matching residue pairs.

Related Experiment Videos

  • Protein structures are represented using alpha-carbon atom coordinates.

    • Main Results:

    • The alignment algorithm has a computational complexity of O(m(3) n(2)), where m and n are protein sequence lengths.
    • The method is efficient enough for comparing moderate-sized proteins (under 800 residues) on standard workstations.
    • Enables systematic analysis of multiple potential shape similarities.

    Conclusions:

    • The developed algorithm offers a faster and more interpretable solution for protein structure alignment.
    • It facilitates a more comprehensive understanding of protein structural relationships and similarities.
    • Addresses the need for robust and efficient tools in structural bioinformatics.