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

Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

394
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...
394
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
Graphing Antiderivatives01:30

Graphing Antiderivatives

52
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...
52
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

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

Algorithms for molecular biology : AMB·2026
Same author

ProQSAR: A modular and reproducible framework for small-data QSAR modeling with fit-and-use models.

Journal of cheminformatics·2026
Same author

SynRXN: An Open Benchmark and Curated Dataset for Computational Reaction Modeling.

Scientific data·2026
Same author

From Small Parsimony to Horizontal Gene Transfer: Inferring Horizontal Transfer and Gene Loss for Single-Origin Characters.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

Regulation of tRNA expression during the social cycle of the amoeba Dictyostelium discoideum.

BMC molecular and cell biology·2026
Same author

Computational Analysis of Telomerase RNA Evolution in <i>Caenorhabditis</i> Species.

Non-coding RNA·2026
Same journal

Phenotypic plasticity trade-offs in an age-structured model of bacterial growth under stress.

Journal of mathematical biology·2026
Same journal

Intraspecific interactions facilitate mutualism across multilayer networks under weak selection.

Journal of mathematical biology·2026
Same journal

A two-species competition model on a compact metric graph for the invasion and competition of Aedes Aegypti and Aedes Albopictus mosquitoes in Florida.

Journal of mathematical biology·2026
Same journal

Superinfection and the hypnozoite reservoir for Plasmodium vivax: a multitype branching process approximation.

Journal of mathematical biology·2026
Same journal

Correction to: Superinfection and the hypnozoite reservoir for Plasmodium vivax: a general framework.

Journal of mathematical biology·2026
Same journal

Stoichiometric balance and sustained rhythms.

Journal of mathematical biology·2026
See all related articles

Related Experiment Video

Updated: Jan 26, 2026

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

Best match graphs.

Manuela Geiß1,2, Edgar Chávez3, Marcos González Laffitte3

  • 1Bioinformatics Group, Department of Computer Science, University of Leipzig, Härtelstraße 16-18, 04107, Leipzig, Germany.

Journal of Mathematical Biology
|April 11, 2019
PubMed
Summary
This summary is machine-generated.

We introduce best match graphs (BMGs) for orthology detection. Our study characterizes BMGs, enabling efficient determination of their validity and reconstruction of the underlying gene tree.

Keywords:
Colored digraphHasse diagramHierarchyPhylogenetic combinatoricsReachable setsRooted triplesSupertrees

More Related Videos

Testing for Metacognitive Responding Using an Odor-based Delayed Match-to-Sample Test in Rats
08:06

Testing for Metacognitive Responding Using an Odor-based Delayed Match-to-Sample Test in Rats

Published on: June 18, 2018

7.6K
Fabrication of Refractive-index-matched Devices for Biomedical Microfluidics
09:54

Fabrication of Refractive-index-matched Devices for Biomedical Microfluidics

Published on: September 10, 2018

8.0K

Related Experiment Videos

Last Updated: Jan 26, 2026

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
Testing for Metacognitive Responding Using an Odor-based Delayed Match-to-Sample Test in Rats
08:06

Testing for Metacognitive Responding Using an Odor-based Delayed Match-to-Sample Test in Rats

Published on: June 18, 2018

7.6K
Fabrication of Refractive-index-matched Devices for Biomedical Microfluidics
09:54

Fabrication of Refractive-index-matched Devices for Biomedical Microfluidics

Published on: September 10, 2018

8.0K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Best match graphs (BMGs) are crucial intermediates in orthology detection algorithms.
  • BMGs represent relationships between genes across species based on evolutionary relatedness.

Purpose of the Study:

  • To characterize best match graphs (BMGs).
  • To develop efficient algorithms for validating BMGs and reconstructing gene trees.

Main Methods:

  • Graph theory applied to phylogenetic trees.
  • Algorithmic analysis for time and space complexity.
  • Tree reconstruction techniques.

Main Results:

  • Characterization of best match graphs.
  • A cubic-time algorithm to decide if a BMG is derivable from a gene tree and species assignment.
  • Construction of the unique least resolved tree explaining a valid BMG in cubic time.

Conclusions:

  • Best match graphs can be rigorously analyzed and validated computationally.
  • Efficient algorithms exist for BMG validation and gene tree reconstruction, advancing orthology detection.