Related Experiment Video
Updated: Jun 16, 2026

Interactome-Seq: A Protocol for Domainome Library Construction, Validation and Selection by Phage Display and Next Generation Sequencing
Published on: October 3, 2018
A fast and automated solution for accurately resolving protein domain architectures
Corin Yeats1, Oliver C Redfern, Christine Orengo
1Department of Structural and Molecular Biology, UCL, London WC1E 6BT, UK. yeats@biochem.ucl.ac.uk
We developed a novel protein domain prediction method using heaviest weighted clique-finding (HCF) that significantly improves accuracy over standard approaches. This method effectively handles overlapping domain matches for better multi-domain protein analysis.
Area of Science:
- Computational biology
- Bioinformatics
- Structural biology
Background:
- Multi-domain proteins are crucial for various biological processes, constituting over 65% of protein databases.
- Accurate prediction of protein domain content and arrangement aids function prediction, comparative genomics, and evolutionary studies.
- Existing methods for domain prediction often yield conflicting or overlapping matches, necessitating improved approaches.
Purpose of the Study:
- To develop and evaluate a novel method for accurate prediction of domain content and arrangement in multi-domain proteins.
- To address the limitations of existing methods, such as the Best Match Cascade (BMC), in handling conflicting and overlapping domain predictions.
- To enhance the accuracy of protein domain prediction for applications in functional genomics and molecular evolution.
Main Methods:
- Implemented a novel heaviest weighted clique-finding (HCF) algorithm for domain prediction.
- Developed a benchmark dataset using structural domain assignments from the CATH database and Hidden Markov Model (HMM) predictions.
- Allowed and resolved overlapping domain matches to improve prediction accuracy.
Main Results:
- The HCF approach demonstrated significantly higher prediction accuracy compared to the standard Best Match Cascade (BMC) method.
- Allowing overlapping domain matches was shown to be essential for identifying correct domain assignments.
- A straightforward protocol for resolving overlapping assignments was introduced, yielding a single set of non-overlapping predicted domains.
Conclusions:
- The heaviest weighted clique-finding (HCF) method offers a substantial improvement in predicting multi-domain protein architecture.
- The ability to handle overlapping domain predictions is critical for accurate domain assignment.
- The developed method and protocol provide a more reliable tool for analyzing protein domain structures and functions.
Related Concept Videos
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Conservation of Protein Domains
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
Protein Organization
The primary structure of a protein is its amino acid sequence.

