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

Global optimum protein threading with gapped alignment and empirical pair score functions

R H Lathrop1, T F Smith

  • 1Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge 02139, USA.

Journal of Molecular Biology
|February 2, 1996
PubMed
Summary

A new branch-and-bound algorithm precisely finds the best protein sequence-structure alignment (threading). This method efficiently searches vast, complex protein structure spaces for accurate predictions.

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

A Rapid Review of International Evaluations of interRAI Systems.

Healthcare management forum·2025
Same author

Examination and measurement of coping among adolescents with spinal cord injury.

Spinal cord·2013
Same author

Radiative transfer for a three-dimensional raining cloud.

Applied optics·2010
Same author

Thrombosis of Inferior Vena Cava.

British medical journal·2010
Same author

Enlarged Thyroid: Disappearance of Gland Followed by Myxoedema.

British medical journal·2010
Same author

Real-time PCR in clinical microbiology: applications for routine laboratory testing.

Clinical microbiology reviews·2006

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Structural Biology

Background:

  • Protein structure prediction is crucial for understanding protein function.
  • Accurate protein sequence-structure alignment (threading) is computationally challenging.
  • Existing methods often rely on heuristics or simplified scoring functions.

Purpose of the Study:

  • To develop an exact global optimum algorithm for protein sequence-structure alignment.
  • To create a flexible search method applicable to various scoring functions and threading methodologies.
  • To enable efficient exploration of large protein search spaces.

Main Methods:

  • Implementation of a branch-and-bound search algorithm.
  • Application of arbitrary amino acid pair score functions and sequence-specific loop/active site scoring.

Related Experiment Videos

  • Testing on NP-hard search spaces up to 9.6 x 10^31.

    • Main Results:

    • Achieved exact global optimum gapped sequence-structure alignments.
    • Demonstrated high search rates (up to 6.8 x 10^28 equivalent threadings/sec) on large search spaces.
    • Developed efficient algorithms for search space analysis (size, sampling, statistics).

    Conclusions:

    • The branch-and-bound algorithm provides an exact solution for protein threading.
    • The method's flexibility supports diverse scoring functions and threading approaches.
    • This approach is valuable for protein structure prediction and scoring function evaluation.