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

Efficient substructure RMSD query algorithms.

Tetsuo Shibuya1

  • 1Human Genome Center, Institute of Medical Science, University of Tokyo, Minato-ku, Tokyo, Japan. tshibuya@hgc.jp

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|November 10, 2007
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

Faster and More Accurate Estimation of Protein Hinges Based on Information Criteria.

Journal of computational biology : a journal of computational molecular cell biology·2025
Same author

Genetic algorithm-based feature selection with manifold learning for cancer classification using microarray data.

BMC bioinformatics·2023
Same author

More practical differentially private publication of key statistics in GWAS.

Bioinformatics advances·2023
Same author

Privacy-Preserving Statistical Analysis of Genomic Data Using Compressive Mechanism with Haar Wavelet Transform.

Journal of computational biology : a journal of computational molecular cell biology·2022
Same author

Efficient Differentially Private Methods for a Transmission Disequilibrium Test in Genome Wide Association Studies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2021
Same author

Nanopore basecalling from a perspective of instance segmentation.

BMC bioinformatics·2020
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study introduces efficient algorithms for calculating root mean square deviation (RMSD) between protein substructures. These methods enable rapid RMSD computation for aligned and unaligned protein structures, aiding molecular biology research.

Area of Science:

  • Molecular Biology
  • Structural Bioinformatics
  • Computational Biology

Background:

  • Protein structure analysis is crucial in the post-genomic era.
  • Root Mean Square Deviation (RMSD) is a standard metric for comparing 3D protein structures.
  • Efficient computation of RMSD for substructures is vital for various applications.

Purpose of the Study:

  • To develop algorithms for fast RMSD computation between protein substructures.
  • To address the range RMSD query problem for aligned structures.
  • To generalize and solve the substructure RMSD query problem for unaligned structures.

Main Methods:

  • Linear-time preprocessing for constant-time RMSD computation in aligned substructures.
  • O(nm) preprocessing for constant-time RMSD computation in unaligned substructures.

Related Experiment Videos

  • O(nm log r/r)-time and O(nm/r)-space preprocessing for O(r) query time.

    • Main Results:

    • A linear-time preprocessing algorithm enabling constant-time RMSD computation for aligned substructures.
    • An efficient algorithm for substructure RMSD queries on unaligned structures with improved preprocessing and query times.
    • Demonstrated applicability of the strategy to Unit-Vector RMSD (URMSD).

    Conclusions:

    • The proposed algorithms significantly enhance the efficiency of protein substructure comparison using RMSD.
    • These computational tools facilitate advanced protein structure analysis and discovery.
    • The methods are adaptable for related structural comparison metrics like URMSD.