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

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
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...

You might also read

Related Articles

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

Sort by
Same author

Machine Learning-Based Risk Stratification for Symptomatic Intracranial Hemorrhage and 3-month Prognosis Following Intravenous Thrombolysis.

Cerebrovascular diseases extra·2026
Same author

Correction: Gender differences in gut microbiome composition between schizophrenia patients with normal body weight and central obesity.

Frontiers in psychiatry·2026
Same author

Variation in anti-SARS-CoV-2 spike antibody responses by variants in patients with severe mental illness after COVID-19 vaccination.

Brain, behavior, and immunity·2025
Same author

Deep learning models for early and accurate diagnosis of ventilator-associated pneumonia in mechanically ventilated neonates.

Computers in biology and medicine·2025
Same author

Risk Factors for Gout in Taiwan Biobank: A Machine Learning Approach.

Journal of inflammation research·2024
Same author

Privacy-Centric AI and IoT Solutions for Smart Rural Farm Monitoring and Control.

Sensors (Basel, Switzerland)·2024
Same journal

Resveratrol Mitigates Noise-Induced Cochlear Damage and Delays Hearing Loss in Wistar Rats.

BioMed research international·2026
Same journal

RETRACTION: Green Fabrication of Silver Nanoparticles Using Euphorbia Serpens Kunth Aqueous Extract, their Characterization, and Investigation of its in Vitro Antioxidative, Antimicrobial, Insecticidal, and Cytotoxic Activities.

BioMed research international·2026
Same journal

Predictors of Prolonged Hospital Length of Stay in Patients With Odontogenic Infections in Ghana.

BioMed research international·2026
Same journal

Traditional Chinese Medicine Bone-Setting Techniques Research Progress for the Treatment of Knee Osteoarthritis.

BioMed research international·2026
Same journal

RETRACTION: miR-375 Inhibits the Proliferation and Invasion of Nasopharyngeal Carcinoma Cells by Suppressing PDK1.

BioMed research international·2026
Same journal

Exploring the Therapeutic Potential of Nobiletin in Nonsmall Cell Lung Cancer.

BioMed research international·2026
See all related articles

Related Experiment Videos

GPU-based cloud service for Smith-Waterman algorithm using frequency distance filtration scheme.

Sheng-Ta Lee1, Chun-Yuan Lin, Che Lun Hung

  • 1Department of Computer Science and Information Engineering, Chang Gung University, No. 259 Sanmin Road, Guishan, Taoyuan 33302, Taiwan.

Biomed Research International
|May 9, 2013
PubMed
Summary
This summary is machine-generated.

This study introduces a faster Smith-Waterman algorithm using GPU computing and a filtration method. The novel CUDA-SWf approach significantly reduces computation time for sequence similarity searches.

Related Experiment Videos

Area of Science:

  • Bioinformatics
  • Computational Biology
  • High-Performance Computing

Background:

  • The Smith-Waterman algorithm is essential for sensitive sequence similarity analysis.
  • Its computational intensity limits large-scale database searches.
  • Graphics Processing Units (GPUs) offer parallel processing capabilities to accelerate computations.

Purpose of the Study:

  • To develop an optimized Smith-Waterman algorithm for efficient sequence similarity searching.
  • To reduce computational time by filtering unnecessary comparisons on GPUs.
  • To create a user-friendly interface for cloud-based GPU applications.

Main Methods:

  • Implementation of a novel frequency-based filtration method integrated with the Smith-Waterman algorithm on GPUs (CUDA-SWf).
  • Utilized CUDA programming for parallel computation on graphics processing units.
  • Tested with H1N1 protein sequences against a human protein database.

Main Results:

  • The CUDA-SWf algorithm demonstrated improved computational efficiency compared to standard CUDA-SW.
  • Unnecessary sequence alignments were effectively reduced, leading to significant time savings.
  • Computational time was improved by up to 41% through the filtration method.

Conclusions:

  • The frequency-based filtration method enhances the performance of GPU-accelerated Smith-Waterman algorithm.
  • CUDA-SWf provides a scalable and efficient solution for large-scale sequence similarity searches.
  • The cloud service accessibility removes time and computational constraints for users.