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

Microtubule Associated Proteins (MAPs)01:42

Microtubule Associated Proteins (MAPs)

5.8K
Microtubule function and architecture are regulated by an array of specialized proteins called microtubule-associated proteins or MAPs. These proteins are widespread across different organisms and have conserved protein motifs, like the multi-TOG domain for tubulin binding found in the CLASP family of MAPs. Some MAPs are lineage-specific based on their conserved domains. Their functions depend upon the cytoskeletal architecture and cell type they are located within. In-plant cells, a specific...
5.8K
Contact-dependent Signaling01:19

Contact-dependent Signaling

46.9K
Contact-dependent signaling, as the name suggests, requires that communicating cells be in direct contact with each other. This is achieved either through receptor-ligand interactions or by specialized cytoplasmic channels that allow the flow of small molecules between cells. In animal cells, channels called gap junctions facilitate contact-dependent signaling in certain tissues, whereas, plasmodesmata perform a similar function in plants.
Gap Junctions
In animal cells, gap junctions are formed...
46.9K
Protein Networks02:26

Protein Networks

4.5K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
Predicting Molecular Geometry02:27

Predicting Molecular Geometry

45.5K
VSEPR Theory for Determination of Electron Pair Geometries
45.5K
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

403
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
403
Contact Angle01:13

Contact Angle

18.3K
When a solid is dipped inside a liquid, the liquid surface becomes curved near the contact. For some solid–liquid interfaces, the liquid is pulled up along the solid, while for others, the liquid surface is convex or depressed near the solid surface. This phenomenon can be explained using the concept of cohesive and adhesive forces.
The adhesive force is the molecular force between molecules of different materials, that is, between the molecules of the solid and the liquid. The cohesive...
18.3K

You might also read

Related Articles

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

Sort by
Same author

Immediate and Mid-Long-Term Effects of Foot Orthoses on Gait Biomechanics and Clinical Characteristics in Medial Knee Osteoarthritis: A Systematic Review and Meta-analysis.

Annals of biomedical engineering·2026
Same author

Advancing Conservative Treatment of Knee Osteoarthritis: 3D-Printed Shoe Soles for Passive Toe-Out Gait Modification.

Journal of foot and ankle research·2026
Same author

Pose-aware deep perceptual similarity for iterative 2D/3D registration of knee joints using contrastive learning.

International journal of computer assisted radiology and surgery·2026
Same author

Passive Laxity in Patients With Subjective Instability Following a Cruciate-Retaining Total Knee Arthroplasty: A Pilot Study.

JB & JS open access·2026
Same author

Enhanced Molecular Staging of Pancreatic Cancer Using Methylated DNA Markers in Peritoneal Lavage Fluid.

Journal of surgical oncology·2026
Same author

Can we identify which patients are likely to have septic arthritis with borderline synovial fluid cell counts?

Journal of bone and joint infection·2026
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Jan 24, 2026

Author Spotlight: Streamlining Protein Target Prediction and Validation via Molecular Docking and CETSA
10:21

Author Spotlight: Streamlining Protein Target Prediction and Validation via Molecular Docking and CETSA

Published on: February 23, 2024

3.7K

An algorithm to parse segment packing in predicted protein contact maps.

William R Taylor1

  • 1Francis Crick Institute, 1 Midland Rd, London, NW1 1AT UK.

Algorithms for Molecular Biology : AMB
|June 23, 2016
PubMed
Summary
This summary is machine-generated.

A new dynamic programming algorithm analyzes protein contact maps to predict residue interactions. This method accurately identifies structural contacts, aiding in protein tertiary structure prediction for larger and noisier datasets.

Keywords:
Contact matrix parsingCorrelated substitution analysisFrozen approximation algorithmProtein structure prediction

More Related Videos

Brain Infarct Segmentation and Registration on MRI or CT for Lesion-symptom Mapping
10:25

Brain Infarct Segmentation and Registration on MRI or CT for Lesion-symptom Mapping

Published on: September 25, 2019

49.3K
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

69.7K

Related Experiment Videos

Last Updated: Jan 24, 2026

Author Spotlight: Streamlining Protein Target Prediction and Validation via Molecular Docking and CETSA
10:21

Author Spotlight: Streamlining Protein Target Prediction and Validation via Molecular Docking and CETSA

Published on: February 23, 2024

3.7K
Brain Infarct Segmentation and Registration on MRI or CT for Lesion-symptom Mapping
10:25

Brain Infarct Segmentation and Registration on MRI or CT for Lesion-symptom Mapping

Published on: September 25, 2019

49.3K
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

69.7K

Area of Science:

  • Computational biology
  • Structural bioinformatics
  • Protein structure prediction

Background:

  • Correlation analysis in alignments generates contact maps, suggesting residue proximity and co-evolution.
  • Residue contacts in 3D structures are a primary driver of selection pressure.
  • A dynamic programming algorithm was developed to parse secondary structure interactions within these contact maps.

Purpose of the Study:

  • To develop a computational method for analyzing predicted contact maps.
  • To parse secondary structure interactions using dynamic programming.
  • To improve the accuracy of protein tertiary structure prediction.

Main Methods:

  • A dynamic programming algorithm was employed.
  • An iterated approach with a "frozen approximation" was utilized.
  • The algorithm was tested on transmembrane and globular protein classes.

Main Results:

  • The algorithm effectively parsed secondary structure interactions in contact maps.
  • It demonstrated robustness in transmembrane proteins, even with degraded signals.
  • It accurately classified key interactions in globular proteins, including complex cases.

Conclusions:

  • The developed method shows promise as a pre-processor for coarse-grained modeling.
  • It can extend protein tertiary structure prediction to larger proteins.
  • It enables the use of 'noisy' data currently unsuitable for residue-based methods.