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

Understanding Memory01:19

Understanding Memory

1.8K
Memory is the retention of information or experiences over time, facilitated through three main processes: encoding, storage, and retrieval. Encoding is the process of inputting information into the memory system. For instance, when listening to a lecture, watching a play, reading a book, or having a conversation, the brain is actively encoding information. This initial stage involves transforming sensory input into a form that can be processed and stored by the brain. Various factors, such as...
1.8K
Multimachine Stability01:25

Multimachine Stability

624
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
624
Biasing of FET01:22

Biasing of FET

928
Biasing a Junction Field Effect Transistor (JFET) is crucial for setting operational parameters and ensuring efficient functioning in electronic circuits. JFETs are characterized by using a single carrier type in N-channel or P-channel configurations, where the channel is surrounded by PN junctions. These junctions are central to the device's ability to control current flow.
In an N-channel JFET, the structure consists of N-type material forming the channel on a P-type substrate, with the...
928
Buffer Effectiveness02:19

Buffer Effectiveness

58.2K
Buffer solutions do not have an unlimited capacity to keep the pH relatively constant . Instead, the ability of a buffer solution to resist changes in pH relies on the presence of appreciable amounts of its conjugate weak acid-base pair. When enough strong acid or base is added to substantially lower the concentration of either member of the buffer pair, the buffering action within the solution is compromised.
The buffer capacity is the amount of acid or base that can be added to a given volume...
58.2K

You might also read

Related Articles

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

Sort by
Same author

DiagnoDating: diagnostics for dated phylogenies in microbial population genetics.

Molecular biology and evolution·2026
Same author

Singletrack: an algorithm for improving memory consumption and performance of gap-affine sequence alignment.

Bioinformatics (Oxford, England)·2026
Same author

Adaptive Tracepoints for Pangenome Alignment Compression.

bioRxiv : the preprint server for biology·2026
Same author

gpuPairHMM: High-Speed Pair-HMM Forward Algorithm for DNA Variant Calling on GPUs.

IEEE transactions on computational biology and bioinformatics·2026
Same author

Genome sequence and annotation of ovine herpesvirus 1

The Journal of general virology·2026
Same author

A binary self-amplifying expression platform enabling lipid nanoparticle-free vaccines and nanomedicines.

Nature communications·2025

Related Experiment Video

Updated: Apr 1, 2026

Gradient Echo Quantum Memory in Warm Atomic Vapor
10:00

Gradient Echo Quantum Memory in Warm Atomic Vapor

Published on: November 11, 2013

13.3K

Boosting the FM-Index on the GPU: Effective Techniques to Mitigate Random Memory Access.

Alejandro Chacón, Santiago Marco-Sola, Antonio Espinosa

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |October 10, 2015
    PubMed
    Summary

    Researchers optimized FM-index searches for faster genomic analysis on GPUs. New strategies reduce memory bottlenecks, significantly accelerating sequence alignment for high-throughput sequencing data.

    More Related Videos

    Optimizing Magnetic Force Microscopy Resolution and Sensitivity to Visualize Nanoscale Magnetic Domains
    07:42

    Optimizing Magnetic Force Microscopy Resolution and Sensitivity to Visualize Nanoscale Magnetic Domains

    Published on: July 20, 2022

    3.5K
    Frequency Mixing Magnetic Detection Scanner for Imaging Magnetic Particles in Planar Samples
    07:01

    Frequency Mixing Magnetic Detection Scanner for Imaging Magnetic Particles in Planar Samples

    Published on: June 9, 2016

    10.0K

    Related Experiment Videos

    Last Updated: Apr 1, 2026

    Gradient Echo Quantum Memory in Warm Atomic Vapor
    10:00

    Gradient Echo Quantum Memory in Warm Atomic Vapor

    Published on: November 11, 2013

    13.3K
    Optimizing Magnetic Force Microscopy Resolution and Sensitivity to Visualize Nanoscale Magnetic Domains
    07:42

    Optimizing Magnetic Force Microscopy Resolution and Sensitivity to Visualize Nanoscale Magnetic Domains

    Published on: July 20, 2022

    3.5K
    Frequency Mixing Magnetic Detection Scanner for Imaging Magnetic Particles in Planar Samples
    07:01

    Frequency Mixing Magnetic Detection Scanner for Imaging Magnetic Particles in Planar Samples

    Published on: June 9, 2016

    10.0K

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Genomics

    Background:

    • High-throughput sequencing generates vast amounts of short reads, necessitating efficient string searching techniques.
    • Current sequence alignment tools widely use the FM-index for fast exact searches in large genomic datasets.
    • Memory access patterns in FM-index searches create a bottleneck on both CPUs and GPUs.

    Purpose of the Study:

    • To identify and implement strategies for removing the memory bottleneck in FM-index searches on GPUs.
    • To enhance the performance of GPU-based sequence alignment for large-scale genomic data analysis.

    Main Methods:

    • Developed more compact FM-indexes by enabling cooperative work among threads on larger memory blocks.
    • Implemented a k-step FM-index to further decrease the number of required memory accesses.
    • Optimized GPU implementation by combining these and other techniques to improve computational efficiency.

    Main Results:

    • Achieved a processing speed of approximately two Gbases of queries per second on the test platform.
    • Demonstrated an 8x speedup compared to a comparable multi-core CPU implementation.
    • Showed a 3x to 5x performance improvement over the existing Nvidia NVBIO library's FM-index GPU implementation.

    Conclusions:

    • The implemented GPU strategies effectively overcome memory access limitations in FM-index searches.
    • The optimized approach offers significant performance gains for large-scale genomic sequence alignment.
    • This advancement accelerates bioinformatics analyses reliant on efficient processing of high-throughput sequencing data.