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

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Decision Making: P-value Method01:09

Decision Making: P-value Method

The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim  is also stated. These statements can act as null and alternative hypotheses:  a null hypothesis would be a neutral statement while the alternative hypothesis can have a...
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
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

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...
Mechanistic Models: Compartment Models in Individual and Population Analysis01:23

Mechanistic Models: Compartment Models in Individual and Population Analysis

Mechanistic models are utilized in individual analysis using single-source data, but imperfections arise due to data collection errors, preventing perfect prediction of observed data. The mathematical equation involves known values (Xi), observed concentrations (Ci), measurement errors (εi), model parameters (ϕj), and the related function (ƒi) for i number of values. Different least-squares metrics quantify differences between predicted and observed values. The ordinary least squares (OLS)...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

You might also read

Related Articles

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

Sort by
Same author

Optimization of Immune Checkpoint Blockade via a Multiscale Model System.

Computational and systems oncology·2025
Same author

Opportunities for machine learning and artificial intelligence in physiologically-based pharmacokinetic (PBPK) modeling.

Advanced drug delivery reviews·2025
Same author

Per-Event Uncertainty Quantification for Flow Cytometry Using Calibration Beads.

Cytometry. Part A : the journal of the International Society for Analytical Cytology·2025
Same author

Uncertainty Quantification of Fluorescence Signals in Flow Cytometry Part I: An Analytical Perspective Beyond Q and B.

Cytometry. Part A : the journal of the International Society for Analytical Cytology·2025
Same author

Probabilistic Modeling of Antibody Kinetics Post Infection and Vaccination: A Markov Chain Approach.

ArXiv·2025
Same author

Optimal bandwidth selection in stochastic regression of Bio-FET measurements.

Journal of mathematical biology·2025
Same journal

Statistically consistent identification of differentially expressed genes in DNA chip data over the whole expression range: relative variance method.

Applied bioinformatics·2006
Same journal

A nonparametric likelihood ratio test to identify differentially expressed genes from microarray data.

Applied bioinformatics·2006
Same journal

Simulation study of ratio calculation formulae of two-colour cDNA microarray data.

Applied bioinformatics·2006
Same journal

Alternative mRNA polyadenylation can potentially affect detection of gene expression by affymetrix genechip arrays.

Applied bioinformatics·2006
Same journal

Comparisons of annotation predictions for affymetrix GeneChips.

Applied bioinformatics·2006
Same journal

Ontology annotation treebrowser : an interactive tool where the complementarity of medical subject headings and gene ontology improves the interpretation of gene lists.

Applied bioinformatics·2006
See all related articles

Related Experiment Video

Updated: Jun 29, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 6, 2014

Constructing sequence alignments from a Markov decision model with estimated parameter values.

Fern Y Hunt1, Anthony J Kearsley, Agnes O'Gallagher

  • 1Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, USA. hunt@nist.gov

Applied Bioinformatics
|February 8, 2005
PubMed
Summary
This summary is machine-generated.

This study introduces linear programming (LP) methods for biological sequence alignment, offering a more efficient alternative to traditional dynamic programming for large datasets. The new approach models alignment as a controlled Markov chain to minimize computational costs.

More Related Videos

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Related Experiment Videos

Last Updated: Jun 29, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 6, 2014

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Operations Research

Background:

  • Traditional biological sequence alignment relies on dynamic programming, which is computationally intensive for large or long sequences.
  • High computational costs in memory and CPU time limit the scalability of current alignment methods.

Purpose of the Study:

  • To explore the application of large-scale linear programming (LP) methods for biological sequence alignment.
  • To develop a novel approach that reduces the computational burden associated with aligning extensive biological sequence datasets.

Main Methods:

  • Formulating sequence alignment as a controlled Markov chain process.
  • Constructing a linear programming (LP) problem to minimize the expected total alignment cost.
  • Solving the LP problem using a primal-dual interior point method.

Main Results:

  • Demonstrated the feasibility of using LP for sequence alignment.
  • Presented alignments generated by the LP method for various cost function parameters.
  • Showcased a computationally efficient alternative to dynamic programming for sequence alignment.

Conclusions:

  • Linear programming offers a scalable and efficient approach to biological sequence alignment.
  • The proposed Markov chain-based LP model provides a viable alternative for handling large-scale alignment tasks.
  • Further exploration of cost function parameters can yield diverse and optimized alignment solutions.