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

Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

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 organic...
Distance Problem01:29

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
The Distance Formula01:20

The Distance Formula

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...
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...
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

Kendall's Coefficient of Concordance (W), also known as Kendall's W, is a non-parametric statistical measure used to assess the agreement or concordance between multiple raters or judges when they rank a set of items. It is often used when you have ordinal data (ranks) and you want to see if there is consistency or consensus among the raters. It is widely applied in research areas such as psychology, medicine, and social sciences, where multiple judges are asked to rank or rate subjects or...
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...

You might also read

Related Articles

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

Sort by
Same author

Hyperfine aperiodic optical superlattice optimized by iterative domino algorithm for phase-matching engineering.

Optics letters·2012
See all related articles

Related Experiment Video

Updated: May 23, 2026

Easy Measurement of Diffusion Coefficients of EGFP-tagged Plasma Membrane Proteins Using k-Space Image Correlation Spectroscopy
11:43

Easy Measurement of Diffusion Coefficients of EGFP-tagged Plasma Membrane Proteins Using k-Space Image Correlation Spectroscopy

Published on: May 10, 2014

The k partition-distance problem.

Yen Hung Chen1

  • 1Department of Computer Science, Taipei Municipal University of Education, Taipei, Taiwan, ROC. yhchen@tmue.edu.tw

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|April 4, 2012
PubMed
Summary

This study introduces the first heuristic and approximation algorithms for the NP-complete k partition-distance problem in bioinformatics. These algorithms efficiently find consensus partitions by minimizing element deletions, offering solutions within twice the optimal distance.

More Related Videos

Determination of Plasma Membrane Partitioning for Peripherally-associated Proteins
11:11

Determination of Plasma Membrane Partitioning for Peripherally-associated Proteins

Published on: June 15, 2018

Related Experiment Videos

Last Updated: May 23, 2026

Easy Measurement of Diffusion Coefficients of EGFP-tagged Plasma Membrane Proteins Using k-Space Image Correlation Spectroscopy
11:43

Easy Measurement of Diffusion Coefficients of EGFP-tagged Plasma Membrane Proteins Using k-Space Image Correlation Spectroscopy

Published on: May 10, 2014

Determination of Plasma Membrane Partitioning for Peripherally-associated Proteins
11:11

Determination of Plasma Membrane Partitioning for Peripherally-associated Proteins

Published on: June 15, 2018

Area of Science:

  • Bioinformatics and Computational Biology
  • Data Mining and Machine Learning

Background:

  • Data partitioning, or clustering, is crucial in bioinformatics for analyzing biological data, such as DNA markers in organisms.
  • Comparing different partitions (consensus clustering) is essential but challenging, especially when dealing with multiple partitions.
  • The k partition-distance problem aims to find identical partitions by removing the minimum number of elements, a problem known to be NP-complete for k > 2.

Purpose of the Study:

  • To address the NP-complete k partition-distance problem by developing novel algorithmic solutions.
  • To design the first known heuristic and approximation algorithms with provable performance guarantees.
  • To present the first known exact algorithm for solving the k partition-distance problem.

Main Methods:

  • Developed heuristic and approximation algorithms with a time complexity of O(k·ρ·|N|), achieving performance ratios of 2.
  • Designed an exact algorithm with a time complexity of O(ℓ·2^ℓ·k^2·|N|^2), where ℓ is the optimal partition-distance.
  • Compared the performance of exact and approximation algorithms using simulated and real biological datasets (DNA markers).

Main Results:

  • The proposed heuristic and approximation algorithms provide solutions within twice the optimal partition-distance.
  • Experimental results demonstrate improved computational speed compared to existing methods for the two-partition problem.
  • The algorithms are effective for datasets with a maximum number of elements per cluster less than ρ.

Conclusions:

  • The developed algorithms offer efficient and theoretically sound solutions for the k partition-distance problem in bioinformatics.
  • These algorithms significantly advance the ability to compute consensus partitions from multiple data partitions.
  • An interactive web service is available for utilizing these algorithms, facilitating broader application in biological data analysis.