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

Graphing Antiderivatives01:30

Graphing Antiderivatives

49
The concept of an antiderivative is fundamental in calculus, describing how a function's values accumulate over time. This process is closely related to physical motion, such as the movement of a rolling ball. As the ball progresses, its position changes in response to variations in velocity, just as an antiderivative graph reflects the cumulative effect of the original function's values.Graphing an antiderivative requires interpreting how a function's values influence the shape of its...
49
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

392
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
392
Ogive Graph01:07

Ogive Graph

6.7K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
6.7K
Bar Graph01:07

Bar Graph

21.5K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
21.5K
Time-Series Graph00:54

Time-Series Graph

5.0K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
5.0K
Multiple Bar Graph01:07

Multiple Bar Graph

9.0K
As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
9.0K

You might also read

Related Articles

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

Sort by
Same author

A comparative analysis of the foamy and ortho virus capsid structures reveals an ancient domain duplication.

BMC structural biology·2017
Same author

Molecular Models for the Core Components of the Flagellar Type-III Secretion Complex.

PloS one·2016
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 23, 2026

Author Spotlight: Enhancing Drug Discovery - Development of Automated, Standardized Protocols for Nuclei Extraction from Frozen Tissues
07:12

Author Spotlight: Enhancing Drug Discovery - Development of Automated, Standardized Protocols for Nuclei Extraction from Frozen Tissues

Published on: July 28, 2023

5.1K

Algorithms for matching partially labelled sequence graphs.

William R Taylor1

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

Algorithms for Molecular Biology : AMB
|October 13, 2017
PubMed
Summary
This summary is machine-generated.

This study introduces novel computational methods to accurately pair interacting protein paralogs in eukaryotes. These methods leverage evolutionary distances and phylogenetic trees to improve protein interaction prediction, overcoming limitations of genome co-location.

Keywords:
Bipartite graph matchingCorrelated substitution analysisPhylogenetic tree matching

More Related Videos

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

5.4K
Sequence-specific Labeling of Nucleic Acids and Proteins with Methyltransferases and Cofactor Analogues
12:07

Sequence-specific Labeling of Nucleic Acids and Proteins with Methyltransferases and Cofactor Analogues

Published on: November 22, 2014

14.4K

Related Experiment Videos

Last Updated: Jan 23, 2026

Author Spotlight: Enhancing Drug Discovery - Development of Automated, Standardized Protocols for Nuclei Extraction from Frozen Tissues
07:12

Author Spotlight: Enhancing Drug Discovery - Development of Automated, Standardized Protocols for Nuclei Extraction from Frozen Tissues

Published on: July 28, 2023

5.1K
Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

5.4K
Sequence-specific Labeling of Nucleic Acids and Proteins with Methyltransferases and Cofactor Analogues
12:07

Sequence-specific Labeling of Nucleic Acids and Proteins with Methyltransferases and Cofactor Analogues

Published on: November 22, 2014

14.4K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Evolutionary Biology

Background:

  • Predicting protein-protein interactions is crucial for understanding biological processes.
  • Matching interacting protein sequences, especially paralogs within species, is challenging in eukaryotes.
  • Genome co-location, useful in bacteria, is insufficient for eukaryotic paralog pairing.

Purpose of the Study:

  • To develop and test computational methods for pairing interacting protein paralogs in eukaryotes.
  • To address the difficulty of matching paralogs when unique identifiers are absent.
  • To improve the prediction of protein interactions using evolutionary relationships.

Main Methods:

  • Developed graph-based methods using evolutionary distances between paralogs and unique proteins (singletons).
  • Tested two variants: a topology-based method using phylogenetic trees and a distance-based method.
  • Utilized sequence data to infer evolutionary relationships for paralog pairing.

Main Results:

  • Both developed methods successfully paired interacting protein paralogs.
  • The topology-based method showed slightly better performance than the distance-based method.
  • The methods demonstrated effectiveness across a set of test proteins.

Conclusions:

  • The developed methods offer a promising approach for eukaryotic protein interaction prediction.
  • Future refinements may incorporate additional data like known interactions and genomic context.
  • These methods aim to enable the use of vast eukaryotic genomic data for interaction studies.