activity
20132026
most citedSWAPHI: Smith-Waterman Protein Database Search on Xeon Phi Coprocessors

45 citations · 66 across the 10 of their papers we have counts for

collaborators
Showing cs.DCShow all

9 papers · 1 filter

cs.DC2026

cuSBF: A Minimizer-Aware Bloom Filter for Genomic Sequence Data on Modern GPUs

Tim Dortmann, Markus Vieth, Bertil Schmidt

Efficient genomic k-mer indexing depends on approximate membership query (AMQ) structures that must deliver high throughput, low false-positive rates (FPR), and modest memory footp…

cs.DC2026

Cuckoo-GPU: Accelerating Cuckoo Filters on Modern GPUs

Tim Dortmann, Markus Vieth, Bertil Schmidt

Approximate Membership Query (AMQ) structures are essential for high-throughput systems in databases, networking, and bioinformatics. While Bloom filters offer speed, they lack sup…

cs.DC2025

Optimizing Bloom Filters on Modern GPUs

Daniel Jünger, Kevin Kristensen, Yunsong Wang +2

Bloom filters are a fundamental data structure for approximate membership queries in applications ranging from analytics and databases to genomics. Deployed as prefilters, they eli…

cs.DC2022★ 4 cited

Online Event Selection for Mu3e using GPUs

Valentin Henkys, Bertil Schmidt, Niklaus Berger

In the search for physics beyond the Standard Model the Mu3e experiment tries to observe the lepton flavor violating decay . By observing the decay pro…

cs.DC2022★ 14 cited

AnySeq/GPU: A Novel Approach for Faster Sequence Alignment on GPUs

André Müller, Bertil Schmidt, Richard Membarth +2

In recent years, the rapidly increasing number of reads produced by next-generation sequencing (NGS) technologies has driven the demand for efficient implementations of sequence al…

cs.DC2021

Accelerating JPEG Decompression on GPUs

André Weißenberger, Bertil Schmidt

The JPEG compression format has been the standard for lossy image compression for over multiple decades, offering high compression rates at minor perceptual loss in image quality.…

cs.DC2020

WarpCore: A Library for fast Hash Tables on GPUs

Daniel Jünger, Robin Kobus, André Müller +4

Hash tables are ubiquitous. Properties such as an amortized constant time complexity for insertion and querying as well as a compact memory layout make them versatile associative d…

cs.DC2020★ 2 cited

AnySeq: A High Performance Sequence Alignment Library based on Partial Evaluation

André Müller, Bertil Schmidt, Andreas Hildebrandt +4

Sequence alignments are fundamental to bioinformatics which has resulted in a variety of optimized implementations. Unfortunately, the vast majority of them are hand-tuned and spec…

cs.DC2014★ 45 cited

SWAPHI: Smith-Waterman Protein Database Search on Xeon Phi Coprocessors

Yongchao Liu, Bertil Schmidt

The maximal sensitivity of the Smith-Waterman (SW) algorithm has enabled its wide use in biological sequence database search. Unfortunately, the high sensitivity comes at the expen…