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

Distance Corrections01:15

Distance Corrections

238
To achieve precise distance measurements, especially in surveying and construction, certain corrections must be applied to account for potential sources of error like the standardization errors, temperature variations, and slope adjustments.Standardization error emerges when measurement equipment undergoes changes, such as wear, repairs, or weather impacts. To address this, surveyors compare the equipment’s readings to a standard. This process identifies any deviation that might lead to...
238
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

4.5K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
4.5K
The Distance Formula01:20

The Distance Formula

512
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
512
Transmission-Line Differential Equations01:26

Transmission-Line Differential Equations

912
Transmission lines are essential components of electrical power systems. They are characterized by the distributed nature of resistance (R), inductance (L), and capacitance (C) per unit length. To analyze these lines, differential equations are employed to model the variations in voltage and current along the line.
Line Section Model
A circuit representing a line section of length Δx helps in understanding the transmission line parameters. The voltage V(x) and current i(x) are measured from...
912
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

8.8K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
8.8K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

1.1K
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
1.1K

You might also read

Related Articles

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

Sort by
Same author

Pairwise Distances and the Problem of Multiple Optima.

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

xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes.

BMC bioinformatics·2023
Same author

Tree Reconciliation Methods for Host-Symbiont Cophylogenetic Analyses.

Life (Basel, Switzerland)·2022
Same author

A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks.

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

Maximum parsimony reconciliation in the DTLOR model.

BMC bioinformatics·2021
Same author

eMPRess: a systematic cophylogeny reconciliation tool.

Bioinformatics (Oxford, England)·2020

Related Experiment Video

Updated: Jan 1, 2026

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma
15:07

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma

Published on: December 28, 2015

27.2K

An efficient exact algorithm for computing all pairwise distances between reconciliations in the

Santi Santichaivekin1, Ross Mawhorter1, Ran Libeskind-Hadas2

  • 1Department of Computer Science, Harvey Mudd College, Claremont, CA, US.

BMC Bioinformatics
|December 18, 2019
PubMed
Summary
This summary is machine-generated.

Understanding the space of maximum parsimony reconciliations is crucial for evolutionary studies. This research presents an efficient algorithm to compute pairwise distances, offering new insights into reconciliation structures for gene and species evolution.

Keywords:
Duplication-transfer-loss modelMaximum parsimony reconciliationPhylogenetic trees

More Related Videos

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.9K
Author Spotlight: Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Author Spotlight: Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

1.8K

Related Experiment Videos

Last Updated: Jan 1, 2026

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma
15:07

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma

Published on: December 28, 2015

27.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.9K
Author Spotlight: Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Author Spotlight: Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

1.8K

Area of Science:

  • Computational Biology
  • Evolutionary Biology
  • Bioinformatics

Background:

  • Maximum parsimony reconciliation is vital for analyzing evolutionary histories of genes, species, parasites, and symbionts.
  • Existing algorithms efficiently find reconciliations, but the sheer number can be exponential, necessitating an understanding of the reconciliation space.
  • Determining if a single reconciliation suffices or if multiple are needed requires deeper insight into this space.

Purpose of the Study:

  • To develop an efficient algorithm for computing the distribution of pairwise distances in maximum parsimony reconciliation.
  • To provide a method for characterizing the space of maximum parsimony reconciliations.
  • To offer new insights into the structure of reconciliation spaces.

Main Methods:

  • Developed and described an efficient polynomial-time algorithm.
  • The algorithm computes the exact distribution of pairwise distances for any reconciliation problem instance.
  • Analyzed the algorithm's asymptotic worst-case running time.

Main Results:

  • An efficient polynomial-time algorithm was developed to compute the distribution of pairwise distances.
  • The algorithm is exact for multiple distance metrics.
  • Demonstrated the algorithm's utility and viability on a large biological dataset.

Conclusions:

  • The study provides novel insights into the structure of the space of maximum parsimony reconciliations.
  • These findings are valuable for various applications utilizing reconciliation methods in evolutionary and coevolutionary studies.