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

10.5K
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...
10.5K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

622
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
622
Conservation of Protein Domains Over Different Proteins02:26

Conservation of Protein Domains Over Different Proteins

11.7K
Protein domains are small structurally independent units that are part of a single amino acid chain.  Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
11.7K
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

3.3K
Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
3.3K
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

590
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
590
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

You might also read

Related Articles

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

Sort by
Same author

Convolutional neural network based data interpretable framework for Alzheimer's treatment planning.

Visual computing for industry, biomedicine, and art·2024
Same author

An Interpretable Framework for Identifying Cerebral Microbleeds and Alzheimer's Disease Severity using Multimodal Data.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2023
Same author

Image Defogging Framework Using Segmentation and the Dark Channel Prior.

Entropy (Basel, Switzerland)·2021
Same author

Use Of Steroids In Rhinoplasty With Lateral Osteotomies For Reducing Post Operative Oedema.

Journal of Ayub Medical College, Abbottabad : JAMC·2018
Same author

Hidden Markov model and Chapman Kolmogrov for protein structures prediction from images.

Computational biology and chemistry·2017
Same author

StrucBreak: A Computational Framework for Structural Break Detection in DNA Sequences.

Interdisciplinary sciences, computational life sciences·2016

Related Experiment Video

Updated: Apr 25, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

9.6K

Performance evaluation of Warshall algorithm and dynamic programming for Markov chain in local sequence alignment.

Mohammad Ibrahim Khan1, Md Sarwar Kamal

  • 1Department of Computer Science & Engineering., Chittagong University of Engineering and Technology, Chittagong, 4349, Bangladesh.

Interdisciplinary Sciences, Computational Life Sciences
|August 15, 2014
PubMed
Summary

Markov chains, using the Chapman-Kolmogorov equation, predict DNA sequences. Dynamic programming excels for long sequences, while Warshall algorithm is better for short ones.

More Related Videos

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.2K
Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

3.0K

Related Experiment Videos

Last Updated: Apr 25, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

9.6K
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.2K
Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

3.0K

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomic Data Analysis

Background:

  • DNA sequencing analysis requires predicting nucleotide existence based on historical data.
  • Markov chains offer effective prediction for sequential datasets like DNA.

Purpose of the Study:

  • To apply the Chapman-Kolmogorov equation for Markov chain-based DNA sequence prediction.
  • To evaluate Warshall Algorithm and Dynamic Programming for DNA segment scoring.

Main Methods:

  • Utilized the Chapman-Kolmogorov equation for Markov chain analysis.
  • Implemented Warshall Algorithm (WA) and Dynamic Programming (DP) for DNA segment scoring.

Main Results:

  • Warshall Algorithm demonstrates efficacy for small DNA sequences.
  • Dynamic Programming proves more suitable for long DNA sequences.
  • Identified the importance of measuring local sequencing risk factors in alignments.

Conclusions:

  • The Chapman-Kolmogorov equation is a powerful tool for DNA sequence analysis.
  • Algorithm choice (WA vs. DP) depends on DNA sequence length for optimal scoring.
  • Assessing local sequencing risks is crucial for accurate sequence alignment.