Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Graphing Antiderivatives

Graphing Antiderivatives

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

Ogive Graph

Ogive Graph

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

Bar Graph

Bar Graph

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

Time-Series Graph

Time-Series Graph

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

Multiple Bar Graph

Multiple Bar Graph

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

Recombinant DNA

Recombinant DNA

You might also read

Related Articles

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

Sort by

Same author

Replaying germinal center evolution on a quantified affinity landscape.

Cell·2026

Same author

Tree reconstruction guarantees from CRISPR-Cas9 lineage tracing data using Neighbor-Joining.

Genome research·2026

Same author

Hypervariable loop profiling decodes sequence determinants of antibody stability.

Nature structural & molecular biology·2026

Same author

Inference of germinal center evolutionary dynamics via simulation-based deep learning.

eLife·2026

Same author

Separating selection from mutation in antibody language models.

eLife·2026

Same author

Mapping cis-regulatory mutations at scale in sorghum enables modulation of gene expression.

Nature biotechnology·2026

Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

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

Same journal

Investigations on Multiple Protein Scaffold Filling.

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

Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

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

Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

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

Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

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

Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

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

See all related articles

Search research articles

Related Experiment Video

Updated: Jan 25, 2026

Subcloning Plus Insertion SPI - A Novel Recombineering Method for the Rapid Construction of Gene Targeting Vectors

Subcloning Plus Insertion SPI - A Novel Recombineering Method for the Rapid Construction of Gene Targeting Vectors

Published on: January 8, 2015

Constructing minimal ancestral recombination graphs.

Yun S Song¹, Jotun Hein

¹Department of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. song@stats.ox.ac.uk

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology

|March 16, 2005

Summary

This summary is machine-generated.

This study introduces a novel method for reconstructing evolutionary histories by minimizing recombination events. It accurately identifies local evolutionary relationships, outperforming methods that use single trees for entire loci.

More Related Videos

Recombineering Homologous Recombination Constructs in Drosophila

Recombineering Homologous Recombination Constructs in Drosophila

Published on: July 13, 2013

Recombinant Retroviral Production and Infection of B Cells

Recombinant Retroviral Production and Infection of B Cells

Published on: February 18, 2011

Related Experiment Videos

Last Updated: Jan 25, 2026

Subcloning Plus Insertion SPI - A Novel Recombineering Method for the Rapid Construction of Gene Targeting Vectors

Subcloning Plus Insertion SPI - A Novel Recombineering Method for the Rapid Construction of Gene Targeting Vectors

Published on: January 8, 2015

Recombineering Homologous Recombination Constructs in Drosophila

Recombineering Homologous Recombination Constructs in Drosophila

Published on: July 13, 2013

Recombinant Retroviral Production and Infection of B Cells

Recombinant Retroviral Production and Infection of B Cells

Published on: February 18, 2011

Area of Science:

Evolutionary biology
Computational biology
Bioinformatics

Background:

Reconstructing evolutionary histories is crucial for understanding genetic diversity.
Previous methods for detecting recombination often provide only estimated lower bounds.
Accurate inference of evolutionary relationships is challenged by recombination events.

Purpose of the Study:

To develop a method for constructing evolutionary histories with the minimum number of recombination events.
To introduce and evaluate a new lower bound for recombination events.
To assess the accuracy of site-specific evolutionary relationship recovery compared to single-tree methods.

Main Methods:

Viewing the ancestral recombination graph as a sequence of trees.
Developing an algorithm that uses specific rooted trees to guarantee minimum recombination events.
Defining and testing a new lower bound for recombination events using less constrained rooted trees.

Main Results:

The proposed method achieves the minimum number of recombination events when appropriate rooted trees are used.
The new lower bound demonstrates improvement over existing bounds.
The method shows higher accuracy in recovering local tree topologies than estimating recombination events.

Conclusions:

This approach offers a more accurate way to infer evolutionary histories, especially in the presence of recombination.
The method surpasses single-tree approaches in recovering site-specific evolutionary relationships.
The developed lower bound provides a better estimate for recombination events in evolutionary studies.