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

Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

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...
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

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 DNA...
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...
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...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
DNA Base Pairing02:27

DNA Base Pairing

Erwin Chargaff’s rules on DNA equivalence paved the way for the discovery of base pairing in DNA. Chargaff’s rules state that in a double-stranded DNA molecule,

You might also read

Related Articles

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

Sort by
Same author

PropMolFlow: property-guided molecule generation with geometry-complete flow matching.

Nature computational science·2026
Same author

TraverseNet: Unifying Space and Time in Message Passing for Traffic Forecasting.

IEEE transactions on neural networks and learning systems·2022
Same author

A knowledge graph of clinical trials ([Formula: see text]).

Scientific reports·2022
Same author

Benchmarking Accuracy and Generalizability of Four Graph Neural Networks Using Large In Vitro ADME Datasets from Different Chemical Spaces.

Molecular informatics·2022
Same author

DGL-LifeSci: An Open-Source Toolkit for Deep Learning on Graphs in Life Science.

ACS omega·2021
Same author

Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning.

IEEE transactions on neural networks and learning systems·2021

Related Experiment Video

Updated: May 9, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Pareto optimal pairwise sequence alignment.

Kevin W DeRonne1, George Karypis

  • 1Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA.

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|August 10, 2013
PubMed
Summary
This summary is machine-generated.

This study introduces an efficient algorithm for generating Pareto optimal pairwise alignments using multiple profile scoring functions. The new method significantly speeds up the process while yielding high-quality protein alignments.

More Related Videos

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

Self-Assembly of Gamma-Modified Peptide Nucleic Acids into Complex Nanostructures in Organic Solvent Mixtures
08:15

Self-Assembly of Gamma-Modified Peptide Nucleic Acids into Complex Nanostructures in Organic Solvent Mixtures

Published on: June 26, 2020

Related Experiment Videos

Last Updated: May 9, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

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

Self-Assembly of Gamma-Modified Peptide Nucleic Acids into Complex Nanostructures in Organic Solvent Mixtures
08:15

Self-Assembly of Gamma-Modified Peptide Nucleic Acids into Complex Nanostructures in Organic Solvent Mixtures

Published on: June 26, 2020

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Structural Bioinformatics

Background:

  • Protein sequence alignment is crucial for understanding protein function and evolution.
  • Evolutionary profiles are widely used in protein sequence alignment.
  • Existing profile-profile scoring functions lack comprehensive Pareto optimal analysis for combined use.

Purpose of the Study:

  • To develop an efficient algorithm for generating Pareto optimal pairwise alignments by combining multiple profile scoring functions.
  • To investigate the optimal substructure property in generating Pareto optimal pairwise alignments.
  • To evaluate the performance of combined scoring functions compared to single functions.

Main Methods:

  • Developed a dynamic-programming-based heuristic algorithm to generate approximated Pareto optimal frontiers.
  • Utilized all combinations of two, three, and four profile scoring functions from a pool of 11.
  • Tested the algorithm on the ce_ref dataset (588 protein pairs) and validated on the BAliBASE RV11 dataset (913 protein pairs).

Main Results:

  • The heuristic algorithm efficiently generates approximated Pareto optimal frontiers, achieving comparable results to exact frontiers.
  • The approach significantly reduces computation time, especially for four objectives (over 58 times faster on average).
  • Alignments within Pareto frontiers demonstrate superior quality compared to those from single objective functions.

Conclusions:

  • The developed algorithm provides an efficient method for exploring Pareto optimal pairwise alignments.
  • Combining multiple profile scoring functions enhances alignment quality.
  • Identifying the single best alignment from a Pareto frontier remains a challenge.