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

Protein threading with profiles and distance constraints using clique based algorithms.

Bahadur K C Dukka1, Etsuji Tomita, Jun'ichi Suzuki

  • 1Graduate School of Informatics & Bioinformatics Center, Kyoto University, Kyoto 611-0001, Japan. dukka@kuicr.kyoto-u.ac.jp

Journal of Bioinformatics and Computational Biology
|March 29, 2006
PubMed
Summary

New algorithms FTHREAD and NTHREAD improve protein threading by incorporating experimental distance constraints. These methods enhance alignment quality and are faster than previous approaches, especially NTHREAD when constraints are not strictly met.

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

The CD4<sup>+</sup> T cell population partners with Tpex CD8<sup>+</sup> T cells to mediate antitumor immunity in the tumor microenvironment.

Nature communications·2026
Same author

On the Number of Control Nodes in Boolean Networks With Degree Constraints.

IEEE transactions on cybernetics·2026
Same author

DiCleavePlus: A Transformer-Based Model to Detect Human Dicer Cleavage Sites Within Cleavage Patterns.

Genes to cells : devoted to molecular & cellular mechanisms·2025
Same author

Toward Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.

ACS omega·2025
Same author

Enhancing epidemic forecasting with a physics-informed spatial identity neural network.

PloS one·2025
Same author

Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference.

Journal of cheminformatics·2025

Area of Science:

  • Computational biology
  • Structural bioinformatics
  • Protein structure prediction

Background:

  • Experimental techniques like chemical cross-linking provide residue-specific distance information for proteins.
  • This data is valuable for improving protein threading methods, which predict protein structure.
  • Integrating distance constraints into protein threading is computationally challenging (NP-hard).

Purpose of the Study:

  • To develop efficient algorithms for protein threading that utilize experimental distance constraints.
  • To improve the accuracy and speed of protein structure prediction using this novel approach.
  • To compare the performance of strict versus non-strict constraint satisfaction in threading.

Main Methods:

  • Introduced FTHREAD, an efficient algorithm for profile threading with strict distance constraints, utilizing maximum edge-weight clique finding.

Related Experiment Videos

  • Developed NTHREAD, a practical algorithm for profile threading with non-strict constraints.
  • Analyzed the impact of varying numbers of distance constraints on alignment quality.

    • Main Results:

    • FTHREAD is 18 times faster than its predecessor, CLIQUETHREAD.
    • FTHREAD performs comparably to existing methods despite a simple threading function.
    • NTHREAD outperforms FTHREAD when constraints are not strictly satisfied, demonstrating the advantage of non-strict approaches.
    • The algorithms enhance alignment quality between query sequences and template structures.

    Conclusions:

    • FTHREAD and NTHREAD offer efficient and effective solutions for protein threading with distance constraints.
    • The developed methods enhance the accuracy of protein structure prediction by integrating experimental data.
    • NTHREAD's superior performance with unsatisfied constraints highlights the practical utility of non-strict constraint handling.