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 Concept Videos

Protein Organization01:24

Protein Organization

Proteins are polymers of amino acid residues. They are versatile and responsible for different cellular functions, including DNA replication, molecular transport, catalysis, and structural support. Proteins have a hierarchical structure comprising at least three levels of organization: primary, secondary, and tertiary structure. Some large proteins have a quaternary structure where individual protein subunits are linked together.
The primary structure of a protein is its amino acid sequence.
Protein Organization01:13

Protein Organization

Overview
Protein Organization01:24

Protein Organization

Proteins are polymers of amino acid residues. They are versatile and responsible for different cellular functions, including DNA replication, molecular transport, catalysis, and structural support. Proteins have a hierarchical structure comprising at least three levels of organization: primary, secondary, and tertiary structure. Some large proteins have a quaternary structure where individual protein subunits are linked together.
The primary structure of a protein is its amino acid sequence.
Protein Organization01:13

Protein Organization

Overview
Conservation of Protein Domains Over Different Proteins02:26

Conservation of Protein Domains Over Different Proteins

Protein domains are small structurally independent units that are part of a single amino acid chain.  Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
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 Domains02:26

Conservation of Protein Domains

Protein domains are small structurally independent units that are part of a single amino acid chain.  Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...

You might also read

Related Articles

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

Sort by
Same author

Retinal Transcriptomic Signatures in Sudden Acquired Retinal Degeneration Syndrome (SARDS) and Cancer-Associated Retinopathy (CAR).

Animals : an open access journal from MDPI·2026
Same author

Hyperbolic matrix factorization improves prediction of drug-target associations.

Scientific reports·2023
Same author

Overcoming Sparseness of Biomedical Networks to Identify Drug Repositioning Candidates.

IEEE/ACM transactions on computational biology and bioinformatics·2021
Same author

Heterogeneous Multi-Layered Network Model for Omics Data Integration and Analysis.

Frontiers in genetics·2020
Same author

Database of adverse events associated with drugs and drug combinations.

Scientific reports·2019
Same author

Mining FDA resources to compute population-specific frequencies of adverse drug reactions.

Proceedings. IEEE International Conference on Bioinformatics and Biomedicine·2018

Related Experiment Video

Updated: May 28, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

On complexity of protein structure alignment problem under distance constraint.

Aleksandar Poleksic1

  • 1University of Northern Iowa, Cedar Falls.

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|October 26, 2011
PubMed
Summary

This study enhances algorithms for the protein Largest Common Point-Set (LCP) problem using bottleneck distance. New methods significantly reduce computation time for finding optimal and near-optimal protein alignments.

More Related Videos

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

Related Experiment Videos

Last Updated: May 28, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Structural Biology

Background:

  • The Largest Common Point-Set (LCP) under Bottleneck Distance problem is crucial for comparing protein structures.
  • Existing algorithms for approximate and exact solutions have high computational complexity (O(n^8) and O(n^32)).

Purpose of the Study:

  • To improve the runtime efficiency of algorithms for the LCP under Bottleneck Distance problem.
  • To develop faster methods for both approximate and exact solutions, considering sequential and non-sequential alignments.

Main Methods:

  • Development of novel algorithms for protein structure alignment.
  • Focus on optimizing spatial superposition and point-pair matching under a distance cutoff (σ).
  • Analysis of computational complexity for sequential and non-sequential alignment scenarios.

Main Results:

  • Achieved significantly faster runtimes for near-optimal sequential alignments (O(n^7 log n)) and optimal sequential alignments (O(n^14 log n)).
  • Developed faster algorithms for non-sequential alignments, with runtimes of O(n^7.5) for near-optimal and O(n^14.5) for optimal solutions.
  • Demonstrated substantial runtime improvements over existing state-of-the-art methods.

Conclusions:

  • The proposed algorithms offer considerable speedups for solving the LCP under Bottleneck Distance problem.
  • These advancements facilitate more efficient and scalable analysis of protein structures and alignments.