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

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Algebraic Expressions01:26

Algebraic Expressions

Algebraic expressions are essential in mathematics. They represent relationships through variables, constants, and operations. These expressions help describe patterns and solve problems in various mathematical fields. Understanding their components, classifications, and operations allows for efficient simplification and manipulation.Each algebraic expression consists of individual parts, including numbers and symbols, that work together to form meaningful mathematical statements. The numerical...
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Relative Motion Analysis - Velocity01:24

Relative Motion Analysis - Velocity

A stroke engine has a slider-crank mechanism that converts rotational motion from the crank into linear motion of the slider or vice versa. This mechanism consists of three main parts: the crank, the connecting rod, and the slider.
When an external force is exerted, it sets the crank into a rotational movement. This, in turn, instigates the motion of the connecting rod, leading to what is referred to as a general plane motion. This process involves two key points - point A on the connecting rod...
Rational Expressions01:28

Rational Expressions

Rational expressions are algebraic fractions in which both the numerator and the denominator are polynomials. These expressions follow the arithmetic rules of numerical fractions but require extra care due to the presence of variables. A fundamental part of working with rational expressions is identifying values that make the expression undefined, typically those that result in division by zero or undefined radicals.Determining the DomainThe domain of a rational expression includes all real...

You might also read

Related Articles

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

Sort by
Same author

We wait for disease to shout-What if we listened when biology whispered?

Cell systems·2026
Same author

The ADAPT learning cancer treatment system: ARPA-H's initiative to revolutionize cancer therapy.

Cancer cell·2026
Same author

A lifespan clock tells the biology of time.

Nature medicine·2025
Same author

Bile acids segregate metabolic syndrome in a cohort of 100 deeply phenotyped horses.

Communications biology·2025
Same author

Design and validation of a clinical whole genome sequencing-based assay for patient screening in a large healthcare system.

Frontiers in molecular biosciences·2025
Same author

Early Detection of Wellness-to-Disease Transitions in the AI Era: Implications for Pharmacology and Toxicology.

Annual review of pharmacology and toxicology·2025
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026
Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026
Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026
Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Jun 5, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Graphics processing unit implementations of relative expression analysis algorithms enable dramatic computational

Andrew T Magis1, John C Earls, Youn-Hee Ko

  • 1Department of Computer Science, University of Illinois, Urbana, IL 61801, USA.

Bioinformatics (Oxford, England)
|January 25, 2011
PubMed
Summary
This summary is machine-generated.

Graphics processing unit (GPU) acceleration dramatically speeds up classification algorithms like top-scoring pair (TSP) and top-scoring triplet (TST) for analyzing gene expression data. This advancement enables comprehensive analysis of large transcriptome datasets, accelerating biological discovery.

More Related Videos

Automated Analysis of Dynamic Ca2+ Signals in Image Sequences
06:49

Automated Analysis of Dynamic Ca2+ Signals in Image Sequences

Published on: June 16, 2014

Related Experiment Videos

Last Updated: Jun 5, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Automated Analysis of Dynamic Ca2+ Signals in Image Sequences
06:49

Automated Analysis of Dynamic Ca2+ Signals in Image Sequences

Published on: June 16, 2014

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Top-scoring pair (TSP) and top-scoring triplet (TST) algorithms are effective for classification using gene expression data.
  • Analyzing large-scale human transcriptome samples with these methods is computationally demanding.
  • Previous analysis has not encompassed all combinations for TST across extensive datasets.

Purpose of the Study:

  • To enhance the computational efficiency of TSP and TST algorithms.
  • To enable comprehensive analysis of human transcriptome data.
  • To accelerate the discovery process in gene expression studies.

Main Methods:

  • Implementation of TSP and TST algorithms on graphics processing units (GPUs).
  • Leveraging GPU parallel processing capabilities for significant speedup.
  • Analysis of thousands of human transcriptome samples.

Main Results:

  • Achieved a speedup of two orders of magnitude for TSP and TST algorithms.
  • Dramatically increased the number of searchable combinations.
  • Facilitated previously infeasible analyses of large datasets.

Conclusions:

  • GPU implementation makes TSP and TST algorithms highly efficient for large-scale transcriptome analysis.
  • The accelerated computation significantly broadens the scope of possible discoveries.
  • This advancement paves the way for more extensive and rapid research in gene expression classification.